Theorems · Theorem · order theory
inf_eq_bot_of_bot_mem
∀ {α : Type u_1} [inst : ConditionallyCompletePartialOrderInf α] {s : Set α} [inst_1 : OrderBot α], ⊥ ∈ s → sInf 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
- Bot.botstatement and proof · cited by 4,720
- OrderBotstatement and proof · cited by 1,055
- InfSet.sInfstatement · cited by 935
- bot_leproof · cited by 306
- ConditionallyCompletePartialOrderInfstatement and proof · cited by 51
- IsLeast.csInf_eqproof · cited by 11
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.