Theorem domnprodeq0 33929

Description: A product over a domain is zero exactly when one of the factors is zero. Generalization of domneq0 21002 for any number of factors. See also domnprodn0 33928. (Contributed by Thierry Arnoux, 15-Feb-2026.)

Hypotheses

Ref	Expression
domnprodeq0.m	⊢ 𝑀 = (mulGrp‘𝑅)
domnprodeq0.b	⊢ 𝐵 = (Base‘𝑅)
domnprodeq0.1	⊢ 0 = (0g‘𝑅)
domnprodeq0.r	⊢ (𝜑 → 𝑅 ∈ IDomn)
domnprodeq0.2	⊢ (𝜑 → 𝐴 ∈ Fin)
domnprodeq0.f	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)

Assertion

Ref	Expression
domnprodeq0	⊢ (𝜑 → ((𝑀 Σg 𝐹) = 0 ↔ 0 ∈ ran 𝐹))

Proof of Theorem domnprodeq0

Dummy variables 𝑎 𝑏 𝑘 𝑙 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mpteq1 5198	. . . . . . 7 ⊢ (𝑎 = ∅ → (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) = (𝑘 ∈ ∅ ↦ (𝐹‘𝑘)))
2		mpt0 6709	. . . . . . 7 ⊢ (𝑘 ∈ ∅ ↦ (𝐹‘𝑘)) = ∅
3	1, 2	eqtrdi 2814	. . . . . 6 ⊢ (𝑎 = ∅ → (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) = ∅)
4	3	oveq2d 7465	. . . . 5 ⊢ (𝑎 = ∅ → (𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = (𝑀 Σg ∅))
5	4	eqeq1d 2765	. . . 4 ⊢ (𝑎 = ∅ → ((𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = 0 ↔ (𝑀 Σg ∅) = 0 ))
6	3	rneqd 5930	. . . . 5 ⊢ (𝑎 = ∅ → ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) = ran ∅)
7	6	eleq2d 2850	. . . 4 ⊢ (𝑎 = ∅ → ( 0 ∈ ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) ↔ 0 ∈ ran ∅))
8	5, 7	bibi12d 348	. . 3 ⊢ (𝑎 = ∅ → (((𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) ↔ ((𝑀 Σg ∅) = 0 ↔ 0 ∈ ran ∅)))
9		mpteq1 5198	. . . . . 6 ⊢ (𝑎 = 𝑏 → (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) = (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))
10	9	oveq2d 7465	. . . . 5 ⊢ (𝑎 = 𝑏 → (𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = (𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))))
11	10	eqeq1d 2765	. . . 4 ⊢ (𝑎 = 𝑏 → ((𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = 0 ↔ (𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ))
12	9	rneqd 5930	. . . . 5 ⊢ (𝑎 = 𝑏 → ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) = ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))
13	12	eleq2d 2850	. . . 4 ⊢ (𝑎 = 𝑏 → ( 0 ∈ ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) ↔ 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))))
14	11, 13	bibi12d 348	. . 3 ⊢ (𝑎 = 𝑏 → (((𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) ↔ ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))))
15		mpteq1 5198	. . . . . 6 ⊢ (𝑎 = (𝑏 ∪ {𝑙}) → (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) = (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘)))
16	15	oveq2d 7465	. . . . 5 ⊢ (𝑎 = (𝑏 ∪ {𝑙}) → (𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = (𝑀 Σg (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))))
17	16	eqeq1d 2765	. . . 4 ⊢ (𝑎 = (𝑏 ∪ {𝑙}) → ((𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = 0 ↔ (𝑀 Σg (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))) = 0 ))
18	15	rneqd 5930	. . . . 5 ⊢ (𝑎 = (𝑏 ∪ {𝑙}) → ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) = ran (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘)))
19	18	eleq2d 2850	. . . 4 ⊢ (𝑎 = (𝑏 ∪ {𝑙}) → ( 0 ∈ ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) ↔ 0 ∈ ran (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))))
20	17, 19	bibi12d 348	. . 3 ⊢ (𝑎 = (𝑏 ∪ {𝑙}) → (((𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) ↔ ((𝑀 Σg (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘)))))
21		mpteq1 5198	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)))
22	21	oveq2d 7465	. . . . 5 ⊢ (𝑎 = 𝐴 → (𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = (𝑀 Σg (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))))
23	22	eqeq1d 2765	. . . 4 ⊢ (𝑎 = 𝐴 → ((𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = 0 ↔ (𝑀 Σg (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) = 0 ))
24	21	rneqd 5930	. . . . 5 ⊢ (𝑎 = 𝐴 → ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) = ran (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)))
25	24	eleq2d 2850	. . . 4 ⊢ (𝑎 = 𝐴 → ( 0 ∈ ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘)) ↔ 0 ∈ ran (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))))
26	23, 25	bibi12d 348	. . 3 ⊢ (𝑎 = 𝐴 → (((𝑀 Σg (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑎 ↦ (𝐹‘𝑘))) ↔ ((𝑀 Σg (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)))))
27		domnprodeq0.m	. . . . . . . . 9 ⊢ 𝑀 = (mulGrp‘𝑅)
28		eqid 2763	. . . . . . . . 9 ⊢ (1r‘𝑅) = (1r‘𝑅)
29	27, 28	ringidval 20451	. . . . . . . 8 ⊢ (1r‘𝑅) = (0g‘𝑀)
30	29	gsum0 18914	. . . . . . 7 ⊢ (𝑀 Σg ∅) = (1r‘𝑅)
31	30	a1i 11	. . . . . 6 ⊢ (𝜑 → (𝑀 Σg ∅) = (1r‘𝑅))
32		domnprodeq0.r	. . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ IDomn)
33	32	idomdomd 21019	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ Domn)
34		domnnzr 21000	. . . . . . 7 ⊢ (𝑅 ∈ Domn → 𝑅 ∈ NzRing)
35		domnprodeq0.1	. . . . . . . 8 ⊢ 0 = (0g‘𝑅)
36	28, 35	nzrnz 20807	. . . . . . 7 ⊢ (𝑅 ∈ NzRing → (1r‘𝑅) ≠ 0 )
37	33, 34, 36	3syl 19	. . . . . 6 ⊢ (𝜑 → (1r‘𝑅) ≠ 0 )
38	31, 37	eqnetrd 3026	. . . . 5 ⊢ (𝜑 → (𝑀 Σg ∅) ≠ 0 )
39	38	neneqd 2964	. . . 4 ⊢ (𝜑 → ¬ (𝑀 Σg ∅) = 0 )
40		noel 4286	. . . . . 6 ⊢ ¬ 0 ∈ ∅
41		rn0 5918	. . . . . . 7 ⊢ ran ∅ = ∅
42	41	eleq2i 2856	. . . . . 6 ⊢ ( 0 ∈ ran ∅ ↔ 0 ∈ ∅)
43	40, 42	mtbir 326	. . . . 5 ⊢ ¬ 0 ∈ ran ∅
44	43	a1i 11	. . . 4 ⊢ (𝜑 → ¬ 0 ∈ ran ∅)
45	39, 44	2falsed 379	. . 3 ⊢ (𝜑 → ((𝑀 Σg ∅) = 0 ↔ 0 ∈ ran ∅))
46		simpr 490	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) ∧ ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))) → ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))))
47	46	orbi1d 930	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) ∧ ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))) → (((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ∨ (𝐹‘𝑙) = 0 ) ↔ ( 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)) ∨ (𝐹‘𝑙) = 0 )))
48		domnprodeq0.b	. . . . . . . . . . 11 ⊢ 𝐵 = (Base‘𝑅)
49	27, 48	mgpbas 20407	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑀)
50		eqid 2763	. . . . . . . . . . 11 ⊢ (.r‘𝑅) = (.r‘𝑅)
51	27, 50	mgpplusg 20406	. . . . . . . . . 10 ⊢ (.r‘𝑅) = (+g‘𝑀)
52	32	idomcringd 21020	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑅 ∈ CRing)
53	27	crngmgp 20509	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ CRing → 𝑀 ∈ CMnd)
54	52, 53	syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ CMnd)
55	54	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → 𝑀 ∈ CMnd)
56		domnprodeq0.2	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ Fin)
57	56	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → 𝐴 ∈ Fin)
58		simplr 781	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → 𝑏 ⊆ 𝐴)
59	57, 58	ssfid 9296	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → 𝑏 ∈ Fin)
60		domnprodeq0.f	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
61	60	ad3antrrr 743	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) ∧ 𝑘 ∈ 𝑏) → 𝐹:𝐴⟶𝐵)
62	58	sselda 3913	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) ∧ 𝑘 ∈ 𝑏) → 𝑘 ∈ 𝐴)
63	61, 62	ffvelcdmd 7115	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) ∧ 𝑘 ∈ 𝑏) → (𝐹‘𝑘) ∈ 𝐵)
64		simpr 490	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → 𝑙 ∈ (𝐴 ∖ 𝑏))
65	64	eldifbd 4055	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → ¬ 𝑙 ∈ 𝑏)
66	60	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → 𝐹:𝐴⟶𝐵)
67	64	eldifad 4054	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → 𝑙 ∈ 𝐴)
68	66, 67	ffvelcdmd 7115	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → (𝐹‘𝑙) ∈ 𝐵)
69		fveq2 6914	. . . . . . . . . 10 ⊢ (𝑘 = 𝑙 → (𝐹‘𝑘) = (𝐹‘𝑙))
70	49, 51, 55, 59, 63, 64, 65, 68, 69	gsumunsn 20216	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → (𝑀 Σg (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))) = ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))(.r‘𝑅)(𝐹‘𝑙)))
71	70	eqeq1d 2765	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → ((𝑀 Σg (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))) = 0 ↔ ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))(.r‘𝑅)(𝐹‘𝑙)) = 0 ))
72	33	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → 𝑅 ∈ Domn)
73	63	ralrimiva 3158	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → ∀𝑘 ∈ 𝑏 (𝐹‘𝑘) ∈ 𝐵)
74	49, 55, 59, 73	gsummptcl 20223	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → (𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) ∈ 𝐵)
75	48, 50, 35	domneq0 21002	. . . . . . . . 9 ⊢ ((𝑅 ∈ Domn ∧ (𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) ∈ 𝐵 ∧ (𝐹‘𝑙) ∈ 𝐵) → (((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))(.r‘𝑅)(𝐹‘𝑙)) = 0 ↔ ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ∨ (𝐹‘𝑙) = 0 )))
76	72, 74, 68, 75	syl3anc 1399	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → (((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))(.r‘𝑅)(𝐹‘𝑙)) = 0 ↔ ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ∨ (𝐹‘𝑙) = 0 )))
77	71, 76	bitrd 282	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → ((𝑀 Σg (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))) = 0 ↔ ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ∨ (𝐹‘𝑙) = 0 )))
78	77	adantr 486	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) ∧ ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))) → ((𝑀 Σg (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))) = 0 ↔ ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ∨ (𝐹‘𝑙) = 0 )))
79		eqid 2763	. . . . . . . . 9 ⊢ (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘)) = (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))
80		fvex 6927	. . . . . . . . 9 ⊢ (𝐹‘𝑘) ∈ V
81	79, 80	elrnmpti 5954	. . . . . . . 8 ⊢ ( 0 ∈ ran (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘)) ↔ ∃𝑘 ∈ (𝑏 ∪ {𝑙}) 0 = (𝐹‘𝑘))
82		rexun 4197	. . . . . . . 8 ⊢ (∃𝑘 ∈ (𝑏 ∪ {𝑙}) 0 = (𝐹‘𝑘) ↔ (∃𝑘 ∈ 𝑏 0 = (𝐹‘𝑘) ∨ ∃𝑘 ∈ {𝑙} 0 = (𝐹‘𝑘)))
83		eqid 2763	. . . . . . . . . . 11 ⊢ (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)) = (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))
84	83, 80	elrnmpti 5954	. . . . . . . . . 10 ⊢ ( 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)) ↔ ∃𝑘 ∈ 𝑏 0 = (𝐹‘𝑘))
85	84	bicomi 227	. . . . . . . . 9 ⊢ (∃𝑘 ∈ 𝑏 0 = (𝐹‘𝑘) ↔ 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))
86		vex 3458	. . . . . . . . . 10 ⊢ 𝑙 ∈ V
87	69	eqeq2d 2774	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑙 → ( 0 = (𝐹‘𝑘) ↔ 0 = (𝐹‘𝑙)))
88		eqcom 2770	. . . . . . . . . . 11 ⊢ ( 0 = (𝐹‘𝑙) ↔ (𝐹‘𝑙) = 0 )
89	87, 88	bitrdi 290	. . . . . . . . . 10 ⊢ (𝑘 = 𝑙 → ( 0 = (𝐹‘𝑘) ↔ (𝐹‘𝑙) = 0 ))
90	86, 89	rexsn 4643	. . . . . . . . 9 ⊢ (∃𝑘 ∈ {𝑙} 0 = (𝐹‘𝑘) ↔ (𝐹‘𝑙) = 0 )
91	85, 90	orbi12i 928	. . . . . . . 8 ⊢ ((∃𝑘 ∈ 𝑏 0 = (𝐹‘𝑘) ∨ ∃𝑘 ∈ {𝑙} 0 = (𝐹‘𝑘)) ↔ ( 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)) ∨ (𝐹‘𝑙) = 0 ))
92	81, 82, 91	3bitri 300	. . . . . . 7 ⊢ ( 0 ∈ ran (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘)) ↔ ( 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)) ∨ (𝐹‘𝑙) = 0 ))
93	92	a1i 11	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) ∧ ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))) → ( 0 ∈ ran (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘)) ↔ ( 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)) ∨ (𝐹‘𝑙) = 0 )))
94	47, 78, 93	3bitr4d 314	. . . . 5 ⊢ ((((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) ∧ ((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘)))) → ((𝑀 Σg (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))))
95	94	ex 418	. . . 4 ⊢ (((𝜑 ∧ 𝑏 ⊆ 𝐴) ∧ 𝑙 ∈ (𝐴 ∖ 𝑏)) → (((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) → ((𝑀 Σg (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘)))))
96	95	anasss 472	. . 3 ⊢ ((𝜑 ∧ (𝑏 ⊆ 𝐴 ∧ 𝑙 ∈ (𝐴 ∖ 𝑏))) → (((𝑀 Σg (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝑏 ↦ (𝐹‘𝑘))) → ((𝑀 Σg (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ (𝑏 ∪ {𝑙}) ↦ (𝐹‘𝑘)))))
97	8, 14, 20, 26, 45, 96, 56	findcard2d 9218	. 2 ⊢ (𝜑 → ((𝑀 Σg (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) = 0 ↔ 0 ∈ ran (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))))
98	60	feqmptd 6982	. . . 4 ⊢ (𝜑 → 𝐹 = (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)))
99	98	oveq2d 7465	. . 3 ⊢ (𝜑 → (𝑀 Σg 𝐹) = (𝑀 Σg (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))))
100	99	eqeq1d 2765	. 2 ⊢ (𝜑 → ((𝑀 Σg 𝐹) = 0 ↔ (𝑀 Σg (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))) = 0 ))
101	98	rneqd 5930	. . 3 ⊢ (𝜑 → ran 𝐹 = ran (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘)))
102	101	eleq2d 2850	. 2 ⊢ (𝜑 → ( 0 ∈ ran 𝐹 ↔ 0 ∈ ran (𝑘 ∈ 𝐴 ↦ (𝐹‘𝑘))))
103	97, 100, 102	3bitr4d 314	1 ⊢ (𝜑 → ((𝑀 Σg 𝐹) = 0 ↔ 0 ∈ ran 𝐹))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∃wrex 3090   ⊆ wss 3900   ∖ cdif 4048   ∪ cun 4152  ∅c0 4281  {csn 4588   ↦ cmpt 5190  ran crn 5657  ⟶wf 6560  ‘cfv 6564  (class class class)co 7449  Fincfn 9009  Basecbs 17428  ._rcmulr 17470  0_gc0g 17651   Σ_g cgsu 17652  CMndccmn 20036  mulGrpcmgp 20402  1_rcur 20449  CRingccrg 20502  NzRingcnzr 20804  Domncdomn 20986  IDomncidom 20987

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781  ax-cnex 11293  ax-resscn 11294  ax-1cn 11295  ax-icn 11296  ax-addcl 11297  ax-addrcl 11298  ax-mulcl 11299  ax-mulrcl 11300  ax-mulcom 11301  ax-addass 11302  ax-mulass 11303  ax-distr 11304  ax-i2m1 11305  ax-1ne0 11306  ax-1rid 11307  ax-rnegex 11308  ax-rrecex 11309  ax-cnre 11310  ax-pre-lttri 11311  ax-pre-lttrn 11312  ax-pre-ltadd 11313  ax-pre-mulgt0 11314

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-se 5610  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6328  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-isom 6573  df-riota 7406  df-ov 7452  df-oprab 7453  df-mpo 7454  df-of 7723  df-om 7910  df-1st 8033  df-2nd 8034  df-supp 8213  df-frecs 8335  df-wrecs 8366  df-recs 8415  df-rdg 8454  df-1o 8512  df-2o 8513  df-er 8753  df-en 9010  df-dom 9011  df-sdom 9012  df-fin 9013  df-fsupp 9390  df-oi 9539  df-card 10055  df-pnf 11382  df-mnf 11383  df-xr 11384  df-ltxr 11385  df-le 11386  df-sub 11580  df-neg 11581  df-nn 12374  df-2 12443  df-n0 12645  df-z 12732  df-uz 13004  df-fz 13678  df-fzo 13827  df-seq 14183  df-hash 14514  df-sets 17383  df-slot 17401  df-ndx 17413  df-base 17429  df-ress 17450  df-plusg 17482  df-0g 17653  df-gsum 17654  df-mre 17797  df-mrc 17798  df-acs 17800  df-mgm 18857  df-sgrp 18949  df-mnd 18965  df-submnd 19020  df-grp 19188  df-minusg 19189  df-mulg 19319  df-cntz 19573  df-cmn 20038  df-abl 20039  df-mgp 20403  df-rng 20417  df-ur 20450  df-ring 20503  df-cring 20504  df-nzr 20805  df-domn 20989  df-idom 20990

This theorem is used by:  deg1prod  34211