Theorems · Theorem · order theory
Equiv.iInf_comp
∀ {α : Type u_1} {ι : Sort u_4} {ι' : Sort u_5} [inst : InfSet α] {g : ι' → α} (e : ι ≃ ι'), ⨅ x, g (e x) = ⨅ y, g y- Defined in
- Mathlib.Order.CompleteLattice.Basic
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Quot.sound
- Assumes
- InfSet
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Equivstatement and proof · cited by 8,337
- iInfstatement · cited by 1,690
- Equiv.surjectiveproof · cited by 198
- InfSetstatement and proof · cited by 145
- Function.Surjective.iInf_compproof · cited by 7
Cited by9
Results whose statement or proof uses this declaration.
- iInf_iSup_eq_of_finiteproof · cited by 2
- Subgroup.normalCore_eq_iInf_map_conjproof · cited by 1
- ProbabilityTheory.bayesRisk_eq_iInf_measure_of_subsingletonproof · cited by 1
- Subspace.dualAnnihilator_iInf_eqproof · cited by 1
- TopologicalSpace.Opens.coe_iInfproof · cited by 1
- AddSubgroup.normalCore_eq_iInf_comap_addConjproof · cited by 1
- AddSubgroup.normalCore_eq_iInf_map_addConjproof · cited by 1
- Subgroup.normalCore_eq_iInf_comap_conjproof · cited by 1
- Equiv.biInf_compproof · cited by 0