Theorems · Theorem · order theory
ChainCompletePartialOrder.IsExtremePt.setOf_isExtremePt_eq_bot
Deprecated since 2026-07-09Use ChainCompletePartialOrder.IsExtremePt.setOfPred_isExtremePt_eq_bot instead.
∀ {α : Type u_1} [inst : ChainCompletePartialOrder α] {x : α} {f : α → α},
(∀ (x : α), x ≤ f x) → {y | ChainCompletePartialOrder.IsExtremePt x f y} = ChainCompletePartialOrder.bot x fAlias of ChainCompletePartialOrder.IsExtremePt.setOfPred_isExtremePt_eq_bot.
- Defined in
- Mathlib.Order.BourbakiWitt
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- ChainCompletePartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Set.ofPredstatement · cited by 6,101
- ChainCompletePartialOrderstatement · cited by 19
- ChainCompletePartialOrder.botstatement · cited by 12
- ChainCompletePartialOrder.IsExtremePtstatement · cited by 8
- ChainCompletePartialOrder.IsExtremePt.setOfPred_isExtremePt_eq_botproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.