Theorems · Definition · combinatorics
Set.hasInfs
{α : Type u_2} → [SemilatticeInf α] → HasInfs (Set α)s ⊼ t is the set of elements of the form a ⊓ b where a ∈ s, b ∈ t.
- Defined in
- Mathlib.Data.Set.Sups
- Cited by
- 43 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
- Assumes
- SemilatticeInf
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- SemilatticeInfstatement and proof · cited by 634
- Set.image2proof · cited by 311
- HasInfsstatement · cited by 0
Cited by43
Results whose statement or proof uses this declaration.
- Finset.coe_infsstatement · cited by 3
- lowerClosure_infsstatement · cited by 1
- Set.subset_infs_selfstatement · cited by 1
- Set.sep_infs_lestatement · cited by 1
- Set.mem_infsstatement · cited by 1
- Set.infs_self_subsetstatement · cited by 1
- Set.infs_subset_iffstatement · cited by 1
- Set.infs_sups_subset_rightstatement · cited by 0
- Set.infs_union_leftstatement · cited by 0
- Set.infs_union_rightstatement · cited by 0
- Set.sups_infs_subset_leftstatement · cited by 0
- Set.sups_infs_subset_rightstatement · cited by 0