Theorems · Theorem · order theory
Set.map_finite_iInf
∀ {α : Type u} {β : Type v} {F : Type u_1} {ι : Type u_2} [inst : CompleteLattice α] [inst_1 : CompleteLattice β]
[inst_2 : FunLike F α β] [InfTopHomClass F α β] [Finite ι] (f : F) (g : ι → α), f (⨅ i, g i) = ⨅ i, f (g i)- Defined in
- Mathlib.Data.Set.Finite.Lattice
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- DFunLike.coestatement and proof · cited by 62,936
- Set.univproof · cited by 3,945
- Finitestatement and proof · cited by 3,029
- FunLikestatement and proof · cited by 2,560
- iInfstatement and proof · cited by 1,690
- CompleteLatticestatement and proof · cited by 1,048
- Set.finite_univproof · cited by 52
- iInf_univproof · cited by 8
- InfTopHomClassstatement and proof · cited by 4
- Set.map_finite_biInfproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.