Theorem dprdfeq0 19978

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 2728	. . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺)
6	1, 2, 3, 4, 5	dprdff 19968	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐼⟶(Base‘𝐺))
7	6	feqmptd 6967	. . . . 5 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)))
8	7	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → 𝐹 = (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)))
9	1, 2, 3, 4	dprdfcl 19969	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (𝑆‘𝑥))
10	9	adantlr 714	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (𝑆‘𝑥))
11		eldprdi.0	. . . . . . . . . . . 12 ⊢ 0 = (0g‘𝐺)
12	2	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺dom DProd 𝑆)
13	3	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → dom 𝑆 = 𝐼)
14		simpr 484	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝐼)
15		eqid 2728	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))
16	11, 1, 12, 13, 14, 10, 15	dprdfid 19973	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∈ 𝑊 ∧ (𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))) = (𝐹‘𝑥)))
17	16	simpld 494	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∈ 𝑊)
18	4	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹 ∈ 𝑊)
19		eqid 2728	. . . . . . . . . . . 12 ⊢ (-g‘𝐺) = (-g‘𝐺)
20	11, 1, 12, 13, 17, 18, 19	dprdfsub 19977	. . . . . . . . . . 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 19957	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐼 ∈ V)
23	22	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐼 ∈ V)
24		fvex 6910	. . . . . . . . . . . . . 14 ⊢ (𝐹‘𝑥) ∈ V
25	11	fvexi 6911	. . . . . . . . . . . . . 14 ⊢ 0 ∈ V
26	24, 25	ifex 4579	. . . . . . . . . . . . 13 ⊢ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) ∈ V
27	26	a1i 11	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) ∈ V)
28		fvexd 6912	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ V)
29		eqidd 2729	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))
30	6	ad2antrr 725	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹:𝐼⟶(Base‘𝐺))
31	30	feqmptd 6967	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐹 = (𝑦 ∈ 𝐼 ↦ (𝐹‘𝑦)))
32	23, 27, 28, 29, 31	offval2 7705	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹) = (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))))
33	32	oveq2d 7436	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹)) = (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))))
34	16	simprd 495	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ))) = (𝐹‘𝑥))
35		simplr 768	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg 𝐹) = 0 )
36	34, 35	oveq12d 7438	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹)) = ((𝐹‘𝑥)(-g‘𝐺) 0 ))
37		dprdgrp 19961	. . . . . . . . . . . . 13 ⊢ (𝐺dom DProd 𝑆 → 𝐺 ∈ Grp)
38	12, 37	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ Grp)
39	30, 14	ffvelcdmd 7095	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ (Base‘𝐺))
40	5, 11, 19	grpsubid1 18980	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ (𝐹‘𝑥) ∈ (Base‘𝐺)) → ((𝐹‘𝑥)(-g‘𝐺) 0 ) = (𝐹‘𝑥))
41	38, 39, 40	syl2anc 583	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺) 0 ) = (𝐹‘𝑥))
42	36, 41	eqtrd 2768	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐺 Σg (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )))(-g‘𝐺)(𝐺 Σg 𝐹)) = (𝐹‘𝑥))
43	21, 33, 42	3eqtr3d 2776	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))) = (𝐹‘𝑥))
44		eqid 2728	. . . . . . . . . 10 ⊢ (Cntz‘𝐺) = (Cntz‘𝐺)
45		grpmnd 18896	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
46	2, 37, 45	3syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 ∈ Mnd)
47	46	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝐺 ∈ Mnd)
48	5	subgacs 19115	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)))
49		acsmre 17631	. . . . . . . . . . . . 13 ⊢ ((SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
50	38, 48, 49	3syl 18	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
51		imassrn 6074	. . . . . . . . . . . . . 14 ⊢ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ran 𝑆
52	2, 3	dprdf2 19963	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑆:𝐼⟶(SubGrp‘𝐺))
53	52	ad2antrr 725	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑆:𝐼⟶(SubGrp‘𝐺))
54	53	frnd 6730	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran 𝑆 ⊆ (SubGrp‘𝐺))
55		mresspw 17571	. . . . . . . . . . . . . . . 16 ⊢ ((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
56	50, 55	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺))
57	54, 56	sstrd 3990	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran 𝑆 ⊆ 𝒫 (Base‘𝐺))
58	51, 57	sstrid 3991	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ 𝒫 (Base‘𝐺))
59		sspwuni 5103	. . . . . . . . . . . . 13 ⊢ ((𝑆 “ (𝐼 ∖ {𝑥})) ⊆ 𝒫 (Base‘𝐺) ↔ ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺))
60	58, 59	sylib 217	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺))
61		eqid 2728	. . . . . . . . . . . . 13 ⊢ (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
62	61	mrccl 17590	. . . . . . . . . . . 12 ⊢ (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
63	50, 60, 62	syl2anc 583	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
64		subgsubm 19102	. . . . . . . . . . 11 ⊢ (((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubMnd‘𝐺))
65	63, 64	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubMnd‘𝐺))
66		oveq1 7427	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑥) = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) = (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))
67	66	eleq1d 2814	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑥) = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → (((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ↔ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
68		oveq1 7427	. . . . . . . . . . . . 13 ⊢ ( 0 = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → ( 0 (-g‘𝐺)(𝐹‘𝑦)) = (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))
69	68	eleq1d 2814	. . . . . . . . . . . 12 ⊢ ( 0 = if(𝑦 = 𝑥, (𝐹‘𝑥), 0 ) → (( 0 (-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ↔ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
70		simpr 484	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → 𝑦 = 𝑥)
71	70	fveq2d 6901	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → (𝐹‘𝑦) = (𝐹‘𝑥))
72	71	oveq2d 7436	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) = ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)))
73	5, 11, 19	grpsubid 18979	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ Grp ∧ (𝐹‘𝑥) ∈ (Base‘𝐺)) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) = 0 )
74	38, 39, 73	syl2anc 583	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) = 0 )
75	11	subg0cl 19088	. . . . . . . . . . . . . . . 16 ⊢ (((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
76	63, 75	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
77	74, 76	eqeltrd 2829	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
78	77	ad2antrr 725	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑥)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
79	72, 78	eqeltrd 2829	. . . . . . . . . . . 12 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ 𝑦 = 𝑥) → ((𝐹‘𝑥)(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
80	63	ad2antrr 725	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
81	80, 75	syl 17	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 0 ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
82	50, 61, 60	mrcssidd 17604	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
83	82	ad2antrr 725	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → ∪ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
84	1, 12, 13, 18	dprdfcl 19969	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
85	84	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ (𝑆‘𝑦))
86	53	ffnd 6723	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → 𝑆 Fn 𝐼)
87	86	ad2antrr 725	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 𝑆 Fn 𝐼)
88		difssd 4131	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐼 ∖ {𝑥}) ⊆ 𝐼)
89		df-ne 2938	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ≠ 𝑥 ↔ ¬ 𝑦 = 𝑥)
90		eldifsn 4791	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ (𝐼 ∖ {𝑥}) ↔ (𝑦 ∈ 𝐼 ∧ 𝑦 ≠ 𝑥))
91	90	biimpri 227	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ 𝐼 ∧ 𝑦 ≠ 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
92	89, 91	sylan2br 594	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑦 ∈ 𝐼 ∧ ¬ 𝑦 = 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
93	92	adantll 713	. . . . . . . . . . . . . . . 16 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → 𝑦 ∈ (𝐼 ∖ {𝑥}))
94		fnfvima 7245	. . . . . . . . . . . . . . . 16 ⊢ ((𝑆 Fn 𝐼 ∧ (𝐼 ∖ {𝑥}) ⊆ 𝐼 ∧ 𝑦 ∈ (𝐼 ∖ {𝑥})) → (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥})))
95	87, 88, 93, 94	syl3anc 1369	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥})))
96		elunii 4913	. . . . . . . . . . . . . . 15 ⊢ (((𝐹‘𝑦) ∈ (𝑆‘𝑦) ∧ (𝑆‘𝑦) ∈ (𝑆 “ (𝐼 ∖ {𝑥}))) → (𝐹‘𝑦) ∈ ∪ (𝑆 “ (𝐼 ∖ {𝑥})))
97	85, 95, 96	syl2anc 583	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ ∪ (𝑆 “ (𝐼 ∖ {𝑥})))
98	83, 97	sseldd 3981	. . . . . . . . . . . . 13 ⊢ (((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) ∧ ¬ 𝑦 = 𝑥) → (𝐹‘𝑦) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
99	19	subgsubcl 19091	. . . . . . . . . . . . 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 4567	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) ∧ 𝑦 ∈ 𝐼) → (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
102	101	fmpttd 7125	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))):𝐼⟶((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
103	20	simpld 494	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )) ∘f (-g‘𝐺)𝐹) ∈ 𝑊)
104	32, 103	eqeltrrd 2830	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) ∈ 𝑊)
105	1, 12, 13, 104, 44	dprdfcntz 19971	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ran (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) ⊆ ((Cntz‘𝐺)‘ran (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))))
106	1, 12, 13, 104	dprdffsupp 19970	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦))) finSupp 0 )
107	11, 44, 47, 23, 65, 102, 105, 106	gsumzsubmcl 19872	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐺 Σg (𝑦 ∈ 𝐼 ↦ (if(𝑦 = 𝑥, (𝐹‘𝑥), 0 )(-g‘𝐺)(𝐹‘𝑦)))) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
108	43, 107	eqeltrrd 2830	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥}))))
109	10, 108	elind 4194	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))))
110	12, 13, 14, 11, 61	dprddisj 19965	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → ((𝑆‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘∪ (𝑆 “ (𝐼 ∖ {𝑥})))) = { 0 })
111	109, 110	eleqtrd 2831	. . . . . 6 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ { 0 })
112		elsni 4646	. . . . . 6 ⊢ ((𝐹‘𝑥) ∈ { 0 } → (𝐹‘𝑥) = 0 )
113	111, 112	syl 17	. . . . 5 ⊢ (((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) = 0 )
114	113	mpteq2dva 5248	. . . 4 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → (𝑥 ∈ 𝐼 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐼 ↦ 0 ))
115	8, 114	eqtrd 2768	. . 3 ⊢ ((𝜑 ∧ (𝐺 Σg 𝐹) = 0 ) → 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ))
116	115	ex 412	. 2 ⊢ (𝜑 → ((𝐺 Σg 𝐹) = 0 → 𝐹 = (𝑥 ∈ 𝐼 ↦ 0 )))
117	11	gsumz 18787	. . . 4 ⊢ ((𝐺 ∈ Mnd ∧ 𝐼 ∈ V) → (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )) = 0 )
118	46, 22, 117	syl2anc 583	. . 3 ⊢ (𝜑 → (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )) = 0 )
119		oveq2 7428	. . . 4 ⊢ (𝐹 = (𝑥 ∈ 𝐼 ↦ 0 ) → (𝐺 Σg 𝐹) = (𝐺 Σg (𝑥 ∈ 𝐼 ↦ 0 )))
120	119	eqeq1d 2730	. . 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 1534   ∈ wcel 2099   ≠ wne 2937  {crab 3429  Vcvv 3471   ∖ cdif 3944   ∩ cin 3946   ⊆ wss 3947  ifcif 4529  𝒫 cpw 4603  {csn 4629  ∪ cuni 4908   class class class wbr 5148   ↦ cmpt 5231  dom cdm 5678  ran crn 5679   “ cima 5681   Fn wfn 6543  ⟶wf 6544  ‘cfv 6548  (class class class)co 7420   ∘_f cof 7683  Xcixp 8915   finSupp cfsupp 9385  Basecbs 17179  0_gc0g 17420   Σ_g cgsu 17421  Moorecmre 17561  mrClscmrc 17562  ACScacs 17564  Mndcmnd 18693  SubMndcsubmnd 18738  Grpcgrp 18889  -_gcsg 18891  SubGrpcsubg 19074  Cntzccntz 19265   DProd cdprd 19949

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5365  ax-pr 5429  ax-un 7740  ax-cnex 11194  ax-resscn 11195  ax-1cn 11196  ax-icn 11197  ax-addcl 11198  ax-addrcl 11199  ax-mulcl 11200  ax-mulrcl 11201  ax-mulcom 11202  ax-addass 11203  ax-mulass 11204  ax-distr 11205  ax-i2m1 11206  ax-1ne0 11207  ax-1rid 11208  ax-rnegex 11209  ax-rrecex 11210  ax-cnre 11211  ax-pre-lttri 11212  ax-pre-lttrn 11213  ax-pre-ltadd 11214  ax-pre-mulgt0 11215

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-nel 3044  df-ral 3059  df-rex 3068  df-rmo 3373  df-reu 3374  df-rab 3430  df-v 3473  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-int 4950  df-iun 4998  df-iin 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-se 5634  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-pred 6305  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6500  df-fun 6550  df-fn 6551  df-f 6552  df-f1 6553  df-fo 6554  df-f1o 6555  df-fv 6556  df-isom 6557  df-riota 7376  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7685  df-om 7871  df-1st 7993  df-2nd 7994  df-supp 8166  df-tpos 8231  df-frecs 8286  df-wrecs 8317  df-recs 8391  df-rdg 8430  df-1o 8486  df-er 8724  df-map 8846  df-ixp 8916  df-en 8964  df-dom 8965  df-sdom 8966  df-fin 8967  df-fsupp 9386  df-oi 9533  df-card 9962  df-pnf 11280  df-mnf 11281  df-xr 11282  df-ltxr 11283  df-le 11284  df-sub 11476  df-neg 11477  df-nn 12243  df-2 12305  df-n0 12503  df-z 12589  df-uz 12853  df-fz 13517  df-fzo 13660  df-seq 13999  df-hash 14322  df-sets 17132  df-slot 17150  df-ndx 17162  df-base 17180  df-ress 17209  df-plusg 17245  df-0g 17422  df-gsum 17423  df-mre 17565  df-mrc 17566  df-acs 17568  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-mhm 18739  df-submnd 18740  df-grp 18892  df-minusg 18893  df-sbg 18894  df-mulg 19023  df-subg 19077  df-ghm 19167  df-gim 19212  df-cntz 19267  df-oppg 19296  df-cmn 19736  df-dprd 19951

This theorem is referenced by:  dprdf11  19979

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »