Mathlib Map

Theorems · Theorem · combinatorics

BinaryTree.node.injEq

∀ {α : Type u} (value : α) (left right : BinaryTree α) (value_1 : α) (left_1 right_1 : BinaryTree α),
  (BinaryTree.node value left right = BinaryTree.node value_1 left_1 right_1) =
    (value = value_1 ∧ left = left_1 ∧ right = right_1)
Defined in
Mathlib.Data.Tree.Basic
Cited by
1 results in Mathlib
Foundations
Depth 8 from the axioms · uses propext
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

BinaryTree.mem_treesOfNumNodesEq · cited by 1BinaryTree.mem_treesOfNum…BinaryTree · cited by 41BinaryTreeBinaryTree.node.inj · cited by 1node.injnode.injEqCITED BYCITES

Cites2

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.