Theorems · Theorem · group theory
MulEquiv.map_finprod_mem
∀ {α : Type u_1} {M : Type u_5} {N : Type u_6} [inst : CommMonoid M] [inst_1 : CommMonoid N] (g : M ≃* N) (f : α → M)
{s : Set α}, s.Finite → g (∏ᶠ (i : α) (_ : i ∈ s), f i) = ∏ᶠ (i : α) (_ : i ∈ s), g (f i)- Defined in
- Mathlib.Algebra.BigOperators.Finprod
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommMonoidCommMonoid
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 · cited by 62,936
- Setstatement and proof · cited by 53,352
- CommMonoidstatement and proof · cited by 2,264
- Set.Finitestatement and proof · cited by 1,814
- MulEquivstatement and proof · cited by 1,142
- finprodstatement · cited by 257
- MulEquiv.toMonoidHomproof · cited by 126
- MonoidHom.map_finprod_memproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- finprod_mem_inv_distribproof · cited by 1