Theorems · Theorem · combinatorics
SimpleGraph.TripartiteFromTriangles.NoAccidental.eq_or_eq_or_eq
∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {t : Finset (α × β × γ)}
[self : SimpleGraph.TripartiteFromTriangles.NoAccidental t] ⦃a a' : α⦄ ⦃b b' : β⦄ ⦃c c' : γ⦄,
(a', b, c) ∈ t → (a, b', c) ∈ t → (a, b, c') ∈ t → a = a' ∨ b = b' ∨ c = c'- Cited by
- 1 results in Mathlib
- Foundations
- Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- SimpleGraph.TripartiteFromTriangles.NoAccidentalstatement and proof · cited by 10
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.TripartiteFromTriangles.is3Clique_iffproof · cited by 2