Theorems · Theorem · order theory
List.foldr_inf_eq_inf_toFinset
∀ {α : Type u_2} [inst : SemilatticeInf α] [inst_1 : OrderTop α] [inst_2 : DecidableEq α] (l : List α),
List.foldr (fun x1 x2 => x1 ⊓ x2) ⊤ l = l.toFinset.inf id- Defined in
- Mathlib.Data.Finset.Lattice.Fold
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 75 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites19
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetproof · cited by 13,712
- Top.topstatement and proof · cited by 9,680
- Multisetproof · cited by 2,627
- Multiset.mapproof · cited by 876
- SemilatticeInfstatement and proof · cited by 634
- OrderTopstatement and proof · cited by 493
- Finset.valproof · cited by 438
- Multiset.ofListproof · cited by 290
- Finset.infstatement and proof · cited by 219
- List.toFinsetstatement and proof · cited by 108
- Multiset.dedupproof · cited by 59
- Multiset.foldproof · cited by 38
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.