Theorems · Theorem · order theory
Finset.compl_inf
∀ {α : Type u_2} {ι : Type u_5} [inst : BooleanAlgebra α] (s : Finset ι) (f : ι → α), (s.inf f)ᶜ = s.sup fun i => (f i)ᶜ- Defined in
- Mathlib.Data.Finset.Lattice.Fold
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- BooleanAlgebra
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- Compl.complstatement · cited by 2,925
- Finset.supstatement · cited by 530
- BooleanAlgebrastatement and proof · cited by 300
- Finset.infstatement · cited by 219
- map_finset_infproof · cited by 10
- OrderIso.complproof · cited by 10
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.