Theorems · Theorem · order theory
Finset.inf_union
∀ {α : Type u_2} {β : Type u_3} [inst : SemilatticeInf α] [inst_1 : OrderTop α] {s₁ s₂ : Finset β} {f : β → α}
[inst_2 : DecidableEq β], (s₁ ∪ s₂).inf f = s₁.inf f ⊓ s₂.inf f- Defined in
- Mathlib.Data.Finset.Lattice.Fold
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- SemilatticeInfstatement and proof · cited by 634
- OrderTopstatement and proof · cited by 493
- Finset.infstatement · cited by 219
- eq_of_forall_le_iffproof · cited by 65
- Finset.mem_unionproof · cited by 49
- le_inf_iffproof · cited by 48
- Finset.le_inf_iffproof · cited by 12
Cited by1
Results whose statement or proof uses this declaration.
- Finset.min_unionproof · cited by 0