Theorems · Theorem · order theory
IsCompactlyGenerated.BooleanGenerators.sSup_le_sSup_iff_of_atoms
∀ {α : Type u_1} [inst : CompleteLattice α] {S : Set α} [IsCompactlyGenerated α],
IsCompactlyGenerated.BooleanGenerators S → ∀ (X Y : Set α), X ⊆ S → Y ⊆ S → (sSup X ≤ sSup Y ↔ X ⊆ Y)- Defined in
- Mathlib.Order.BooleanGenerators
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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
- LE.le.transproof · cited by 3,151
- CompleteLatticestatement and proof · cited by 1,048
- SupSet.sSupstatement and proof · cited by 954
- le_sSupproof · cited by 79
- IsCompactlyGeneratedstatement and proof · cited by 37
- sSup_le_sSupproof · cited by 24
- IsCompactlyGenerated.BooleanGeneratorsstatement and proof · cited by 11
- IsCompactlyGenerated.BooleanGenerators.isAtomproof · cited by 6
- IsCompactlyGenerated.BooleanGenerators.mem_of_isAtom_of_le_sSup_atomsproof · cited by 3
- IsCompactlyGenerated.BooleanGenerators.monoproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.