Theorems · Definition · order theory
Finset.hasInfs
{α : Type u_2} → [DecidableEq α] → [SemilatticeInf α] → HasInfs (Finset α)s ⊼ t is the finset of elements of the form a ⊓ b where a ∈ s, b ∈ t.
- Defined in
- Mathlib.Data.Finset.Sups
- Cited by
- 62 results in Mathlib
- Foundations
- Depth 75 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqSemilatticeInf
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.
- Finsetstatement · cited by 13,712
- SemilatticeInfstatement and proof · cited by 634
- Finset.image₂proof · cited by 104
- HasInfsstatement · cited by 0
Cited by62
Results whose statement or proof uses this declaration.
- four_functions_theoremstatement · cited by 3
- Finset.infs_compls_eq_diffsstatement · cited by 3
- Finset.coe_infsstatement · cited by 3
- Finset.univ_infs_univstatement · cited by 2
- Finset.inter_mem_infsstatement · cited by 1
- Finset.empty_infsstatement · cited by 1
- Finset.truncatedSup_infsstatement · cited by 1
- AhlswedeZhang.supSum_union_add_supSum_infsstatement · cited by 1
- Finset.truncatedSup_infs_of_notMemstatement · cited by 1
- Finset.le_card_infs_mul_card_supsstatement · cited by 1
- Finset.inf_mem_infsstatement · cited by 1
- Finset.image_infsstatement · cited by 1