MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nn0gsumfz Structured version   Visualization version   GIF version

Theorem nn0gsumfz 19098
Description: Replacing a finitely supported function over the nonnegative integers by a function over a finite set of sequential integers in a finite group sum. (Contributed by AV, 9-Oct-2019.)
Hypotheses
Ref Expression
nn0gsumfz.b 𝐵 = (Base‘𝐺)
nn0gsumfz.0 0 = (0g𝐺)
nn0gsumfz.g (𝜑𝐺 ∈ CMnd)
nn0gsumfz.f (𝜑𝐹 ∈ (𝐵m0))
nn0gsumfz.y (𝜑𝐹 finSupp 0 )
Assertion
Ref Expression
nn0gsumfz (𝜑 → ∃𝑠 ∈ ℕ0𝑓 ∈ (𝐵m (0...𝑠))(𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓)))
Distinct variable groups:   𝐵,𝑓   𝑓,𝐹,𝑠,𝑥   𝑓,𝐺   0 ,𝑓,𝑠,𝑥   𝜑,𝑓,𝑠
Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥,𝑠)   𝐺(𝑥,𝑠)

Proof of Theorem nn0gsumfz
StepHypRef Expression
1 nn0gsumfz.f . . . 4 (𝜑𝐹 ∈ (𝐵m0))
2 nn0gsumfz.0 . . . . 5 0 = (0g𝐺)
32fvexi 6679 . . . 4 0 ∈ V
41, 3jctir 523 . . 3 (𝜑 → (𝐹 ∈ (𝐵m0) ∧ 0 ∈ V))
5 nn0gsumfz.y . . 3 (𝜑𝐹 finSupp 0 )
6 fsuppmapnn0ub 13357 . . 3 ((𝐹 ∈ (𝐵m0) ∧ 0 ∈ V) → (𝐹 finSupp 0 → ∃𝑠 ∈ ℕ0𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 )))
74, 5, 6sylc 65 . 2 (𝜑 → ∃𝑠 ∈ ℕ0𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ))
8 eqidd 2822 . . . . 5 (((𝜑𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 )) → (𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠)))
9 simpr 487 . . . . 5 (((𝜑𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 )) → ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ))
10 nn0gsumfz.b . . . . . . 7 𝐵 = (Base‘𝐺)
11 nn0gsumfz.g . . . . . . . 8 (𝜑𝐺 ∈ CMnd)
1211adantr 483 . . . . . . 7 ((𝜑𝑠 ∈ ℕ0) → 𝐺 ∈ CMnd)
131adantr 483 . . . . . . 7 ((𝜑𝑠 ∈ ℕ0) → 𝐹 ∈ (𝐵m0))
14 simpr 487 . . . . . . 7 ((𝜑𝑠 ∈ ℕ0) → 𝑠 ∈ ℕ0)
15 eqid 2821 . . . . . . 7 (𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠))
1610, 2, 12, 13, 14, 15fsfnn0gsumfsffz 19097 . . . . . 6 ((𝜑𝑠 ∈ ℕ0) → (∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) → (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠)))))
1716imp 409 . . . . 5 (((𝜑𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 )) → (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠))))
1813adantr 483 . . . . . . 7 (((𝜑𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 )) → 𝐹 ∈ (𝐵m0))
19 fz0ssnn0 12996 . . . . . . 7 (0...𝑠) ⊆ ℕ0
20 elmapssres 8425 . . . . . . 7 ((𝐹 ∈ (𝐵m0) ∧ (0...𝑠) ⊆ ℕ0) → (𝐹 ↾ (0...𝑠)) ∈ (𝐵m (0...𝑠)))
2118, 19, 20sylancl 588 . . . . . 6 (((𝜑𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 )) → (𝐹 ↾ (0...𝑠)) ∈ (𝐵m (0...𝑠)))
22 eqeq1 2825 . . . . . . . 8 (𝑓 = (𝐹 ↾ (0...𝑠)) → (𝑓 = (𝐹 ↾ (0...𝑠)) ↔ (𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠))))
23 oveq2 7158 . . . . . . . . 9 (𝑓 = (𝐹 ↾ (0...𝑠)) → (𝐺 Σg 𝑓) = (𝐺 Σg (𝐹 ↾ (0...𝑠))))
2423eqeq2d 2832 . . . . . . . 8 (𝑓 = (𝐹 ↾ (0...𝑠)) → ((𝐺 Σg 𝐹) = (𝐺 Σg 𝑓) ↔ (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠)))))
2522, 243anbi13d 1434 . . . . . . 7 (𝑓 = (𝐹 ↾ (0...𝑠)) → ((𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓)) ↔ ((𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠))))))
2625adantl 484 . . . . . 6 ((((𝜑𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 )) ∧ 𝑓 = (𝐹 ↾ (0...𝑠))) → ((𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓)) ↔ ((𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠))))))
2721, 26rspcedv 3616 . . . . 5 (((𝜑𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 )) → (((𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠)))) → ∃𝑓 ∈ (𝐵m (0...𝑠))(𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓))))
288, 9, 17, 27mp3and 1460 . . . 4 (((𝜑𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 )) → ∃𝑓 ∈ (𝐵m (0...𝑠))(𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓)))
2928ex 415 . . 3 ((𝜑𝑠 ∈ ℕ0) → (∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) → ∃𝑓 ∈ (𝐵m (0...𝑠))(𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓))))
3029reximdva 3274 . 2 (𝜑 → (∃𝑠 ∈ ℕ0𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) → ∃𝑠 ∈ ℕ0𝑓 ∈ (𝐵m (0...𝑠))(𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓))))
317, 30mpd 15 1 (𝜑 → ∃𝑠 ∈ ℕ0𝑓 ∈ (𝐵m (0...𝑠))(𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1083   = wceq 1533  wcel 2110  wral 3138  wrex 3139  Vcvv 3495  wss 3936   class class class wbr 5059  cres 5552  cfv 6350  (class class class)co 7150  m cmap 8400   finSupp cfsupp 8827  0cc0 10531   < clt 10669  0cn0 11891  ...cfz 12886  Basecbs 16477  0gc0g 16707   Σg cgsu 16708  CMndccmn 18900
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455  ax-cnex 10587  ax-resscn 10588  ax-1cn 10589  ax-icn 10590  ax-addcl 10591  ax-addrcl 10592  ax-mulcl 10593  ax-mulrcl 10594  ax-mulcom 10595  ax-addass 10596  ax-mulass 10597  ax-distr 10598  ax-i2m1 10599  ax-1ne0 10600  ax-1rid 10601  ax-rnegex 10602  ax-rrecex 10603  ax-cnre 10604  ax-pre-lttri 10605  ax-pre-lttrn 10606  ax-pre-ltadd 10607  ax-pre-mulgt0 10608
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-uni 4833  df-int 4870  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-tr 5166  df-id 5455  df-eprel 5460  df-po 5469  df-so 5470  df-fr 5509  df-se 5510  df-we 5511  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-pred 6143  df-ord 6189  df-on 6190  df-lim 6191  df-suc 6192  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358  df-isom 6359  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7575  df-1st 7683  df-2nd 7684  df-supp 7825  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-1o 8096  df-oadd 8100  df-er 8283  df-map 8402  df-en 8504  df-dom 8505  df-sdom 8506  df-fin 8507  df-fsupp 8828  df-oi 8968  df-card 9362  df-pnf 10671  df-mnf 10672  df-xr 10673  df-ltxr 10674  df-le 10675  df-sub 10866  df-neg 10867  df-nn 11633  df-n0 11892  df-z 11976  df-uz 12238  df-fz 12887  df-fzo 13028  df-seq 13364  df-hash 13685  df-0g 16709  df-gsum 16710  df-mgm 17846  df-sgrp 17895  df-mnd 17906  df-cntz 18441  df-cmn 18902
This theorem is referenced by:  nn0gsumfz0  19099
  Copyright terms: Public domain W3C validator