Theorems · Theorem · order theory
isMin_of_pred_notMem
∀ {α : Type u_3} [inst : PartialOrder α] {s : Set α} [s.OrdConnected] [inst_2 : PredOrder α] {a : ↑s},
Order.pred ↑a ∉ s → IsMin a- Defined in
- Mathlib.Order.SuccPred.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.Elemstatement and proof · cited by 7,166
- PartialOrderstatement and proof · cited by 6,410
- PredOrderstatement and proof · cited by 334
- IsMinstatement · cited by 277
- Order.predstatement and proof · cited by 273
- Set.OrdConnectedstatement and proof · cited by 161
- Order.pred_eq_iff_isMinproof · cited by 8
Cited by1
Results whose statement or proof uses this declaration.
- pred_notMem_iff_isMinproof · cited by 0