Mathlib Map

Theorems · Definition · combinatorics

SimpleGraph.TripartiteFromTriangles.NoAccidental.recOn

{α : Type u_1} →
  {β : Type u_2} →
    {γ : Type u_3} →
      {t : Finset (α × β × γ)} →
        {motive : SimpleGraph.TripartiteFromTriangles.NoAccidental t → Sort u} →
          (t_1 : SimpleGraph.TripartiteFromTriangles.NoAccidental t) →
            ((eq_or_eq_or_eq :
                  ∀ ⦃a a' : α⦄ ⦃b b' : β⦄ ⦃c c' : γ⦄,
                    (a', b, c) ∈ t → (a, b', c) ∈ t → (a, b, c') ∈ t → a = a' ∨ b = b' ∨ c = c') →
                motive ⋯) →
              motive t_1
Defined in
Mathlib.Combinatorics.SimpleGraph.Triangle.Tripartite
Cited by
0 results in Mathlib
Foundations
Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Finset · cited by 13712FinsetSimpleGraph.TripartiteFromTriangles.NoAccidental · cited by 10TripartiteFromTriangles.N…NoAccidental.recOnCITED BYCITES

Cites2

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

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.