Theorems · Definition · order theory
partialSups
{α : Type u_1} →
{ι : Type u_3} → [inst : SemilatticeSup α] → [inst_1 : Preorder ι] → [LocallyFiniteOrderBot ι] → (ι → α) → ι →o αThe monotone sequence whose value at i is the supremum of the f j where j ≤ i.
- Defined in
- Mathlib.Order.PartialSups
- Cited by
- 67 results in Mathlib
- Foundations
- Depth 70 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Preorderstatement and proof · cited by 7,952
- OrderHomstatement · cited by 934
- SemilatticeSupstatement and proof · cited by 785
- LocallyFiniteOrderBotstatement and proof · cited by 286
- Finset.Iicproof · cited by 280
- Finset.sup'proof · cited by 174
- Finset.nonempty_Iicproof · cited by 18
Cited by69
Results whose statement or proof uses this declaration.
- partialSups_applystatement · cited by 7
- Monotone.partialSups_eqstatement · cited by 7
- partialSups_disjointedstatement and proof · cited by 5
- le_partialSupsstatement · cited by 5
- map_partialSupsstatement · cited by 4
- partialSups_eq_biSupstatement and proof · cited by 4
- le_partialSups_of_lestatement · cited by 4
- iSup_partialSups_eqstatement · cited by 3
- disjointed_succstatement and proof · cited by 3
- partialSups_add_onestatement · cited by 3
- partialSups_iff_forallstatement · cited by 3
- partialSups_lestatement · cited by 3