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

Theorem psrgrp 14832
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 2232 . . . 4 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin} = {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}
3 fnmap 6888 . . . . 5 𝑚 Fn (V × V)
4 nn0ex 9501 . . . . 5 0 ∈ V
5 psrgrp.i . . . . . 6 (𝜑𝐼𝑉)
65elexd 2826 . . . . 5 (𝜑𝐼 ∈ V)
7 fnovex 6082 . . . . 5 (( ↑𝑚 Fn (V × V) ∧ ℕ0 ∈ V ∧ 𝐼 ∈ V) → (ℕ0𝑚 𝐼) ∈ V)
83, 4, 6, 7mp3an12i 1378 . . . 4 (𝜑 → (ℕ0𝑚 𝐼) ∈ V)
92, 8rabexd 4256 . . 3 (𝜑 → {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin} ∈ V)
10 eqid 2232 . . . 4 (𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) = (𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})
1110pwsgrp 13816 . . 3 ((𝑅 ∈ Grp ∧ {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin} ∈ V) → (𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∈ Grp)
121, 9, 11syl2anc 411 . 2 (𝜑 → (𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∈ Grp)
13 eqid 2232 . . . . 5 (Base‘𝑅) = (Base‘𝑅)
1410, 13pwsbas 13497 . . . 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 2232 . . . . 5 (Base‘𝑆) = (Base‘𝑆)
1816, 13, 2, 17, 5, 1psrbasg 14821 . . . 4 (𝜑 → (Base‘𝑆) = ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))
1918eqcomd 2238 . . 3 (𝜑 → ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) = (Base‘𝑆))
20 eqid 2232 . . . . 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 2302 . . . . . . 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 2302 . . . . . . 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 2232 . . . . 5 (+g𝑅) = (+g𝑅)
30 eqid 2232 . . . . 5 (+g‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})) = (+g‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))
3110, 20, 21, 22, 25, 28, 29, 30pwsplusgval 13500 . . . 4 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → (𝑥(+g‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))𝑦) = (𝑥𝑓 (+g𝑅)𝑦))
32 eqid 2232 . . . . 5 (+g𝑆) = (+g𝑆)
3318eleq2d 2302 . . . . . . 7 (𝜑 → (𝑥 ∈ (Base‘𝑆) ↔ 𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})))
3433biimpar 297 . . . . . 6 ((𝜑𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin})) → 𝑥 ∈ (Base‘𝑆))
3534adantrr 479 . . . . 5 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → 𝑥 ∈ (Base‘𝑆))
3618eleq2d 2302 . . . . . . 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 14826 . . . 4 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → (𝑥(+g𝑆)𝑦) = (𝑥𝑓 (+g𝑅)𝑦))
4031, 39eqtr4d 2268 . . 3 ((𝜑 ∧ (𝑥 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}) ∧ 𝑦 ∈ ((Base‘𝑅) ↑𝑚 {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))) → (𝑥(+g‘(𝑅s {𝑓 ∈ (ℕ0𝑚 𝐼) ∣ (𝑓 “ ℕ) ∈ Fin}))𝑦) = (𝑥(+g𝑆)𝑦))
4115, 19, 40grppropd 13722 . 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 2203  {crab 2524  Vcvv 2812   × cxp 4746  ccnv 4747  cima 4751   Fn wfn 5346  cfv 5351  (class class class)co 6049  𝑓 cof 6263  𝑚 cmap 6881  Fincfn 6974  cn 9236  0cn0 9495  Basecbs 13204  +gcplusg 13282  s cpws 13471  Grpcgrp 13705   mPwSer cmps 14801
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8217  ax-resscn 8218  ax-1cn 8219  ax-1re 8220  ax-icn 8221  ax-addcl 8222  ax-addrcl 8223  ax-mulcl 8224  ax-addcom 8226  ax-mulcom 8227  ax-addass 8228  ax-mulass 8229  ax-distr 8230  ax-i2m1 8231  ax-0lt1 8232  ax-1rid 8233  ax-0id 8234  ax-rnegex 8235  ax-cnre 8237  ax-pre-ltirr 8238  ax-pre-ltwlin 8239  ax-pre-lttrn 8240  ax-pre-apti 8241  ax-pre-ltadd 8242
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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-tp 3696  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-of 6265  df-1st 6333  df-2nd 6334  df-map 6883  df-ixp 6933  df-sup 7274  df-pnf 8309  df-mnf 8310  df-xr 8311  df-ltxr 8312  df-le 8313  df-sub 8445  df-neg 8446  df-inn 9237  df-2 9295  df-3 9296  df-4 9297  df-5 9298  df-6 9299  df-7 9300  df-8 9301  df-9 9302  df-n0 9496  df-z 9577  df-dec 9709  df-uz 9853  df-fz 10342  df-struct 13206  df-ndx 13207  df-slot 13208  df-base 13210  df-plusg 13295  df-mulr 13296  df-sca 13298  df-vsca 13299  df-ip 13300  df-tset 13301  df-ple 13302  df-ds 13304  df-hom 13306  df-cco 13307  df-rest 13446  df-topn 13447  df-0g 13463  df-topgen 13465  df-pt 13466  df-prds 13472  df-pws 13495  df-mgm 13561  df-sgrp 13607  df-mnd 13622  df-grp 13708  df-minusg 13709  df-psr 14803
This theorem is referenced by:  psr0  14833  psrneg  14834  mplsubgfi  14848
  Copyright terms: Public domain W3C validator