Theorem gzsumvalx 13709

Description: Expand out the substitutions in df-gzsum 13613. (Contributed by Mario Carneiro, 18-Sep-2015.)

Hypotheses

Ref	Expression
gsumval.b	⊢ 𝐵 = (Base‘𝐺)
gsumval.z	⊢ 0 = (0g‘𝐺)
gsumval.p	⊢ + = (+g‘𝐺)
gsumval.g	⊢ (𝜑 → 𝐺 ∈ 𝑉)
gsumvalx.f	⊢ (𝜑 → 𝐹 ∈ 𝑋)
gsumvalx.a	⊢ (𝜑 → dom 𝐹 = 𝐴)

Assertion

Ref	Expression
gzsumvalx	⊢ (𝜑 → (𝐺 Σgz 𝐹) = (℩𝑥((𝐴 = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))))

Distinct variable groups:   𝑥, +   𝑥, 0   𝑚,𝐹,𝑛,𝑥   𝑚,𝐺,𝑛,𝑥   𝜑,𝑚,𝑛,𝑥

Allowed substitution hints:   𝐴(𝑥, 𝑚, 𝑛)   𝐵(𝑥, 𝑚, 𝑛)   + (𝑚, 𝑛)   𝑉(𝑥, 𝑚, 𝑛)   𝑋(𝑥, 𝑚, 𝑛)   0 (𝑚, 𝑛)

Proof of Theorem gzsumvalx

