Theorems · Theorem · order theory
sSup_ne_of_notMem
∀ {α : Type u_5} [inst : CompleteLinearOrder α] {s : Set α}, s.Finite → ∀ {a : α}, a ≠ ⊥ → a ∉ s → sSup s ≠ a- Cited by
- 3 results in Mathlib
- Foundations
- Depth 75 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CompleteLinearOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- Bot.botstatement and proof · cited by 4,720
- Set.Nonemptyproof · cited by 2,627
- Set.Finitestatement and proof · cited by 1,814
- SupSet.sSupstatement and proof · cited by 954
- Set.eq_empty_or_nonemptyproof · cited by 248
- CompleteLinearOrderstatement and proof · cited by 126
- sSup_emptyproof · cited by 19
- Set.Nonempty.csSup_memproof · cited by 11
Cited by3
Results whose statement or proof uses this declaration.
- iSup_ne_of_notMemproof · cited by 2
- sSup_ne_topproof · cited by 1
- sInf_ne_of_notMemproof · cited by 0