Theorems · Theorem · group theory
MonoidHom.map_finprod_of_preimage_one
∀ {M : Type u_2} {N : Type u_3} {α : Sort u_4} [inst : CommMonoid M] [inst_1 : CommMonoid N] (f : M →* N),
(∀ (x : M), f x = 1 → x = 1) → ∀ (g : α → M), f (∏ᶠ (i : α), g i) = ∏ᶠ (i : α), f (g i)- Defined in
- Mathlib.Algebra.BigOperators.Finprod
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 75 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.
Cites9
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
- MonoidHomstatement and proof · cited by 3,629
- CommMonoidstatement and proof · cited by 2,264
- finprodstatement and proof · cited by 257
- Function.HasFiniteMulSupportproof · cited by 99
- MonoidHom.map_oneproof · cited by 27
- Set.Infinite.monoproof · cited by 25
- finprod_def'proof · cited by 8
- MonoidHom.map_finprod_pliftproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- MonoidHom.map_finprod_of_injectiveproof · cited by 3
- NumberField.FinitePlace.prod_eq_inv_abs_norm_intproof · cited by 1