Theorems · Theorem · combinatorics
SimpleGraph.hasse_preconnected_of_pred
∀ (α : Type u_1) [inst : LinearOrder α] [inst_1 : PredOrder α] [IsPredArchimedean α], (SimpleGraph.hasse α).Preconnected
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Hasse
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 30 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
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.Iocproof · cited by 971
- PredOrderstatement and proof · cited by 334
- Function.swapproof · cited by 216
- IsPredArchimedeanstatement and proof · cited by 66
- SimpleGraph.Preconnectedstatement · cited by 49
- Order.pred_covBy_of_not_isMinproof · cited by 8
- LT.lt.not_isMinproof · cited by 8
- SimpleGraph.hassestatement and proof · cited by 8
- SimpleGraph.reachable_iff_reflTransGenproof · cited by 3
- Relation.reflTransGen_swapproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.