Theorems · Theorem · combinatorics
Set.infs_subset_iff
∀ {α : Type u_2} [inst : SemilatticeInf α] {s t u : Set α}, s ⊼ t ⊆ u ↔ ∀ a ∈ s, ∀ b ∈ t, a ⊓ b ∈ u- Defined in
- Mathlib.Data.Set.Sups
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 18 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SemilatticeInf
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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
- SemilatticeInfstatement and proof · cited by 634
- HasInfs.infsstatement · cited by 105
- Set.hasInfsstatement · cited by 43
- Set.image2_subset_iffproof · cited by 30
Cited by1
Results whose statement or proof uses this declaration.
- Set.infs_self_subsetproof · cited by 1