Theorems · Inductive type · order theory
ChainCompletePartialOrder.IsAdmissible
{α : Type u_1} → [ChainCompletePartialOrder α] → α → (α → α) → Set α → PropAn admissible set for given x : α and f : α → α has x, the base point, as a least element
and is closed under applying f and cSup.
- Defined in
- Mathlib.Order.BourbakiWitt
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
- Assumes
- ChainCompletePartialOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- ChainCompletePartialOrderstatement · cited by 19
Cited by11
Results whose statement or proof uses this declaration.
- ChainCompletePartialOrder.botproof · cited by 12
- ChainCompletePartialOrder.IsAdmissible.cSup_memstatement and proof · cited by 4
- ChainCompletePartialOrder.IsAdmissible.base_isLeaststatement and proof · cited by 4
- ChainCompletePartialOrder.bot_isAdmissiblestatement and proof · cited by 4
- ChainCompletePartialOrder.IsAdmissible.image_self_subset_selfstatement and proof · cited by 3
- ChainCompletePartialOrder.subset_bot_iffstatement and proof · cited by 2
- ChainCompletePartialOrder.IsExtremePt.setOfPred_isExtremePt_isAdmissiblestatement · cited by 2
- ChainCompletePartialOrder.ici_isAdmissiblestatement · cited by 1
- ChainCompletePartialOrder.IsExtremePt.setOf_isExtremePt_isAdmissiblestatement · cited by 0
- ChainCompletePartialOrder.IsAdmissible.casesOnstatement and proof · cited by 0
- ChainCompletePartialOrder.IsAdmissible.recOnstatement and proof · cited by 0