Theorems · Theorem · order theory
sup_eq_top_of_top_mem
∀ {α : Type u_1} [inst : ConditionallyCompletePartialOrderSup α] {s : Set α} [inst_1 : OrderTop α], ⊤ ∈ s → sSup s = ⊤- Cited by
- 0 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses no axioms
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.
- Setstatement and proof · cited by 53,352
- Top.topstatement and proof · cited by 9,680
- SupSet.sSupstatement · cited by 954
- OrderTopstatement and proof · cited by 493
- le_topproof · cited by 411
- ConditionallyCompletePartialOrderSupstatement and proof · cited by 52
- IsGreatest.csSup_eqproof · cited by 9
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.