Mathlib Map

Theorems · Theorem · combinatorics

SimpleGraph.hasse_prod

∀ (α : Type u_1) (β : Type u_2) [inst : PartialOrder α] [inst_1 : PartialOrder β],
  SimpleGraph.hasse (α × β) = SimpleGraph.hasse α □ SimpleGraph.hasse β
Defined in
Mathlib.Combinatorics.SimpleGraph.Hasse
Cited by
0 results in Mathlib
Foundations
Depth 36 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
PartialOrderPartialOrder
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

PartialOrder · cited by 6410PartialOrderSimpleGraph · cited by 3072SimpleGraphSimpleGraph.Adj · cited by 1346SimpleGraph.AdjCovBy · cited by 290CovBySimpleGraph.ext · cited by 59SimpleGraph.extSimpleGraph.boxProd · cited by 31SimpleGraph.boxProdSimpleGraph.hasse · cited by 8SimpleGraph.hasseSimpleGraph.hasse_prodCITED BYCITES

Cites7

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.