Theorems · Theorem · order theory
Finset.inf_id_eq_sInf
∀ {α : Type u_2} [inst : CompleteLattice α] (s : Finset α), s.inf id = sInf ↑s- Defined in
- Mathlib.Data.Finset.Lattice.Fold
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- SetLike.coestatement · cited by 8,199
- iInfproof · cited by 1,690
- CompleteLatticestatement and proof · cited by 1,048
- InfSet.sInfstatement · cited by 935
- SetLike.mem_coeproof · cited by 302
- Finset.infstatement · cited by 219
- iInf_congr_Propproof · cited by 218
- sInf_eq_iInfproof · cited by 22
- Finset.inf_eq_iInfproof · cited by 19
Cited by4
Results whose statement or proof uses this declaration.
- Submodule.exists_eq_colon_of_mem_minimalPrimesproof · cited by 1
- Finset.inf_id_set_eq_sInterproof · cited by 0
- Finset.inf_eq_sInf_imageproof · cited by 0