Theorem dprdfeq0 18734

Description: The zero function is the only function that sums to zero in a direct product. (Contributed by Mario Carneiro, 25-Apr-2016.) (Revised by AV, 14-Jul-2019.)

Hypotheses

Ref	Expression
eldprdi.0	⊢ 0 = (0g‘𝐺)
eldprdi.w	⊢ 𝑊 = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 }
eldprdi.1	⊢ (𝜑 → 𝐺dom DProd 𝑆)
eldprdi.2	⊢ (𝜑 → dom 𝑆 = 𝐼)
eldprdi.3	⊢ (𝜑 → 𝐹 ∈ 𝑊)

Assertion

Ref	Expression
dprdfeq0	⊢ (𝜑 → ((𝐺 Σg 𝐹) = 0 ↔ 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 )))

Distinct variable groups:   𝑥,ℎ,𝐹   ℎ,𝑖,𝐺,𝑥   ℎ,𝐼,𝑖,𝑥   𝜑,𝑥   0 ,ℎ,𝑥   𝑆,ℎ,𝑖,𝑥

Allowed substitution hints:   𝜑(ℎ,𝑖)   𝐹(𝑖)   𝑊(𝑥,ℎ,𝑖)   0 (𝑖)

Proof of Theorem dprdfeq0

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldprdi.w	. . . . . . 7 ⊢ 𝑊 = {ℎ ∈ X𝑖 ∈ 𝐼 (𝑆‘𝑖) ∣ ℎ finSupp 0 }
2		eldprdi.1	. . . . . . 7 ⊢ (𝜑 → 𝐺dom DProd 𝑆)
3		eldprdi.2	. . . . . . 7 ⊢ (𝜑 → dom 𝑆 = 𝐼)
4		eldprdi.3	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ 𝑊)
5		eqid 2797	. . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺)
6	1, 2, 3, 4, 5	dprdff 18724	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐼⟶(Base‘𝐺))
7	6	feqmptd 6472	. . . . 5 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)))
8	7	adantr 473	. . . 4 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → 𝐹 = (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)))
9	1, 2, 3, 4	dprdfcl 18725	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (𝑆‘𝑥))
10	9	adantlr 707	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (𝑆‘𝑥))
11		eldprdi.0	. . . . . . . . . . . 12 ⊢ 0 = (0g‘𝐺)
12	2	ad2antrr 718	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺dom DProd 𝑆)
13	3	ad2antrr 718	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → dom 𝑆 = 𝐼)
14		simpr 478	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝐼)
15		eqid 2797	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))
16	11, 1, 12, 13, 14, 10, 15	dprdfid 18729	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∈ 𝑊 ∧ (𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))) = (𝐹‘𝑥)))
17	16	simpld 489	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∈ 𝑊)
18	4	ad2antrr 718	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹 ∈ 𝑊)
19		eqid 2797	. . . . . . . . . . . 12 ⊢ (-g‘𝐺) = (-g‘𝐺)
20	11, 1, 12, 13, 17, 18, 19	dprdfsub 18733	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘𝑓 (-g‘𝐺)𝐹) ∈ 𝑊 ∧ (𝐺 Σg ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘𝑓 (-g‘𝐺)𝐹)) = ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹))))
21	20	simprd 490	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘𝑓 (-g‘𝐺)𝐹)) = ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹)))
22	2, 3	dprddomcld 18713	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐼 ∈ V)
23	22	ad2antrr 718	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐼 ∈ V)
24		fvex 6422	. . . . . . . . . . . . . 14 ⊢ (𝐹‘𝑥) ∈ V
25	11	fvexi 6423	. . . . . . . . . . . . . 14 ⊢ 0 ∈ V
26	24, 25	ifex 4323	. . . . . . . . . . . . 13 ⊢ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) ∈ V
27	26	a1i 11	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) ∈ V)
28		fvexd 6424	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ V)
29		eqidd 2798	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))
30	6	ad2antrr 718	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹:𝐼⟶(Base‘𝐺))
31	30	feqmptd 6472	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹 = (𝑦 ∈ 𝐼 ↦ (𝐹‘𝑦)))
32	23, 27, 28, 29, 31	offval2 7146	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘𝑓 (-g‘𝐺)𝐹) = (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))))
33	32	oveq2d 6892	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘𝑓 (-g‘𝐺)𝐹)) = (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))))
34	16	simprd 490	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))) = (𝐹‘𝑥))
35		simplr 786	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg 𝐹) = 0 )
36	34, 35	oveq12d 6894	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹)) = ((𝐹‘𝑥)(-g‘𝐺) 0 ))
37		dprdgrp 18717	. . . . . . . . . . . . 13 ⊢ (𝐺dom DProd 𝑆 → 𝐺 ∈ Grp)
38	12, 37	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ Grp)
39	30, 14	ffvelrnd 6584	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (Base‘𝐺))
40	5, 11, 19	grpsubid1 17813	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ (𝐹‘𝑥) ∈ (Base‘𝐺)) → ((𝐹‘𝑥)(-g‘𝐺) 0 ) = (𝐹‘𝑥))
41	38, 39, 40	syl2anc 580	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺) 0 ) = (𝐹‘𝑥))
42	36, 41	eqtrd 2831	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹)) = (𝐹‘𝑥))
43	21, 33, 42	3eqtr3d 2839	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))) = (𝐹‘𝑥))
44		eqid 2797	. . . . . . . . . 10 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺)
45		grpmnd 17742	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
46	2, 37, 45	3syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 ∈ Mnd)
47	46	ad2antrr 718	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ Mnd)
48	5	subgacs 17939	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)))
49		acsmre 16624	. . . . . . . . . . . . 13 ⊢ ((SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
50	38, 48, 49	3syl 18	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
51		imassrn 5692	. . . . . . . . . . . . . 14 ⊢ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ran 𝑆
52	2, 3	dprdf2 18719	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑆:𝐼⟶(SubGrp‘𝐺))
53	52	ad2antrr 718	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑆:𝐼⟶(SubGrp‘𝐺))
54	53	frnd 6261	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran 𝑆 ⊆ (SubGrp‘𝐺))
55		mresspw 16564	. . . . . . . . . . . . . . . 16 ⊢ ((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
56	50, 55	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
57	54, 56	sstrd 3806	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran 𝑆 ⊆ 𝒫 (Base‘𝐺))
58	51, 57	syl5ss 3807	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ 𝒫 (Base‘𝐺))
59		sspwuni 4800	. . . . . . . . . . . . 13 ⊢ ((𝑆 “ (𝐼 ∖ {𝑥})) ⊆ 𝒫 (Base‘𝐺) ↔ ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺))
60	58, 59	sylib 210	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺))
61		eqid 2797	. . . . . . . . . . . . 13 ⊢ (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
62	61	mrccl 16583	. . . . . . . . . . . 12 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
63	50, 60, 62	syl2anc 580	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
64		subgsubm 17926	. . . . . . . . . . 11 ⊢ (((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubMnd‘𝐺))
65	63, 64	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubMnd‘𝐺))
66		oveq1 6883	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑥) = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) = (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))
67	66	eleq1d 2861	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑥) = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → (((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ↔ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
68		oveq1 6883	. . . . . . . . . . . . 13 ⊢ ( 0 = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → ( 0 (-g‘𝐺)(𝐹‘𝑦)) = (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))
69	68	eleq1d 2861	. . . . . . . . . . . 12 ⊢ ( 0 = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → (( 0 (-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ↔ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
70		simpr 478	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → 𝑦 = 𝑥)
71	70	fveq2d 6413	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → (𝐹‘𝑦) = (𝐹‘𝑥))
72	71	oveq2d 6892	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) = ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)))
73	5, 11, 19	grpsubid 17812	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ Grp ∧ (𝐹‘𝑥) ∈ (Base‘𝐺)) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) = 0 )
74	38, 39, 73	syl2anc 580	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) = 0 )
75	11	subg0cl 17912	. . . . . . . . . . . . . . . 16 ⊢ (((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
76	63, 75	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
77	74, 76	eqeltrd 2876	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
78	77	ad2antrr 718	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
79	72, 78	eqeltrd 2876	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
80	63	ad2antrr 718	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
81	80, 75	syl 17	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
82	50, 61, 60	mrcssidd 16597	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
83	82	ad2antrr 718	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
84	1, 12, 13, 18	dprdfcl 18725	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
85	84	adantr 473	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
86	53	ffnd 6255	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑆 Fn 𝐼)
87	86	ad2antrr 718	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 𝑆 Fn 𝐼)
88		difssd 3934	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐼 ∖ {𝑥}) ⊆ 𝐼)
89		df-ne 2970	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ≠ 𝑥 ↔ ¬ 𝑦 = 𝑥)
90		eldifsn 4504	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ (𝐼 ∖ {𝑥}) ↔ (𝑦 ∈ 𝐼 ∧ 𝑦 ≠ 𝑥))
91	90	biimpri 220	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ 𝐼 ∧ 𝑦 ≠ 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
92	89, 91	sylan2br 589	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑦 ∈ 𝐼 ∧ ¬ 𝑦 = 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
93	92	adantll 706	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
94		fnfvima 6723	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 Fn 𝐼 ∧ (𝐼 ∖ {𝑥}) ⊆ 𝐼 ∧ 𝑦 ∈ (𝐼 ∖ {𝑥})) → (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥})))
95	87, 88, 93, 94	syl3anc 1491	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥})))
96		elunii 4631	. . . . . . . . . . . . . . 15 ⊢ (((𝐹‘𝑦) ∈ (𝑆‘𝑦) ∧ (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥}))) → (𝐹‘𝑦) ∈ ∪ (𝑆 “ (𝐼 ∖ {𝑥})))
97	85, 95, 96	syl2anc 580	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ ∪ (𝑆 “ (𝐼 ∖ {𝑥})))
98	83, 97	sseldd 3797	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
99	19	subgsubcl 17915	. . . . . . . . . . . . 13 ⊢ ((((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) ∧ 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∧ (𝐹‘𝑦) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) → ( 0 (-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
100	80, 81, 98, 99	syl3anc 1491	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → ( 0 (-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
101	67, 69, 79, 100	ifbothda 4312	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
102	101	fmpttd 6609	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))):𝐼⟶((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
103	20	simpld 489	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘𝑓 (-g‘𝐺)𝐹) ∈ 𝑊)
104	32, 103	eqeltrrd 2877	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) ∈ 𝑊)
105	1, 12, 13, 104, 44	dprdfcntz 18727	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) ⊆ ((Cntz‘𝐺)‘ran (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))))
106	1, 12, 13, 104	dprdffsupp 18726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) finSupp 0 )
107	11, 44, 47, 23, 65, 102, 105, 106	gsumzsubmcl 18630	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
108	43, 107	eqeltrrd 2877	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
109	10, 108	elind 3994	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
110	12, 13, 14, 11, 61	dprddisj 18721	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 })
111	109, 110	eleqtrd 2878	. . . . . 6 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ { 0 })
112		elsni 4383	. . . . . 6 ⊢ ((𝐹‘𝑥) ∈ { 0 } → (𝐹‘𝑥) = 0 )
113	111, 112	syl 17	. . . . 5 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) = 0 )
114	113	mpteq2dva 4935	. . . 4 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐼 ↦ 0 ))
115	8, 114	eqtrd 2831	. . 3 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ))
116	115	ex 402	. 2 ⊢ (𝜑 → ((𝐺 Σg 𝐹) = 0 → 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 )))
117	11	gsumz 17686	. . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝐼 ∈ V) → (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )) = 0 )
118	46, 22, 117	syl2anc 580	. . 3 ⊢ (𝜑 → (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )) = 0 )
119		oveq2 6884	. . . 4 ⊢ (𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ) → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )))
120	119	eqeq1d 2799	. . 3 ⊢ (𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ) → ((𝐺 Σg 𝐹) = 0 ↔ (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )) = 0 ))
121	118, 120	syl5ibrcom 239	. 2 ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ) → (𝐺 Σg 𝐹) = 0 ))
122	116, 121	impbid 204	1 ⊢ (𝜑 → ((𝐺 Σg 𝐹) = 0 ↔ 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 )))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 198   ∧ wa 385   = wceq 1653   ∈ wcel 2157   ≠ wne 2969  {crab 3091  Vcvv 3383   ∖ cdif 3764   ∩ cin 3766   ⊆ wss 3767  ifcif 4275  𝒫 cpw 4347  {csn 4366  ∪ cuni 4626   class class class wbr 4841   ↦ cmpt 4920  dom cdm 5310  ran crn 5311   “ cima 5313   Fn wfn 6094  ⟶wf 6095  ‘cfv 6099  (class class class)co 6876   ∘_𝑓 cof 7127  Xcixp 8146   finSupp cfsupp 8515  Basecbs 16181  0_gc0g 16412   Σ_g cgsu 16413  Moorecmre 16554  mrClscmrc 16555  ACScacs 16557  Mndcmnd 17606  SubMndcsubmnd 17646  Grpcgrp 17735  -_gcsg 17737  SubGrpcsubg 17898  Cntzccntz 18057   DProd cdprd 18705

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-8 2159  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2354  ax-ext 2775  ax-rep 4962  ax-sep 4973  ax-nul 4981  ax-pow 5033  ax-pr 5095  ax-un 7181  ax-inf2 8786  ax-cnex 10278  ax-resscn 10279  ax-1cn 10280  ax-icn 10281  ax-addcl 10282  ax-addrcl 10283  ax-mulcl 10284  ax-mulrcl 10285  ax-mulcom 10286  ax-addass 10287  ax-mulass 10288  ax-distr 10289  ax-i2m1 10290  ax-1ne0 10291  ax-1rid 10292  ax-rnegex 10293  ax-rrecex 10294  ax-cnre 10295  ax-pre-lttri 10296  ax-pre-lttrn 10297  ax-pre-ltadd 10298  ax-pre-mulgt0 10299

This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3or 1109  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-mo 2590  df-eu 2607  df-clab 2784  df-cleq 2790  df-clel 2793  df-nfc 2928  df-ne 2970  df-nel 3073  df-ral 3092  df-rex 3093  df-reu 3094  df-rmo 3095  df-rab 3096  df-v 3385  df-sbc 3632  df-csb 3727  df-dif 3770  df-un 3772  df-in 3774  df-ss 3781  df-pss 3783  df-nul 4114  df-if 4276  df-pw 4349  df-sn 4367  df-pr 4369  df-tp 4371  df-op 4373  df-uni 4627  df-int 4666  df-iun 4710  df-iin 4711  df-br 4842  df-opab 4904  df-mpt 4921  df-tr 4944  df-id 5218  df-eprel 5223  df-po 5231  df-so 5232  df-fr 5269  df-se 5270  df-we 5271  df-xp 5316  df-rel 5317  df-cnv 5318  df-co 5319  df-dm 5320  df-rn 5321  df-res 5322  df-ima 5323  df-pred 5896  df-ord 5942  df-on 5943  df-lim 5944  df-suc 5945  df-iota 6062  df-fun 6101  df-fn 6102  df-f 6103  df-f1 6104  df-fo 6105  df-f1o 6106  df-fv 6107  df-isom 6108  df-riota 6837  df-ov 6879  df-oprab 6880  df-mpt2 6881  df-of 7129  df-om 7298  df-1st 7399  df-2nd 7400  df-supp 7531  df-tpos 7588  df-wrecs 7643  df-recs 7705  df-rdg 7743  df-1o 7797  df-oadd 7801  df-er 7980  df-map 8095  df-ixp 8147  df-en 8194  df-dom 8195  df-sdom 8196  df-fin 8197  df-fsupp 8516  df-oi 8655  df-card 9049  df-pnf 10363  df-mnf 10364  df-xr 10365  df-ltxr 10366  df-le 10367  df-sub 10556  df-neg 10557  df-nn 11311  df-2 11372  df-n0 11577  df-z 11663  df-uz 11927  df-fz 12577  df-fzo 12717  df-seq 13052  df-hash 13367  df-ndx 16184  df-slot 16185  df-base 16187  df-sets 16188  df-ress 16189  df-plusg 16277  df-0g 16414  df-gsum 16415  df-mre 16558  df-mrc 16559  df-acs 16561  df-mgm 17554  df-sgrp 17596  df-mnd 17607  df-mhm 17647  df-submnd 17648  df-grp 17738  df-minusg 17739  df-sbg 17740  df-mulg 17854  df-subg 17901  df-ghm 17968  df-gim 18011  df-cntz 18059  df-oppg 18085  df-cmn 18507  df-dprd 18707

This theorem is referenced by:  dprdf11  18735