Theorems · Theorem · group theory
Finset.prod_eq_mul_of_mem
∀ {ι : Type u_1} {M : Type u_4} [inst : CommMonoid M] {s : Finset ι} {f : ι → M} (a b : ι),
a ∈ s → b ∈ s → a ≠ b → (∀ c ∈ s, c ≠ a ∧ c ≠ b → f c = 1) → ∏ x ∈ s, f x = f a * f b- Cited by
- 1 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommMonoid
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.
- Finsetstatement and proof · cited by 13,712
- Finset.prodstatement · cited by 2,356
- CommMonoidstatement and proof · cited by 2,264
- Classical.decEqproof · cited by 134
- Finset.prod_subsetproof · cited by 31
- Finset.prod_pairproof · cited by 5
Cited by1
Results whose statement or proof uses this declaration.
- Finset.prod_eq_mulproof · cited by 1