Theorems · Theorem · order theory
Finset.mem_inf
∀ {ι : Type u_1} {α : Type u_2} [inst : Fintype α] [inst_1 : DecidableEq α] {s : Finset ι} {f : ι → Finset α} {a : α},
a ∈ s.inf f ↔ ∀ i ∈ s, a ∈ f i- Defined in
- Mathlib.Data.Fintype.Lattice
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- Fintypestatement and proof · cited by 7,736
- Finset.infstatement and proof · cited by 219
- Finset.cons_inductionproof · cited by 85
- Finset.inf_consproof · cited by 16
- Finset.inf_emptyproof · cited by 15
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.