Theorems · Theorem · order theory
iSup_congr
∀ {α : Type u_1} {ι : Sort u_4} [inst : SupSet α] {f g : ι → α}, (∀ (i : ι), f i = g i) → ⨆ i, f i = ⨆ i, g i- Defined in
- Mathlib.Order.CompleteLattice.Basic
- Cited by
- 15 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses Quot.sound
- Assumes
- SupSet
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by15
Results whose statement or proof uses this declaration.
- biSup_prodproof · cited by 5
- Set.iUnion_congrproof · cited by 5
- biSup_congrproof · cited by 4
- ProbabilityTheory.Kernel.indep_iSup_limsupproof · cited by 3
- Submodule.map₂_map_rightproof · cited by 2
- Submodule.map_map₂proof · cited by 2
- MeasureTheory.OuterMeasure.trim_iSupproof · cited by 1
- IsUltrametricDist.isPowMul_invariantExtensionproof · cited by 1
- AEMeasurable.biSupproof · cited by 1
- AlgebraicGeometry.Scheme.Modules.exists_isOpenCover_presentationproof · cited by 1
- spectralNorm_unique_of_finiteDimensional_normalproof · cited by 0
- MeasureTheory.Measure.OuterRegular.ext_isOpen_isBoundedproof · cited by 0