Theorem dprdfeq0 19146

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 2823	. . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺)
6	1, 2, 3, 4, 5	dprdff 19136	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐼⟶(Base‘𝐺))
7	6	feqmptd 6735	. . . . 5 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)))
8	7	adantr 483	. . . 4 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → 𝐹 = (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)))
9	1, 2, 3, 4	dprdfcl 19137	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (𝑆‘𝑥))
10	9	adantlr 713	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (𝑆‘𝑥))
11		eldprdi.0	. . . . . . . . . . . 12 ⊢ 0 = (0g‘𝐺)
12	2	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺dom DProd 𝑆)
13	3	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → dom 𝑆 = 𝐼)
14		simpr 487	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝐼)
15		eqid 2823	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))
16	11, 1, 12, 13, 14, 10, 15	dprdfid 19141	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∈ 𝑊 ∧ (𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))) = (𝐹‘𝑥)))
17	16	simpld 497	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∈ 𝑊)
18	4	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹 ∈ 𝑊)
19		eqid 2823	. . . . . . . . . . . 12 ⊢ (-g‘𝐺) = (-g‘𝐺)
20	11, 1, 12, 13, 17, 18, 19	dprdfsub 19145	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹) ∈ 𝑊 ∧ (𝐺 Σg ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹)) = ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹))))
21	20	simprd 498	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹)) = ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹)))
22	2, 3	dprddomcld 19125	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐼 ∈ V)
23	22	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐼 ∈ V)
24		fvex 6685	. . . . . . . . . . . . . 14 ⊢ (𝐹‘𝑥) ∈ V
25	11	fvexi 6686	. . . . . . . . . . . . . 14 ⊢ 0 ∈ V
26	24, 25	ifex 4517	. . . . . . . . . . . . 13 ⊢ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) ∈ V
27	26	a1i 11	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) ∈ V)
28		fvexd 6687	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ V)
29		eqidd 2824	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))
30	6	ad2antrr 724	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹:𝐼⟶(Base‘𝐺))
31	30	feqmptd 6735	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹 = (𝑦 ∈ 𝐼 ↦ (𝐹‘𝑦)))
32	23, 27, 28, 29, 31	offval2 7428	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹) = (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))))
33	32	oveq2d 7174	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹)) = (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))))
34	16	simprd 498	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))) = (𝐹‘𝑥))
35		simplr 767	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg 𝐹) = 0 )
36	34, 35	oveq12d 7176	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹)) = ((𝐹‘𝑥)(-g‘𝐺) 0 ))
37		dprdgrp 19129	. . . . . . . . . . . . 13 ⊢ (𝐺dom DProd 𝑆 → 𝐺 ∈ Grp)
38	12, 37	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ Grp)
39	30, 14	ffvelrnd 6854	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (Base‘𝐺))
40	5, 11, 19	grpsubid1 18186	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ (𝐹‘𝑥) ∈ (Base‘𝐺)) → ((𝐹‘𝑥)(-g‘𝐺) 0 ) = (𝐹‘𝑥))
41	38, 39, 40	syl2anc 586	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺) 0 ) = (𝐹‘𝑥))
42	36, 41	eqtrd 2858	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹)) = (𝐹‘𝑥))
43	21, 33, 42	3eqtr3d 2866	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))) = (𝐹‘𝑥))
44		eqid 2823	. . . . . . . . . 10 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺)
45		grpmnd 18112	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
46	2, 37, 45	3syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 ∈ Mnd)
47	46	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ Mnd)
48	5	subgacs 18315	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)))
49		acsmre 16925	. . . . . . . . . . . . 13 ⊢ ((SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
50	38, 48, 49	3syl 18	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
51		imassrn 5942	. . . . . . . . . . . . . 14 ⊢ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ran 𝑆
52	2, 3	dprdf2 19131	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑆:𝐼⟶(SubGrp‘𝐺))
53	52	ad2antrr 724	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑆:𝐼⟶(SubGrp‘𝐺))
54	53	frnd 6523	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran 𝑆 ⊆ (SubGrp‘𝐺))
55		mresspw 16865	. . . . . . . . . . . . . . . 16 ⊢ ((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
56	50, 55	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
57	54, 56	sstrd 3979	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran 𝑆 ⊆ 𝒫 (Base‘𝐺))
58	51, 57	sstrid 3980	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ 𝒫 (Base‘𝐺))
59		sspwuni 5024	. . . . . . . . . . . . 13 ⊢ ((𝑆 “ (𝐼 ∖ {𝑥})) ⊆ 𝒫 (Base‘𝐺) ↔ ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺))
60	58, 59	sylib 220	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺))
61		eqid 2823	. . . . . . . . . . . . 13 ⊢ (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
62	61	mrccl 16884	. . . . . . . . . . . 12 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
63	50, 60, 62	syl2anc 586	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
64		subgsubm 18303	. . . . . . . . . . 11 ⊢ (((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubMnd‘𝐺))
65	63, 64	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubMnd‘𝐺))
66		oveq1 7165	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑥) = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) = (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))
67	66	eleq1d 2899	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑥) = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → (((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ↔ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
68		oveq1 7165	. . . . . . . . . . . . 13 ⊢ ( 0 = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → ( 0 (-g‘𝐺)(𝐹‘𝑦)) = (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))
69	68	eleq1d 2899	. . . . . . . . . . . 12 ⊢ ( 0 = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → (( 0 (-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ↔ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
70		simpr 487	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → 𝑦 = 𝑥)
71	70	fveq2d 6676	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → (𝐹‘𝑦) = (𝐹‘𝑥))
72	71	oveq2d 7174	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) = ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)))
73	5, 11, 19	grpsubid 18185	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ Grp ∧ (𝐹‘𝑥) ∈ (Base‘𝐺)) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) = 0 )
74	38, 39, 73	syl2anc 586	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) = 0 )
75	11	subg0cl 18289	. . . . . . . . . . . . . . . 16 ⊢ (((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
76	63, 75	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
77	74, 76	eqeltrd 2915	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
78	77	ad2antrr 724	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
79	72, 78	eqeltrd 2915	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
80	63	ad2antrr 724	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
81	80, 75	syl 17	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
82	50, 61, 60	mrcssidd 16898	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
83	82	ad2antrr 724	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
84	1, 12, 13, 18	dprdfcl 19137	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
85	84	adantr 483	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
86	53	ffnd 6517	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑆 Fn 𝐼)
87	86	ad2antrr 724	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 𝑆 Fn 𝐼)
88		difssd 4111	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐼 ∖ {𝑥}) ⊆ 𝐼)
89		df-ne 3019	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ≠ 𝑥 ↔ ¬ 𝑦 = 𝑥)
90		eldifsn 4721	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ (𝐼 ∖ {𝑥}) ↔ (𝑦 ∈ 𝐼 ∧ 𝑦 ≠ 𝑥))
91	90	biimpri 230	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ 𝐼 ∧ 𝑦 ≠ 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
92	89, 91	sylan2br 596	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑦 ∈ 𝐼 ∧ ¬ 𝑦 = 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
93	92	adantll 712	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
94		fnfvima 6997	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 Fn 𝐼 ∧ (𝐼 ∖ {𝑥}) ⊆ 𝐼 ∧ 𝑦 ∈ (𝐼 ∖ {𝑥})) → (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥})))
95	87, 88, 93, 94	syl3anc 1367	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥})))
96		elunii 4845	. . . . . . . . . . . . . . 15 ⊢ (((𝐹‘𝑦) ∈ (𝑆‘𝑦) ∧ (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥}))) → (𝐹‘𝑦) ∈ ∪ (𝑆 “ (𝐼 ∖ {𝑥})))
97	85, 95, 96	syl2anc 586	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ ∪ (𝑆 “ (𝐼 ∖ {𝑥})))
98	83, 97	sseldd 3970	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
99	19	subgsubcl 18292	. . . . . . . . . . . . 13 ⊢ ((((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) ∧ 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∧ (𝐹‘𝑦) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) → ( 0 (-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
100	80, 81, 98, 99	syl3anc 1367	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → ( 0 (-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
101	67, 69, 79, 100	ifbothda 4506	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
102	101	fmpttd 6881	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))):𝐼⟶((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
103	20	simpld 497	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹) ∈ 𝑊)
104	32, 103	eqeltrrd 2916	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) ∈ 𝑊)
105	1, 12, 13, 104, 44	dprdfcntz 19139	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) ⊆ ((Cntz‘𝐺)‘ran (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))))
106	1, 12, 13, 104	dprdffsupp 19138	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) finSupp 0 )
107	11, 44, 47, 23, 65, 102, 105, 106	gsumzsubmcl 19040	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
108	43, 107	eqeltrrd 2916	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
109	10, 108	elind 4173	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
110	12, 13, 14, 11, 61	dprddisj 19133	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 })
111	109, 110	eleqtrd 2917	. . . . . 6 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ { 0 })
112		elsni 4586	. . . . . 6 ⊢ ((𝐹‘𝑥) ∈ { 0 } → (𝐹‘𝑥) = 0 )
113	111, 112	syl 17	. . . . 5 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) = 0 )
114	113	mpteq2dva 5163	. . . 4 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐼 ↦ 0 ))
115	8, 114	eqtrd 2858	. . 3 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ))
116	115	ex 415	. 2 ⊢ (𝜑 → ((𝐺 Σg 𝐹) = 0 → 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 )))
117	11	gsumz 18002	. . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝐼 ∈ V) → (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )) = 0 )
118	46, 22, 117	syl2anc 586	. . 3 ⊢ (𝜑 → (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )) = 0 )
119		oveq2 7166	. . . 4 ⊢ (𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ) → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )))
120	119	eqeq1d 2825	. . 3 ⊢ (𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ) → ((𝐺 Σg 𝐹) = 0 ↔ (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )) = 0 ))
121	118, 120	syl5ibrcom 249	. 2 ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ) → (𝐺 Σg 𝐹) = 0 ))
122	116, 121	impbid 214	1 ⊢ (𝜑 → ((𝐺 Σg 𝐹) = 0 ↔ 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 )))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114   ≠ wne 3018  {crab 3144  Vcvv 3496   ∖ cdif 3935   ∩ cin 3937   ⊆ wss 3938  ifcif 4469  𝒫 cpw 4541  {csn 4569  ∪ cuni 4840   class class class wbr 5068   ↦ cmpt 5148  dom cdm 5557  ran crn 5558   “ cima 5560   Fn wfn 6352  ⟶wf 6353  ‘cfv 6357  (class class class)co 7158   ∘_f cof 7409  Xcixp 8463   finSupp cfsupp 8835  Basecbs 16485  0_gc0g 16715   Σ_g cgsu 16716  Moorecmre 16855  mrClscmrc 16856  ACScacs 16858  Mndcmnd 17913  SubMndcsubmnd 17957  Grpcgrp 18105  -_gcsg 18107  SubGrpcsubg 18275  Cntzccntz 18447   DProd cdprd 19117

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-iin 4924  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-se 5517  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-isom 6366  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-of 7411  df-om 7583  df-1st 7691  df-2nd 7692  df-supp 7833  df-tpos 7894  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-oadd 8108  df-er 8291  df-map 8410  df-ixp 8464  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-fsupp 8836  df-oi 8976  df-card 9370  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-nn 11641  df-2 11703  df-n0 11901  df-z 11985  df-uz 12247  df-fz 12896  df-fzo 13037  df-seq 13373  df-hash 13694  df-ndx 16488  df-slot 16489  df-base 16491  df-sets 16492  df-ress 16493  df-plusg 16580  df-0g 16717  df-gsum 16718  df-mre 16859  df-mrc 16860  df-acs 16862  df-mgm 17854  df-sgrp 17903  df-mnd 17914  df-mhm 17958  df-submnd 17959  df-grp 18108  df-minusg 18109  df-sbg 18110  df-mulg 18227  df-subg 18278  df-ghm 18358  df-gim 18401  df-cntz 18449  df-oppg 18476  df-cmn 18910  df-dprd 19119

This theorem is referenced by:  dprdf11  19147