Theorem gsum0g 13450

Description: Value of the empty group sum. (Contributed by Mario Carneiro, 7-Dec-2014.)

Hypothesis

Ref	Expression
gsum0.z	⊢ 0 = (0g‘𝐺)

Assertion

Ref	Expression
gsum0g	⊢ (𝐺 ∈ 𝑉 → (𝐺 Σg ∅) = 0 )

Proof of Theorem gsum0g

Dummy variables 𝑚 𝑛 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2229	. . 3 ⊢ (Base‘𝐺) = (Base‘𝐺)
2		gsum0.z	. . 3 ⊢ 0 = (0g‘𝐺)
3		eqid 2229	. . 3 ⊢ (+g‘𝐺) = (+g‘𝐺)
4		id 19	. . 3 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ 𝑉)
5		0ex 4211	. . . 4 ⊢ ∅ ∈ V
6	5	a1i 9	. . 3 ⊢ (𝐺 ∈ 𝑉 → ∅ ∈ V)
7		f0 5521	. . . 4 ⊢ ∅:∅⟶(Base‘𝐺)
8	7	a1i 9	. . 3 ⊢ (𝐺 ∈ 𝑉 → ∅:∅⟶(Base‘𝐺))
9	1, 2, 3, 4, 6, 8	igsumval 13444	. 2 ⊢ (𝐺 ∈ 𝑉 → (𝐺 Σg ∅) = (℩𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛)))))
10		eqidd 2230	. . . . 5 ⊢ (𝐺 ∈ 𝑉 → ∅ = ∅)
11		eqidd 2230	. . . . 5 ⊢ (𝐺 ∈ 𝑉 → 0 = 0 )
12	10, 11	jca 306	. . . 4 ⊢ (𝐺 ∈ 𝑉 → (∅ = ∅ ∧ 0 = 0 ))
13	12	orcd 738	. . 3 ⊢ (𝐺 ∈ 𝑉 → ((∅ = ∅ ∧ 0 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))))
14		fn0g 13429	. . . . . 6 ⊢ 0g Fn V
15		elex 2811	. . . . . 6 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ V)
16		funfvex 5649	. . . . . . 7 ⊢ ((Fun 0g ∧ 𝐺 ∈ dom 0g) → (0g‘𝐺) ∈ V)
17	16	funfni 5426	. . . . . 6 ⊢ ((0g Fn V ∧ 𝐺 ∈ V) → (0g‘𝐺) ∈ V)
18	14, 15, 17	sylancr 414	. . . . 5 ⊢ (𝐺 ∈ 𝑉 → (0g‘𝐺) ∈ V)
19	2, 18	eqeltrid 2316	. . . 4 ⊢ (𝐺 ∈ 𝑉 → 0 ∈ V)
20		eueq 2974	. . . . . 6 ⊢ ( 0 ∈ V ↔ ∃!𝑥 𝑥 = 0 )
21		eqid 2229	. . . . . . . . 9 ⊢ ∅ = ∅
22	21	biantrur 303	. . . . . . . 8 ⊢ (𝑥 = 0 ↔ (∅ = ∅ ∧ 𝑥 = 0 ))
23		eluzfz1 10244	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ≥‘𝑚) → 𝑚 ∈ (𝑚...𝑛))
24		n0i 3497	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (𝑚...𝑛) → ¬ (𝑚...𝑛) = ∅)
25	23, 24	syl 14	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (ℤ≥‘𝑚) → ¬ (𝑚...𝑛) = ∅)
26	25	neqcomd 2234	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ≥‘𝑚) → ¬ ∅ = (𝑚...𝑛))
27	26	intnanrd 937	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ≥‘𝑚) → ¬ (∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛)))
28	27	nrex 2622	. . . . . . . . . 10 ⊢ ¬ ∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))
29	28	nex 1546	. . . . . . . . 9 ⊢ ¬ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))
30	29	biorfi 751	. . . . . . . 8 ⊢ ((∅ = ∅ ∧ 𝑥 = 0 ) ↔ ((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))))
31	22, 30	bitri 184	. . . . . . 7 ⊢ (𝑥 = 0 ↔ ((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))))
32	31	eubii 2086	. . . . . 6 ⊢ (∃!𝑥 𝑥 = 0 ↔ ∃!𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))))
33	20, 32	bitri 184	. . . . 5 ⊢ ( 0 ∈ V ↔ ∃!𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))))
34	19, 33	sylib 122	. . . 4 ⊢ (𝐺 ∈ 𝑉 → ∃!𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))))
35		eqeq1 2236	. . . . . . 7 ⊢ (𝑥 = 0 → (𝑥 = 0 ↔ 0 = 0 ))
36	35	anbi2d 464	. . . . . 6 ⊢ (𝑥 = 0 → ((∅ = ∅ ∧ 𝑥 = 0 ) ↔ (∅ = ∅ ∧ 0 = 0 )))
37		eqeq1 2236	. . . . . . . . 9 ⊢ (𝑥 = 0 → (𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛) ↔ 0 = (seq𝑚((+g‘𝐺), ∅)‘𝑛)))
38	37	anbi2d 464	. . . . . . . 8 ⊢ (𝑥 = 0 → ((∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛)) ↔ (∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))))
39	38	rexbidv 2531	. . . . . . 7 ⊢ (𝑥 = 0 → (∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛)) ↔ ∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))))
40	39	exbidv 1871	. . . . . 6 ⊢ (𝑥 = 0 → (∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛)) ↔ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))))
41	36, 40	orbi12d 798	. . . . 5 ⊢ (𝑥 = 0 → (((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))) ↔ ((∅ = ∅ ∧ 0 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g‘𝐺), ∅)‘𝑛)))))
42	41	iota2 5311	. . . 4 ⊢ (( 0 ∈ V ∧ ∃!𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛)))) → (((∅ = ∅ ∧ 0 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))) ↔ (℩𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛)))) = 0 ))
43	19, 34, 42	syl2anc 411	. . 3 ⊢ (𝐺 ∈ 𝑉 → (((∅ = ∅ ∧ 0 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 0 = (seq𝑚((+g‘𝐺), ∅)‘𝑛))) ↔ (℩𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛)))) = 0 ))
44	13, 43	mpbid 147	. 2 ⊢ (𝐺 ∈ 𝑉 → (℩𝑥((∅ = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(∅ = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝐺), ∅)‘𝑛)))) = 0 )
45	9, 44	eqtrd 2262	1 ⊢ (𝐺 ∈ 𝑉 → (𝐺 Σg ∅) = 0 )

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 713   = wceq 1395  ∃wex 1538  ∃!weu 2077   ∈ wcel 2200  ∃wrex 2509  Vcvv 2799  ∅c0 3491  ℩cio 5279   Fn wfn 5316  ⟶wf 5317  ‘cfv 5321  (class class class)co 6010  ℤ_≥cuz 9738  ...cfz 10221  seqcseq 10686  Basecbs 13053  +_gcplusg 13131  0_gc0g 13310   Σ_g cgsu 13311

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-cnex 8106  ax-resscn 8107  ax-1re 8109  ax-addrcl 8112  ax-pre-ltirr 8127

This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4385  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-recs 6462  df-frec 6548  df-pnf 8199  df-mnf 8200  df-xr 8201  df-ltxr 8202  df-le 8203  df-neg 8336  df-inn 9127  df-z 9463  df-uz 9739  df-fz 10222  df-seqfrec 10687  df-ndx 13056  df-slot 13057  df-base 13059  df-0g 13312  df-igsum 13313

This theorem is referenced by:  gsumwsubmcl  13550  gsumwmhm  13552  mulgnn0gsum  13686  gsumfzfsumlem0  14571