Theorems · Theorem · order theory
Order.IsPredPrelimit.lt_pred_iff
∀ {α : Type u_1} {a b : α} [inst : PartialOrder α] [inst_1 : PredOrder α],
Order.IsPredPrelimit b → (b < Order.pred a ↔ b < a)- Defined in
- Mathlib.Order.SuccPred.Limit
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 22 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PartialOrderPredOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- PartialOrderstatement and proof · cited by 6,410
- PredOrderstatement and proof · cited by 334
- Order.predstatement and proof · cited by 273
- Order.IsPredPrelimitstatement and proof · cited by 93
- LE.le.trans_lt'proof · cited by 50
- Order.pred_leproof · cited by 19
- Order.IsPredPrelimit.lt_predproof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- Order.IsPredPrelimit.pred_le_iffproof · cited by 1
- Order.IsPredLimit.lt_pred_iffproof · cited by 0