Theorems · Theorem · order theory
map_iSup
∀ {F : Type u_1} {α : Type u_2} {β : Type u_3} {ι : Sort u_6} [inst : FunLike F α β] [inst_1 : SupSet α]
[inst_2 : SupSet β] [sSupHomClass F α β] (f : F) (g : ι → α), f (⨆ i, g i) = ⨆ i, f (g i)- Defined in
- Mathlib.Order.Hom.CompleteLattice
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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.rangeproof · cited by 4,705
- FunLikestatement and proof · cited by 2,560
- iSupstatement · cited by 2,415
- SupSet.sSupproof · cited by 954
- SupSetstatement and proof · cited by 154
- sSupHomClassstatement and proof · cited by 3
- sSupHomClass.map_sSupproof · cited by 2
Cited by5
Results whose statement or proof uses this declaration.
- sSupHom.apply_blimsup_leproof · cited by 2
- CompleteLatticeHom.apply_limsup_iterateproof · cited by 2
- map_iSup₂proof · cited by 1
- Submodule.restrictScalars_iSupproof · cited by 1
- CompleteSublattice.mem_iSupproof · cited by 0