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

Theorem nn0gsumfz 20251
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 (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0))
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 (𝜑 → 𝐹 ∈ (𝐵 ↑m ℕ0))
2 nn0gsumfz.0 . . . . 5 0 = (0g‘𝐺)
32fvexi 6929 . . . 4 0 ∈ V
41, 3jctir 530 . . 3 (𝜑 → (𝐹 ∈ (𝐵 ↑m ℕ0) ∧ 0 ∈ V))
5 nn0gsumfz.y . . 3 (𝜑 → 𝐹 finSupp 0 )
6 fsuppmapnn0ub 14177 . . 3 ((𝐹 ∈ (𝐵 ↑m ℕ0) ∧ 0 ∈ V) → (𝐹 finSupp 0 → ∃𝑠 ∈ ℕ0 ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 )))
74, 5, 6sylc 66 . 2 (𝜑 → ∃𝑠 ∈ ℕ0 ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ))
8 eqidd 2767 . . . . 5 (((𝜑 ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠)))
9 simpr 490 . . . . 5 (((𝜑 ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 )) → ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ))
10 nn0gsumfz.b . . . . . . 7 𝐵 = (Base‘𝐺)
11 nn0gsumfz.g . . . . . . . 8 (𝜑 → 𝐺 ∈ CMnd)
1211adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ ℕ0) → 𝐺 ∈ CMnd)
131adantr 486 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ ℕ0) → 𝐹 ∈ (𝐵 ↑m ℕ0))
14 simpr 490 . . . . . . 7 ((𝜑 ∧ 𝑠 ∈ ℕ0) → 𝑠 ∈ ℕ0)
15 eqid 2766 . . . . . . 7 (𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠))
1610, 2, 12, 13, 14, 15fsfnn0gsumfsffz 20250 . . . . . 6 ((𝜑 ∧ 𝑠 ∈ ℕ0) → (∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) → (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠)))))
1716imp 412 . . . . 5 (((𝜑 ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠))))
1813adantr 486 . . . . . . 7 (((𝜑 ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 )) → 𝐹 ∈ (𝐵 ↑m ℕ0))
19 fz0ssnn0 13795 . . . . . . 7 (0...𝑠) ⊆ ℕ0
20 elmapssres 8931 . . . . . . 7 ((𝐹 ∈ (𝐵 ↑m ℕ0) ∧ (0...𝑠) ⊆ ℕ0) → (𝐹 ↾ (0...𝑠)) ∈ (𝐵 ↑m (0...𝑠)))
2118, 19, 20sylancl 598 . . . . . 6 (((𝜑 ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 )) → (𝐹 ↾ (0...𝑠)) ∈ (𝐵 ↑m (0...𝑠)))
22 eqeq1 2770 . . . . . . . 8 (𝑓 = (𝐹 ↾ (0...𝑠)) → (𝑓 = (𝐹 ↾ (0...𝑠)) ↔ (𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠))))
23 oveq2 7458 . . . . . . . . 9 (𝑓 = (𝐹 ↾ (0...𝑠)) → (𝐺 Σg 𝑓) = (𝐺 Σg (𝐹 ↾ (0...𝑠))))
2423eqeq2d 2777 . . . . . . . 8 (𝑓 = (𝐹 ↾ (0...𝑠)) → ((𝐺 Σg 𝐹) = (𝐺 Σg 𝑓) ↔ (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠)))))
2522, 243anbi13d 1469 . . . . . . 7 (𝑓 = (𝐹 ↾ (0...𝑠)) → ((𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓)) ↔ ((𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠))))))
2625adantl 487 . . . . . 6 ((((𝜑 ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 )) ∧ 𝑓 = (𝐹 ↾ (0...𝑠))) → ((𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓)) ↔ ((𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠))))))
2721, 26rspcedv 3572 . . . . 5 (((𝜑 ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 )) → (((𝐹 ↾ (0...𝑠)) = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg (𝐹 ↾ (0...𝑠)))) → ∃𝑓 ∈ (𝐵 ↑m (0...𝑠))(𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓))))
288, 9, 17, 27mp3and 1496 . . . 4 (((𝜑 ∧ 𝑠 ∈ ℕ0) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 )) → ∃𝑓 ∈ (𝐵 ↑m (0...𝑠))(𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓)))
2928ex 418 . . 3 ((𝜑 ∧ 𝑠 ∈ ℕ0) → (∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) → ∃𝑓 ∈ (𝐵 ↑m (0...𝑠))(𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓))))
3029reximdva 3182 . 2 (𝜑 → (∃𝑠 ∈ ℕ0 ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) → ∃𝑠 ∈ ℕ0 ∃𝑓 ∈ (𝐵 ↑m (0...𝑠))(𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓))))
317, 30mpd 16 1 (𝜑 → ∃𝑠 ∈ ℕ0 ∃𝑓 ∈ (𝐵 ↑m (0...𝑠))(𝑓 = (𝐹 ↾ (0...𝑠)) ∧ ∀𝑥 ∈ ℕ0 (𝑠 < 𝑥 → (𝐹‘𝑥) = 0 ) ∧ (𝐺 Σg 𝐹) = (𝐺 Σg 𝑓)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  ∀wral 3083  ∃wrex 3093  Vcvv 3453   ⊆ wss 3899   class class class wbr 5107   ↾ cres 5659  ‘cfv 6565  (class class class)co 7450   ↑m cmap 8884   finSupp cfsupp 9390  0cc0 11238   < clt 11381  ℕ0cn0 12645  ...cfz 13678  Basecbs 17433  0gc0g 17662   Σg cgsu 17663  CMndccmn 20047
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-se 5611  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-isom 6574  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-supp 8214  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-er 8754  df-map 8886  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-fsupp 9391  df-oi 9540  df-card 10056  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-n0 12646  df-z 12733  df-uz 13005  df-fz 13679  df-fzo 13828  df-seq 14184  df-hash 14515  df-0g 17664  df-gsum 17665  df-mgm 18868  df-sgrp 18960  df-mnd 18976  df-cntz 19584  df-cmn 20049
This theorem is used by:  nn0gsumfz0  20252
  Copyright terms: Public domain W3C validator