Theorems · Theorem · combinatorics
SimpleGraph.hasse_preconnected_of_succ
∀ (α : Type u_1) [inst : LinearOrder α] [inst_1 : SuccOrder α] [IsSuccArchimedean α], (SimpleGraph.hasse α).Preconnected
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Hasse
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 29 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- LinearOrderstatement and proof · cited by 8,572
- SimpleGraph.Adjproof · cited by 1,346
- Set.Icoproof · cited by 799
- SuccOrderstatement and proof · cited by 574
- IsSuccArchimedeanstatement and proof · cited by 88
- SimpleGraph.Preconnectedstatement · cited by 49
- LT.lt.not_isMaxproof · cited by 11
- Order.covBy_succ_of_not_isMaxproof · cited by 8
- SimpleGraph.hassestatement and proof · cited by 8
- reflTransGen_of_succproof · cited by 6
- SimpleGraph.reachable_iff_reflTransGenproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- SimpleGraph.pathGraph_preconnectedproof · cited by 2