Theorem fngzsum 13708

Description: Iterated sum has a universal domain. (Contributed by Jim Kingdon, 28-Jun-2025.)

Assertion

Ref	Expression
fngzsum	⊢ Σgz Fn (V × V)

Proof of Theorem fngzsum

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

Step	Hyp	Ref	Expression
1		df-gzsum 13613	. 2 ⊢ Σgz = (𝑤 ∈ V, 𝑓 ∈ V ↦ (℩𝑥((dom 𝑓 = ∅ ∧ 𝑥 = (0g‘𝑤)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)))))
2		unab 3498	. . . 4 ⊢ ({𝑥 ∣ (dom 𝑓 = ∅ ∧ 𝑥 = (0g‘𝑤))} ∪ {𝑥 ∣ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))}) = {𝑥 ∣ ((dom 𝑓 = ∅ ∧ 𝑥 = (0g‘𝑤)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)))}
3		df-sn 3715	. . . . . . 7 ⊢ {(0g‘𝑤)} = {𝑥 ∣ 𝑥 = (0g‘𝑤)}
4		fn0g 13695	. . . . . . . . 9 ⊢ 0g Fn V
5		vex 2824	. . . . . . . . 9 ⊢ 𝑤 ∈ V
6		funfvex 5712	. . . . . . . . . 10 ⊢ ((Fun 0g ∧ 𝑤 ∈ dom 0g) → (0g‘𝑤) ∈ V)
7	6	funfni 5483	. . . . . . . . 9 ⊢ ((0g Fn V ∧ 𝑤 ∈ V) → (0g‘𝑤) ∈ V)
8	4, 5, 7	mp2an 430	. . . . . . . 8 ⊢ (0g‘𝑤) ∈ V
9	8	snex 4322	. . . . . . 7 ⊢ {(0g‘𝑤)} ∈ V
10	3, 9	eqeltrri 2312	. . . . . 6 ⊢ {𝑥 ∣ 𝑥 = (0g‘𝑤)} ∈ V
11		simpr 110	. . . . . . 7 ⊢ ((dom 𝑓 = ∅ ∧ 𝑥 = (0g‘𝑤)) → 𝑥 = (0g‘𝑤))
12	11	ss2abi 3320	. . . . . 6 ⊢ {𝑥 ∣ (dom 𝑓 = ∅ ∧ 𝑥 = (0g‘𝑤))} ⊆ {𝑥 ∣ 𝑥 = (0g‘𝑤)}
13	10, 12	ssexi 4271	. . . . 5 ⊢ {𝑥 ∣ (dom 𝑓 = ∅ ∧ 𝑥 = (0g‘𝑤))} ∈ V
14		zex 9653	. . . . . . 7 ⊢ ℤ ∈ V
15	14, 14	ab2rexex 6364	. . . . . 6 ⊢ {𝑥 ∣ ∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)} ∈ V
16		df-rex 2534	. . . . . . . . . . . 12 ⊢ (∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)) ↔ ∃𝑛(𝑛 ∈ (ℤ≥‘𝑚) ∧ (dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))))
17		eluzel2 9926	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (ℤ≥‘𝑚) → 𝑚 ∈ ℤ)
18		eluzelz 9931	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ (ℤ≥‘𝑚) → 𝑛 ∈ ℤ)
19	17, 18	jca 306	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (ℤ≥‘𝑚) → (𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ))
20		simpr 110	. . . . . . . . . . . . . . 15 ⊢ ((dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)) → 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))
21	19, 20	anim12i 338	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ (ℤ≥‘𝑚) ∧ (dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))) → ((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)))
22		anass 405	. . . . . . . . . . . . . 14 ⊢ (((𝑚 ∈ ℤ ∧ 𝑛 ∈ ℤ) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)) ↔ (𝑚 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))))
23	21, 22	sylib 122	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ (ℤ≥‘𝑚) ∧ (dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))) → (𝑚 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))))
24	23	eximi 1653	. . . . . . . . . . . 12 ⊢ (∃𝑛(𝑛 ∈ (ℤ≥‘𝑚) ∧ (dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))) → ∃𝑛(𝑚 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))))
25	16, 24	sylbi 121	. . . . . . . . . . 11 ⊢ (∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)) → ∃𝑛(𝑚 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))))
26		19.42v 1962	. . . . . . . . . . 11 ⊢ (∃𝑛(𝑚 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))) ↔ (𝑚 ∈ ℤ ∧ ∃𝑛(𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))))
27	25, 26	sylib 122	. . . . . . . . . 10 ⊢ (∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)) → (𝑚 ∈ ℤ ∧ ∃𝑛(𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))))
28		df-rex 2534	. . . . . . . . . . 11 ⊢ (∃𝑛 ∈ ℤ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛) ↔ ∃𝑛(𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)))
29	28	anbi2i 461	. . . . . . . . . 10 ⊢ ((𝑚 ∈ ℤ ∧ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)) ↔ (𝑚 ∈ ℤ ∧ ∃𝑛(𝑛 ∈ ℤ ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))))
30	27, 29	sylibr 134	. . . . . . . . 9 ⊢ (∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)) → (𝑚 ∈ ℤ ∧ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)))
31	30	eximi 1653	. . . . . . . 8 ⊢ (∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)) → ∃𝑚(𝑚 ∈ ℤ ∧ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)))
32		df-rex 2534	. . . . . . . 8 ⊢ (∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛) ↔ ∃𝑚(𝑚 ∈ ℤ ∧ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)))
33	31, 32	sylibr 134	. . . . . . 7 ⊢ (∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)) → ∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))
34	33	ss2abi 3320	. . . . . 6 ⊢ {𝑥 ∣ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))} ⊆ {𝑥 ∣ ∃𝑚 ∈ ℤ ∃𝑛 ∈ ℤ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)}
35	15, 34	ssexi 4271	. . . . 5 ⊢ {𝑥 ∣ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))} ∈ V
36	13, 35	unex 4587	. . . 4 ⊢ ({𝑥 ∣ (dom 𝑓 = ∅ ∧ 𝑥 = (0g‘𝑤))} ∪ {𝑥 ∣ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛))}) ∈ V
37	2, 36	eqeltrri 2312	. . 3 ⊢ {𝑥 ∣ ((dom 𝑓 = ∅ ∧ 𝑥 = (0g‘𝑤)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)))} ∈ V
38		iotaexab 5356	. . 3 ⊢ ({𝑥 ∣ ((dom 𝑓 = ∅ ∧ 𝑥 = (0g‘𝑤)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)))} ∈ V → (℩𝑥((dom 𝑓 = ∅ ∧ 𝑥 = (0g‘𝑤)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)))) ∈ V)
39	37, 38	ax-mp 5	. 2 ⊢ (℩𝑥((dom 𝑓 = ∅ ∧ 𝑥 = (0g‘𝑤)) ∨ ∃𝑚∃𝑛 ∈ (ℤ≥‘𝑚)(dom 𝑓 = (𝑚...𝑛) ∧ 𝑥 = (seq𝑚((+g‘𝑤), 𝑓)‘𝑛)))) ∈ V
40	1, 39	fnmpoi 6439	1 ⊢ Σgz Fn (V × V)

This proof depends on syntax axioms:   ∧ wa 104   ∨ wo 720   = wceq 1402  ∃wex 1545   ∈ wcel 2209  {cab 2224  ∃wrex 2529  Vcvv 2821   ∪ cun 3218  ∅c0 3520  {csn 3709   × cxp 4772  dom cdm 4774  ℩cio 5335   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085  ℤcz 9644  ℤ_≥cuz 9921  ...cfz 10411  seqcseq 10884  +_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-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-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-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-1st 6374  df-2nd 6375  df-neg 8500  df-inn 9305  df-z 9645  df-uz 9922  df-ndx 13355  df-slot 13356  df-base 13358  df-0g 13612  df-gzsum 13613

This theorem is used by:  gsumvalfi  14152