diff --git a/Userland/Libraries/LibSQL/BTree.h b/Userland/Libraries/LibSQL/BTree.h
index 4a45e832c0..93ddb94149 100644
--- a/Userland/Libraries/LibSQL/BTree.h
+++ b/Userland/Libraries/LibSQL/BTree.h
@@ -67,7 +67,7 @@ public:
     [[nodiscard]] TreeNode* down_node(size_t);
     [[nodiscard]] bool is_leaf() const { return m_is_leaf; }
 
-    Key const& operator[](size_t) const;
+    Key const& operator[](size_t index) const { return m_entries[index]; }
     bool insert(Key const&);
     bool update_key_pointer(Key const&);
     TreeNode* node_for(Key const&);
diff --git a/Userland/Libraries/LibSQL/TreeNode.cpp b/Userland/Libraries/LibSQL/TreeNode.cpp
index 1087d46243..749570e2cb 100644
--- a/Userland/Libraries/LibSQL/TreeNode.cpp
+++ b/Userland/Libraries/LibSQL/TreeNode.cpp
@@ -197,21 +197,13 @@ bool TreeNode::insert_in_leaf(Key const& key)
     return true;
 }
 
-Key const& TreeNode::operator[](size_t ix) const
-{
-    VERIFY(ix < size());
-    return m_entries[ix];
-}
-
 u32 TreeNode::down_pointer(size_t ix) const
 {
-    VERIFY(ix < m_down.size());
     return m_down[ix].pointer();
 }
 
 TreeNode* TreeNode::down_node(size_t ix)
 {
-    VERIFY(ix < m_down.size());
     return m_down[ix].node();
 }
 
diff --git a/Userland/Libraries/LibSQL/Tuple.cpp b/Userland/Libraries/LibSQL/Tuple.cpp
index fbaa7bed7e..04fa97813f 100644
--- a/Userland/Libraries/LibSQL/Tuple.cpp
+++ b/Userland/Libraries/LibSQL/Tuple.cpp
@@ -91,18 +91,6 @@ Optional<size_t> Tuple::index_of(String name) const
     return {};
 }
 
-Value const& Tuple::operator[](size_t ix) const
-{
-    VERIFY(ix < m_data.size());
-    return m_data[ix];
-}
-
-Value& Tuple::operator[](size_t ix)
-{
-    VERIFY(ix < m_data.size());
-    return m_data[ix];
-}
-
 Value const& Tuple::operator[](String const& name) const
 {
     auto index = index_of(name);
diff --git a/Userland/Libraries/LibSQL/Tuple.h b/Userland/Libraries/LibSQL/Tuple.h
index 8bab7a5023..0488128097 100644
--- a/Userland/Libraries/LibSQL/Tuple.h
+++ b/Userland/Libraries/LibSQL/Tuple.h
@@ -49,8 +49,8 @@ public:
     [[nodiscard]] bool is_null() const { return m_data.is_empty(); }
     [[nodiscard]] bool has(String const& name) const { return index_of(name).has_value(); }
 
-    Value const& operator[](size_t ix) const;
-    Value& operator[](size_t ix);
+    Value const& operator[](size_t ix) const { return m_data[ix]; }
+    Value& operator[](size_t ix) { return m_data[ix]; }
     Value const& operator[](String const& name) const;
     Value& operator[](String const& name);
     void append(Value const&);