Theorems · Theorem · group theory
finprod_cond_eq_prod_of_cond_iff
∀ {α : Type u_1} {M : Type u_5} [inst : CommMonoid M] (f : α → M) {p : α → Prop} {t : Finset α},
(∀ {x : α}, f x ≠ 1 → (p x ↔ x ∈ t)) → ∏ᶠ (i : α) (_ : p i), f i = ∏ i ∈ t, f i- Defined in
- Mathlib.Algebra.BigOperators.Finprod
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 80 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.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- Set.ofPredproof · cited by 6,101
- Finset.prodstatement and proof · cited by 2,356
- CommMonoidstatement and proof · cited by 2,264
- Finset.prod_congrproof · cited by 646
- finprodstatement · cited by 257
- Function.mulSupportproof · cited by 240
- Set.mulIndicatorproof · cited by 163
- finprod_eq_prod_of_mulSupport_subsetproof · cited by 21
- Set.mulSupport_mulIndicatorproof · cited by 6
Cited by6
Results whose statement or proof uses this declaration.
- finprod_mem_eq_prod_of_inter_mulSupport_eqproof · cited by 7
- BumpCovering.toPOUFun_eq_mul_prodproof · cited by 3
- finprod_cond_neproof · cited by 1
- one_lt_finprod_condproof · cited by 1
- mul_finprod_cond_neproof · cited by 1
- finprod_mem_eq_prod_of_subsetproof · cited by 0