ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  psrgrp GIF version

Theorem psrgrp 14952
Description: The ring of power series is a group. (Contributed by Mario Carneiro, 29-Dec-2014.) (Proof shortened by SN, 7-Feb-2025.)
Hypotheses
Ref Expression
psrgrp.s 𝑆 = (𝐼 mPwSer 𝑅)
psrgrp.i (𝜑𝐼𝑉)
psrgrp.r (𝜑𝑅 ∈ Grp)
Assertion
Ref Expression
psrgrp (𝜑𝑆 ∈ Grp)

Proof of Theorem psrgrp
Dummy variables 𝑥 𝑦 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 psrgrp.r . . 3 (𝜑𝑅 ∈ Grp)
2 eqid 2234 . . . 4 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin} = {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}
3 fnmap 6902 . . . . 5 𝑚 Fn (V × V)
4 nn0ex 9519 . . . . 5 0 ∈ V
5 psrgrp.i . . . . . 6 (𝜑𝐼𝑉)
65elexd 2829 . . . . 5 (𝜑𝐼 ∈ V)
7 fnovex 6091 . . . . 5 (( ↑𝑚 Fn (V × V) ∧ ℕ0 ∈ V ∧ 𝐼 ∈ V) → (ℕ0𝑚 𝐼) ∈ V)
83, 4, 6, 7mp3an12i 1378 . . . 4 (𝜑 → (ℕ0𝑚 𝐼) ∈ V)
92, 8rabexd 4262 . . 3 (𝜑 → {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin} ∈ V)
10 eqid 2234 . . . 4 (𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) = (𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})
1110pwsgrp 13908 . . 3 ((𝑅 ∈ Grp ∧ {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin} ∈ V) → (𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∈ Grp)
121, 9, 11syl2anc 411 . 2 (𝜑 → (𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∈ Grp)
13 eqid 2234 . . . . 5 (Base‘𝑅) = (Base‘𝑅)
1410, 13pwsbas 13589 . . . 4 ((𝑅 ∈ Grp ∧ {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin} ∈ V) → ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) = (Base‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})))
151, 9, 14syl2anc 411 . . 3 (𝜑 → ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) = (Base‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})))
16 psrgrp.s . . . . 5 𝑆 = (𝐼 mPwSer 𝑅)
17 eqid 2234 . . . . 5 (Base‘𝑆) = (Base‘𝑆)
1816, 13, 2, 17, 5, 1psrbasg 14941 . . . 4 (𝜑 → (Base‘𝑆) = ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))
1918eqcomd 2240 . . 3 (𝜑 → ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) = (Base‘𝑆))
20 eqid 2234 . . . . 5 (Base‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})) = (Base‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))
211adantr 276 . . . . 5 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → 𝑅 ∈ Grp)
229adantr 276 . . . . 5 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin} ∈ V)
2315eleq2d 2304 . . . . . . 7 (𝜑 → (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ↔ 𝑥 ∈ (Base‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))))
2423biimpa 296 . . . . . 6 ((𝜑𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})) → 𝑥 ∈ (Base‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})))
2524adantrr 479 . . . . 5 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → 𝑥 ∈ (Base‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})))
2615eleq2d 2304 . . . . . . 7 (𝜑 → (𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ↔ 𝑦 ∈ (Base‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))))
2726biimpa 296 . . . . . 6 ((𝜑𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})) → 𝑦 ∈ (Base‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})))
2827adantrl 478 . . . . 5 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → 𝑦 ∈ (Base‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})))
29 eqid 2234 . . . . 5 (+g𝑅) = (+g𝑅)
30 eqid 2234 . . . . 5 (+g‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})) = (+g‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))
3110, 20, 21, 22, 25, 28, 29, 30pwsplusgval 13592 . . . 4 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → (𝑥(+g‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))𝑦) = (𝑥𝑓 (+g𝑅)𝑦))
32 eqid 2234 . . . . 5 (+g𝑆) = (+g𝑆)
3318eleq2d 2304 . . . . . . 7 (𝜑 → (𝑥 ∈ (Base‘𝑆) ↔ 𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})))
3433biimpar 297 . . . . . 6 ((𝜑𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})) → 𝑥 ∈ (Base‘𝑆))
3534adantrr 479 . . . . 5 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → 𝑥 ∈ (Base‘𝑆))
3618eleq2d 2304 . . . . . . 7 (𝜑 → (𝑦 ∈ (Base‘𝑆) ↔ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})))
3736biimpar 297 . . . . . 6 ((𝜑𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})) → 𝑦 ∈ (Base‘𝑆))
3837adantrl 478 . . . . 5 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → 𝑦 ∈ (Base‘𝑆))
3916, 17, 29, 32, 35, 38psradd 14946 . . . 4 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → (𝑥(+g𝑆)𝑦) = (𝑥𝑓 (+g𝑅)𝑦))
4031, 39eqtr4d 2270 . . 3 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → (𝑥(+g‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))𝑦) = (𝑥(+g𝑆)𝑦))
4115, 19, 40grppropd 13814 . 2 (𝜑 → ((𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∈ Grp ↔ 𝑆 ∈ Grp))
4212, 41mpbid 147 1 (𝜑𝑆 ∈ Grp)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2205  {crab 2526  Vcvv 2815   × cxp 4752  ccnv 4753  cima 4757   Fn wfn 5352  cfv 5357  (class class class)co 6058  𝑓 cof 6273  𝑚 cmap 6895  Fincfn 6988  cn 9254  0cn0 9513  Basecbs 13296  +gcplusg 13374  s cpws 13563  Grpcgrp 13797   mPwSer cmps 14921
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-tp 3702  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-of 6275  df-1st 6347  df-2nd 6348  df-map 6897  df-ixp 6947  df-sup 7288  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-7 9318  df-8 9319  df-9 9320  df-n0 9514  df-z 9595  df-dec 9728  df-uz 9872  df-fz 10362  df-struct 13298  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-mulr 13388  df-sca 13390  df-vsca 13391  df-ip 13392  df-tset 13393  df-ple 13394  df-ds 13396  df-hom 13398  df-cco 13399  df-rest 13538  df-topn 13539  df-0g 13555  df-topgen 13557  df-pt 13558  df-prds 13564  df-pws 13587  df-mgm 13653  df-sgrp 13699  df-mnd 13714  df-grp 13800  df-minusg 13801  df-psr 14923
This theorem is referenced by:  psr0  14953  psrneg  14954  mplsubgfi  14968
  Copyright terms: Public domain W3C validator