Theorems · Theorem · combinatorics

SimpleGraph.TripartiteFromTriangles.toTriangle_surjOn

∀ {α : Type u_1} {β : Type u_2} {γ : Type u_3} {t : Finset (α × β × γ)} [inst : DecidableEq α] [inst_1 : DecidableEq β]
  [inst_2 : DecidableEq γ] [SimpleGraph.TripartiteFromTriangles.NoAccidental t],
  Set.SurjOn (⇑SimpleGraph.TripartiteFromTriangles.toTriangle) (↑t)
    ((SimpleGraph.TripartiteFromTriangles.graph t).cliqueSet 3)

Defined in: Mathlib.Combinatorics.SimpleGraph.Triangle.Tripartite
Cited by: 0 results in Mathlib
Foundations: Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: DecidableEq DecidableEq DecidableEq SimpleGraph.TripartiteFromTriangles.NoAccidental

Mathlib docs Source Loogle LeanSearch

Around this declaration

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

Cites10

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

DFunLike.coestatement · cited by 62,936
Finsetstatement and proof · cited by 13,712
SetLike.coestatement · cited by 8,199
Function.Embeddingstatement · cited by 988
Set.SurjOnstatement · cited by 186
SimpleGraph.TripartiteFromTriangles.graphstatement · cited by 27
SimpleGraph.cliqueSetstatement · cited by 18
SimpleGraph.TripartiteFromTriangles.toTrianglestatement · cited by 12
SimpleGraph.TripartiteFromTriangles.NoAccidentalstatement and proof · cited by 10
SimpleGraph.TripartiteFromTriangles.is3Clique_iffproof · cited by 2

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.