Dummy variables 𝑔 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-gzsum 13613	. . 3 ⊢ Σgz = (𝑤 ∈ V, 𝑔 ∈ V ↦ (℩𝑥((dom 𝑔 = ∅ ∧ 𝑥 = (0g‘𝑤)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑔 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑔)‘𝑛)))))
2	1	a1i 9	. 2 ⊢ (𝜑 → Σgz = (𝑤 ∈ V, 𝑔 ∈ V ↦ (℩𝑥((dom 𝑔 = ∅ ∧ 𝑥 = (0g‘𝑤)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑔 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑔)‘𝑛))))))
3		simprr 537	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → 𝑔 = 𝐹)
4	3	dmeqd 4983	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → dom 𝑔 = dom 𝐹)
5		gsumvalx.a	. . . . . . . 8 ⊢ (𝜑 → dom 𝐹 = 𝐴)
6	5	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → dom 𝐹 = 𝐴)
7	4, 6	eqtrd 2271	. . . . . 6 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → dom 𝑔 = 𝐴)
8	7	eqeq1d 2247	. . . . 5 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (dom 𝑔 = ∅ ↔ 𝐴 = ∅))
9		simprl 535	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → 𝑤 = 𝐺)
10	9	fveq2d 5699	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (0g‘𝑤) = (0g‘𝐺))
11		gsumval.z	. . . . . . 7 ⊢ 0 = (0g‘𝐺)
12	10, 11	eqtr4di 2289	. . . . . 6 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (0g‘𝑤) = 0 )
13	12	eqeq2d 2250	. . . . 5 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (𝑥 = (0g‘𝑤) ↔ 𝑥 = 0 ))
14	8, 13	anbi12d 477	. . . 4 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → ((dom 𝑔 = ∅ ∧ 𝑥 = (0g‘𝑤)) ↔ (𝐴 = ∅ ∧ 𝑥 = 0 )))
15	7	eqeq1d 2247	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (dom 𝑔 = (𝑚...𝑛) ↔ 𝐴 = (𝑚...𝑛)))
16		eqidd 2239	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → 𝑚 = 𝑚)
17	9	fveq2d 5699	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (+g‘𝑤) = (+g‘𝐺))
18		gsumval.p	. . . . . . . . . . 11 ⊢ + = (+g‘𝐺)
19	17, 18	eqtr4di 2289	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (+g‘𝑤) = + )
20	16, 19, 3	seqeq123d 10893	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → seq𝑚((+g‘𝑤), 𝑔) = seq𝑚( + , 𝐹))
21	20	fveq1d 5697	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (seq𝑚((+g‘𝑤), 𝑔)‘𝑛) = (seq𝑚( + , 𝐹)‘𝑛))
22	21	eqeq2d 2250	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (𝑥 = (seq𝑚((+g‘𝑤), 𝑔)‘𝑛) ↔ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))
23	15, 22	anbi12d 477	. . . . . 6 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → ((dom 𝑔 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑔)‘𝑛)) ↔ (𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))))
24	23	rexbidv 2551	. . . . 5 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑔 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑔)‘𝑛)) ↔ ∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))))
25	24	exbidv 1878	. . . 4 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑔 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑔)‘𝑛)) ↔ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))))
26	14, 25	orbi12d 805	. . 3 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (((dom 𝑔 = ∅ ∧ 𝑥 = (0g‘𝑤)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑔 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑔)‘𝑛))) ↔ ((𝐴 = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))))
27	26	iotabidv 5360	. 2 ⊢ ((𝜑 ∧ (𝑤 = 𝐺 ∧ 𝑔 = 𝐹)) → (℩𝑥((dom 𝑔 = ∅ ∧ 𝑥 = (0g‘𝑤)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑔 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑔)‘𝑛)))) = (℩𝑥((𝐴 = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))))
28		gsumval.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑉)
29	28	elexd 2835	. 2 ⊢ (𝜑 → 𝐺 ∈ V)
30		gsumvalx.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑋)
31	30	elexd 2835	. 2 ⊢ (𝜑 → 𝐹 ∈ V)
32		unab 3498	. . . 4 ⊢ ({𝑥 ∣ (𝐴 = ∅ ∧ 𝑥 = 0 )} ∪ {𝑥 ∣ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))}) = {𝑥 ∣ ((𝐴 = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))}
33		df-sn 3715	. . . . . . 7 ⊢ { 0 } = {𝑥 ∣ 𝑥 = 0 }
34		fn0g 13695	. . . . . . . . . 10 ⊢ 0g Fn V
35		funfvex 5712	. . . . . . . . . . 11 ⊢ ((Fun 0g ∧ 𝐺 ∈ dom 0g) → (0g‘𝐺) ∈ V)
36	35	funfni 5483	. . . . . . . . . 10 ⊢ ((0g Fn V ∧ 𝐺 ∈ V) → (0g‘𝐺) ∈ V)
37	34, 29, 36	sylancr 418	. . . . . . . . 9 ⊢ (𝜑 → (0g‘𝐺) ∈ V)
38	11, 37	eqeltrid 2325	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ V)
39		snexg 4321	. . . . . . . 8 ⊢ ( 0 ∈ V → { 0 } ∈ V)
40	38, 39	syl 14	. . . . . . 7 ⊢ (𝜑 → { 0 } ∈ V)
41	33, 40	eqeltrrid 2326	. . . . . 6 ⊢ (𝜑 → {𝑥 ∣ 𝑥 = 0 } ∈ V)
42		simpr 110	. . . . . . . 8 ⊢ ((𝐴 = ∅ ∧ 𝑥 = 0 ) → 𝑥 = 0 )
43	42	ss2abi 3320	. . . . . . 7 ⊢ {𝑥 ∣ (𝐴 = ∅ ∧ 𝑥 = 0 )} ⊆ {𝑥 ∣ 𝑥 = 0 }
44	43	a1i 9	. . . . . 6 ⊢ (𝜑 → {𝑥 ∣ (𝐴 = ∅ ∧ 𝑥 = 0 )} ⊆ {𝑥 ∣ 𝑥 = 0 })
45	41, 44	ssexd 4273	. . . . 5 ⊢ (𝜑 → {𝑥 ∣ (𝐴 = ∅ ∧ 𝑥 = 0 )} ∈ V)
46		zex 9653	. . . . . . 7 ⊢ ℤ ∈ V
47	46, 46	ab2rexex 6364	. . . . . 6 ⊢ {𝑥 ∣ ∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)} ∈ V
48		df-rex 2534	. . . . . . . . . . . 12 ⊢ (∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)) ↔ ∃𝑛(𝑛 ∈ (ℤ≥‘𝑚) ∧ (𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))))
49		eluzel2 9926	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (ℤ≥‘𝑚) → 𝑚 ∈ ℤ)
50		eluzelz 9931	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (ℤ≥‘𝑚) → 𝑛 ∈ ℤ)
51	49, 50	jca 306	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (ℤ≥‘𝑚) → (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ))
52		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)) → 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))
53	51, 52	anim12i 338	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ (ℤ≥‘𝑚) ∧ (𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))) → ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))
54		anass 405	. . . . . . . . . . . . . 14 ⊢ (((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)) ↔ (𝑚 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))))
55	53, 54	sylib 122	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ (ℤ≥‘𝑚) ∧ (𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))) → (𝑚 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))))
56	55	eximi 1653	. . . . . . . . . . . 12 ⊢ (∃𝑛(𝑛 ∈ (ℤ≥‘𝑚) ∧ (𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))) → ∃𝑛(𝑚 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))))
57	48, 56	sylbi 121	. . . . . . . . . . 11 ⊢ (∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)) → ∃𝑛(𝑚 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))))
58		19.42v 1962	. . . . . . . . . . 11 ⊢ (∃𝑛(𝑚 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))) ↔ (𝑚 ∈ ℤ ∧ ∃𝑛(𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))))
59	57, 58	sylib 122	. . . . . . . . . 10 ⊢ (∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)) → (𝑚 ∈ ℤ ∧ ∃𝑛(𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))))
60		df-rex 2534	. . . . . . . . . . 11 ⊢ (∃𝑛 ∈ ℤ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛) ↔ ∃𝑛(𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))
61	60	anbi2i 461	. . . . . . . . . 10 ⊢ ((𝑚 ∈ ℤ ∧ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)) ↔ (𝑚 ∈ ℤ ∧ ∃𝑛(𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))))
62	59, 61	sylibr 134	. . . . . . . . 9 ⊢ (∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)) → (𝑚 ∈ ℤ ∧ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))
63	62	eximi 1653	. . . . . . . 8 ⊢ (∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)) → ∃𝑚(𝑚 ∈ ℤ ∧ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))
64		df-rex 2534	. . . . . . . 8 ⊢ (∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛) ↔ ∃𝑚(𝑚 ∈ ℤ ∧ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))
65	63, 64	sylibr 134	. . . . . . 7 ⊢ (∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)) → ∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))
66	65	ss2abi 3320	. . . . . 6 ⊢ {𝑥 ∣ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))} ⊆ {𝑥 ∣ ∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)}
67	47, 66	ssexi 4271	. . . . 5 ⊢ {𝑥 ∣ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))} ∈ V
68		unexg 4589	. . . . 5 ⊢ (({𝑥 ∣ (𝐴 = ∅ ∧ 𝑥 = 0 )} ∈ V ∧ {𝑥 ∣ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))} ∈ V) → ({𝑥 ∣ (𝐴 = ∅ ∧ 𝑥 = 0 )} ∪ {𝑥 ∣ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))}) ∈ V)
69	45, 67, 68	sylancl 417	. . . 4 ⊢ (𝜑 → ({𝑥 ∣ (𝐴 = ∅ ∧ 𝑥 = 0 )} ∪ {𝑥 ∣ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛))}) ∈ V)
70	32, 69	eqeltrrid 2326	. . 3 ⊢ (𝜑 → {𝑥 ∣ ((𝐴 = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))} ∈ V)
71		iotaexab 5356	. . 3 ⊢ ({𝑥 ∣ ((𝐴 = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))} ∈ V → (℩𝑥((𝐴 = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))) ∈ V)
72	70, 71	syl 14	. 2 ⊢ (𝜑 → (℩𝑥((𝐴 = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))) ∈ V)
73	2, 27, 29, 31, 72	ovmpod 6216	1 ⊢ (𝜑 → (𝐺 Σgz 𝐹) = (℩𝑥((𝐴 = ∅ ∧ 𝑥 = 0 ) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(𝐴 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚( + , 𝐹)‘𝑛)))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∨ wo 720   = wceq 1402  ∃wex 1545   ∈ wcel 2209  {cab 2224  ∃wrex 2529  Vcvv 2821   ∪ cun 3218   ⊆ wss 3220  ∅c0 3520  {csn 3709  dom cdm 4774  ℩cio 5335   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085   ∈ cmpo 6087  ℤcz 9644  ℤ_≥cuz 9921  ...cfz 10411  seqcseq 10884  Basecbs 13352  +_gcplusg 13431  0_gc0g 13610   Σ_gz cgzsu 13611

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-recs 6576  df-frec 6662  df-neg 8500  df-inn 9305  df-z 9645  df-uz 9922  df-seqfrec 10885  df-ndx 13355  df-slot 13356  df-base 13358  df-0g 13612  df-gzsum 13613

This theorem is used by:  gzsumval  13710