Theorem dprdfeq0 19540

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 2738	. . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺)
6	1, 2, 3, 4, 5	dprdff 19530	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐼⟶(Base‘𝐺))
7	6	feqmptd 6819	. . . . 5 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)))
8	7	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → 𝐹 = (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)))
9	1, 2, 3, 4	dprdfcl 19531	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (𝑆‘𝑥))
10	9	adantlr 711	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (𝑆‘𝑥))
11		eldprdi.0	. . . . . . . . . . . 12 ⊢ 0 = (0g‘𝐺)
12	2	ad2antrr 722	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺dom DProd 𝑆)
13	3	ad2antrr 722	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → dom 𝑆 = 𝐼)
14		simpr 484	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝐼)
15		eqid 2738	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))
16	11, 1, 12, 13, 14, 10, 15	dprdfid 19535	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∈ 𝑊 ∧ (𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))) = (𝐹‘𝑥)))
17	16	simpld 494	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∈ 𝑊)
18	4	ad2antrr 722	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹 ∈ 𝑊)
19		eqid 2738	. . . . . . . . . . . 12 ⊢ (-g‘𝐺) = (-g‘𝐺)
20	11, 1, 12, 13, 17, 18, 19	dprdfsub 19539	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹) ∈ 𝑊 ∧ (𝐺 Σg ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹)) = ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹))))
21	20	simprd 495	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹)) = ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹)))
22	2, 3	dprddomcld 19519	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐼 ∈ V)
23	22	ad2antrr 722	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐼 ∈ V)
24		fvex 6769	. . . . . . . . . . . . . 14 ⊢ (𝐹‘𝑥) ∈ V
25	11	fvexi 6770	. . . . . . . . . . . . . 14 ⊢ 0 ∈ V
26	24, 25	ifex 4506	. . . . . . . . . . . . 13 ⊢ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) ∈ V
27	26	a1i 11	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) ∈ V)
28		fvexd 6771	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ V)
29		eqidd 2739	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))
30	6	ad2antrr 722	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹:𝐼⟶(Base‘𝐺))
31	30	feqmptd 6819	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹 = (𝑦 ∈ 𝐼 ↦ (𝐹‘𝑦)))
32	23, 27, 28, 29, 31	offval2 7531	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹) = (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))))
33	32	oveq2d 7271	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹)) = (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))))
34	16	simprd 495	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))) = (𝐹‘𝑥))
35		simplr 765	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg 𝐹) = 0 )
36	34, 35	oveq12d 7273	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹)) = ((𝐹‘𝑥)(-g‘𝐺) 0 ))
37		dprdgrp 19523	. . . . . . . . . . . . 13 ⊢ (𝐺dom DProd 𝑆 → 𝐺 ∈ Grp)
38	12, 37	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ Grp)
39	30, 14	ffvelrnd 6944	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (Base‘𝐺))
40	5, 11, 19	grpsubid1 18575	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ (𝐹‘𝑥) ∈ (Base‘𝐺)) → ((𝐹‘𝑥)(-g‘𝐺) 0 ) = (𝐹‘𝑥))
41	38, 39, 40	syl2anc 583	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺) 0 ) = (𝐹‘𝑥))
42	36, 41	eqtrd 2778	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹)) = (𝐹‘𝑥))
43	21, 33, 42	3eqtr3d 2786	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))) = (𝐹‘𝑥))
44		eqid 2738	. . . . . . . . . 10 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺)
45		grpmnd 18499	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
46	2, 37, 45	3syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 ∈ Mnd)
47	46	ad2antrr 722	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ Mnd)
48	5	subgacs 18704	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)))
49		acsmre 17278	. . . . . . . . . . . . 13 ⊢ ((SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
50	38, 48, 49	3syl 18	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
51		imassrn 5969	. . . . . . . . . . . . . 14 ⊢ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ran 𝑆
52	2, 3	dprdf2 19525	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑆:𝐼⟶(SubGrp‘𝐺))
53	52	ad2antrr 722	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑆:𝐼⟶(SubGrp‘𝐺))
54	53	frnd 6592	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran 𝑆 ⊆ (SubGrp‘𝐺))
55		mresspw 17218	. . . . . . . . . . . . . . . 16 ⊢ ((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
56	50, 55	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
57	54, 56	sstrd 3927	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran 𝑆 ⊆ 𝒫 (Base‘𝐺))
58	51, 57	sstrid 3928	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ 𝒫 (Base‘𝐺))
59		sspwuni 5025	. . . . . . . . . . . . 13 ⊢ ((𝑆 “ (𝐼 ∖ {𝑥})) ⊆ 𝒫 (Base‘𝐺) ↔ ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺))
60	58, 59	sylib 217	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺))
61		eqid 2738	. . . . . . . . . . . . 13 ⊢ (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
62	61	mrccl 17237	. . . . . . . . . . . 12 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
63	50, 60, 62	syl2anc 583	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
64		subgsubm 18692	. . . . . . . . . . 11 ⊢ (((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubMnd‘𝐺))
65	63, 64	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubMnd‘𝐺))
66		oveq1 7262	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑥) = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) = (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))
67	66	eleq1d 2823	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑥) = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → (((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ↔ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
68		oveq1 7262	. . . . . . . . . . . . 13 ⊢ ( 0 = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → ( 0 (-g‘𝐺)(𝐹‘𝑦)) = (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))
69	68	eleq1d 2823	. . . . . . . . . . . 12 ⊢ ( 0 = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → (( 0 (-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ↔ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
70		simpr 484	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → 𝑦 = 𝑥)
71	70	fveq2d 6760	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → (𝐹‘𝑦) = (𝐹‘𝑥))
72	71	oveq2d 7271	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) = ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)))
73	5, 11, 19	grpsubid 18574	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ Grp ∧ (𝐹‘𝑥) ∈ (Base‘𝐺)) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) = 0 )
74	38, 39, 73	syl2anc 583	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) = 0 )
75	11	subg0cl 18678	. . . . . . . . . . . . . . . 16 ⊢ (((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
76	63, 75	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
77	74, 76	eqeltrd 2839	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
78	77	ad2antrr 722	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
79	72, 78	eqeltrd 2839	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
80	63	ad2antrr 722	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
81	80, 75	syl 17	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
82	50, 61, 60	mrcssidd 17251	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
83	82	ad2antrr 722	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
84	1, 12, 13, 18	dprdfcl 19531	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
85	84	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
86	53	ffnd 6585	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑆 Fn 𝐼)
87	86	ad2antrr 722	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 𝑆 Fn 𝐼)
88		difssd 4063	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐼 ∖ {𝑥}) ⊆ 𝐼)
89		df-ne 2943	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ≠ 𝑥 ↔ ¬ 𝑦 = 𝑥)
90		eldifsn 4717	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ (𝐼 ∖ {𝑥}) ↔ (𝑦 ∈ 𝐼 ∧ 𝑦 ≠ 𝑥))
91	90	biimpri 227	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ 𝐼 ∧ 𝑦 ≠ 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
92	89, 91	sylan2br 594	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑦 ∈ 𝐼 ∧ ¬ 𝑦 = 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
93	92	adantll 710	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
94		fnfvima 7091	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 Fn 𝐼 ∧ (𝐼 ∖ {𝑥}) ⊆ 𝐼 ∧ 𝑦 ∈ (𝐼 ∖ {𝑥})) → (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥})))
95	87, 88, 93, 94	syl3anc 1369	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥})))
96		elunii 4841	. . . . . . . . . . . . . . 15 ⊢ (((𝐹‘𝑦) ∈ (𝑆‘𝑦) ∧ (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥}))) → (𝐹‘𝑦) ∈ ∪ (𝑆 “ (𝐼 ∖ {𝑥})))
97	85, 95, 96	syl2anc 583	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ ∪ (𝑆 “ (𝐼 ∖ {𝑥})))
98	83, 97	sseldd 3918	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
99	19	subgsubcl 18681	. . . . . . . . . . . . 13 ⊢ ((((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) ∧ 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∧ (𝐹‘𝑦) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) → ( 0 (-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
100	80, 81, 98, 99	syl3anc 1369	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → ( 0 (-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
101	67, 69, 79, 100	ifbothda 4494	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
102	101	fmpttd 6971	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))):𝐼⟶((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
103	20	simpld 494	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹) ∈ 𝑊)
104	32, 103	eqeltrrd 2840	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) ∈ 𝑊)
105	1, 12, 13, 104, 44	dprdfcntz 19533	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) ⊆ ((Cntz‘𝐺)‘ran (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))))
106	1, 12, 13, 104	dprdffsupp 19532	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) finSupp 0 )
107	11, 44, 47, 23, 65, 102, 105, 106	gsumzsubmcl 19434	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
108	43, 107	eqeltrrd 2840	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
109	10, 108	elind 4124	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
110	12, 13, 14, 11, 61	dprddisj 19527	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 })
111	109, 110	eleqtrd 2841	. . . . . 6 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ { 0 })
112		elsni 4575	. . . . . 6 ⊢ ((𝐹‘𝑥) ∈ { 0 } → (𝐹‘𝑥) = 0 )
113	111, 112	syl 17	. . . . 5 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) = 0 )
114	113	mpteq2dva 5170	. . . 4 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐼 ↦ 0 ))
115	8, 114	eqtrd 2778	. . 3 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ))
116	115	ex 412	. 2 ⊢ (𝜑 → ((𝐺 Σg 𝐹) = 0 → 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 )))
117	11	gsumz 18389	. . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝐼 ∈ V) → (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )) = 0 )
118	46, 22, 117	syl2anc 583	. . 3 ⊢ (𝜑 → (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )) = 0 )
119		oveq2 7263	. . . 4 ⊢ (𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ) → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )))
120	119	eqeq1d 2740	. . 3 ⊢ (𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ) → ((𝐺 Σg 𝐹) = 0 ↔ (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )) = 0 ))
121	118, 120	syl5ibrcom 246	. 2 ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ) → (𝐺 Σg 𝐹) = 0 ))
122	116, 121	impbid 211	1 ⊢ (𝜑 → ((𝐺 Σg 𝐹) = 0 ↔ 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 )))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  {crab 3067  Vcvv 3422   ∖ cdif 3880   ∩ cin 3882   ⊆ wss 3883  ifcif 4456  𝒫 cpw 4530  {csn 4558  ∪ cuni 4836   class class class wbr 5070   ↦ cmpt 5153  dom cdm 5580  ran crn 5581   “ cima 5583   Fn wfn 6413  ⟶wf 6414  ‘cfv 6418  (class class class)co 7255   ∘_f cof 7509  Xcixp 8643   finSupp cfsupp 9058  Basecbs 16840  0_gc0g 17067   Σ_g cgsu 17068  Moorecmre 17208  mrClscmrc 17209  ACScacs 17211  Mndcmnd 18300  SubMndcsubmnd 18344  Grpcgrp 18492  -_gcsg 18494  SubGrpcsubg 18664  Cntzccntz 18836   DProd cdprd 19511

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-iin 4924  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-se 5536  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-isom 6427  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-of 7511  df-om 7688  df-1st 7804  df-2nd 7805  df-supp 7949  df-tpos 8013  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-1o 8267  df-er 8456  df-map 8575  df-ixp 8644  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-fsupp 9059  df-oi 9199  df-card 9628  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-2 11966  df-n0 12164  df-z 12250  df-uz 12512  df-fz 13169  df-fzo 13312  df-seq 13650  df-hash 13973  df-sets 16793  df-slot 16811  df-ndx 16823  df-base 16841  df-ress 16868  df-plusg 16901  df-0g 17069  df-gsum 17070  df-mre 17212  df-mrc 17213  df-acs 17215  df-mgm 18241  df-sgrp 18290  df-mnd 18301  df-mhm 18345  df-submnd 18346  df-grp 18495  df-minusg 18496  df-sbg 18497  df-mulg 18616  df-subg 18667  df-ghm 18747  df-gim 18790  df-cntz 18838  df-oppg 18865  df-cmn 19303  df-dprd 19513

This theorem is referenced by:  dprdf11  19541