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

Theorem psrsca 20161
Description: The scalar field of the multivariate power series structure. (Contributed by Mario Carneiro, 28-Dec-2014.)
Hypotheses
Ref Expression
psrsca.s 𝑆 = (𝐼 mPwSer 𝑅)
psrsca.i (𝜑𝐼𝑉)
psrsca.r (𝜑𝑅𝑊)
Assertion
Ref Expression
psrsca (𝜑𝑅 = (Scalar‘𝑆))

Proof of Theorem psrsca
Dummy variables 𝑓 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 psrsca.r . . 3 (𝜑𝑅𝑊)
2 psrvalstr 20135 . . . 4 ({⟨(Base‘ndx), (Base‘𝑆)⟩, ⟨(+g‘ndx), (+g𝑆)⟩, ⟨(.r‘ndx), (.r𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ (Base‘𝑆) ↦ (({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {𝑥}) ∘f (.r𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩}) Struct ⟨1, 9⟩
3 scaid 16625 . . . 4 Scalar = Slot (Scalar‘ndx)
4 snsstp1 4741 . . . . 5 {⟨(Scalar‘ndx), 𝑅⟩} ⊆ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ (Base‘𝑆) ↦ (({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {𝑥}) ∘f (.r𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩}
5 ssun2 4147 . . . . 5 {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ (Base‘𝑆) ↦ (({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {𝑥}) ∘f (.r𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩} ⊆ ({⟨(Base‘ndx), (Base‘𝑆)⟩, ⟨(+g‘ndx), (+g𝑆)⟩, ⟨(.r‘ndx), (.r𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ (Base‘𝑆) ↦ (({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {𝑥}) ∘f (.r𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩})
64, 5sstri 3974 . . . 4 {⟨(Scalar‘ndx), 𝑅⟩} ⊆ ({⟨(Base‘ndx), (Base‘𝑆)⟩, ⟨(+g‘ndx), (+g𝑆)⟩, ⟨(.r‘ndx), (.r𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ (Base‘𝑆) ↦ (({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {𝑥}) ∘f (.r𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩})
72, 3, 6strfv 16523 . . 3 (𝑅𝑊𝑅 = (Scalar‘({⟨(Base‘ndx), (Base‘𝑆)⟩, ⟨(+g‘ndx), (+g𝑆)⟩, ⟨(.r‘ndx), (.r𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ (Base‘𝑆) ↦ (({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {𝑥}) ∘f (.r𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩})))
81, 7syl 17 . 2 (𝜑𝑅 = (Scalar‘({⟨(Base‘ndx), (Base‘𝑆)⟩, ⟨(+g‘ndx), (+g𝑆)⟩, ⟨(.r‘ndx), (.r𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ (Base‘𝑆) ↦ (({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {𝑥}) ∘f (.r𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩})))
9 psrsca.s . . . 4 𝑆 = (𝐼 mPwSer 𝑅)
10 eqid 2819 . . . 4 (Base‘𝑅) = (Base‘𝑅)
11 eqid 2819 . . . 4 (+g𝑅) = (+g𝑅)
12 eqid 2819 . . . 4 (.r𝑅) = (.r𝑅)
13 eqid 2819 . . . 4 (TopOpen‘𝑅) = (TopOpen‘𝑅)
14 eqid 2819 . . . 4 { ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} = { ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin}
15 eqid 2819 . . . . 5 (Base‘𝑆) = (Base‘𝑆)
16 psrsca.i . . . . 5 (𝜑𝐼𝑉)
179, 10, 14, 15, 16psrbas 20150 . . . 4 (𝜑 → (Base‘𝑆) = ((Base‘𝑅) ↑m { ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin}))
18 eqid 2819 . . . . 5 (+g𝑆) = (+g𝑆)
199, 15, 11, 18psrplusg 20153 . . . 4 (+g𝑆) = ( ∘f (+g𝑅) ↾ ((Base‘𝑆) × (Base‘𝑆)))
20 eqid 2819 . . . . 5 (.r𝑆) = (.r𝑆)
219, 15, 12, 20, 14psrmulr 20156 . . . 4 (.r𝑆) = (𝑓 ∈ (Base‘𝑆), 𝑧 ∈ (Base‘𝑆) ↦ (𝑤 ∈ { ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} ↦ (𝑅 Σg (𝑥 ∈ {𝑦 ∈ { ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} ∣ 𝑦r𝑤} ↦ ((𝑓𝑥)(.r𝑅)(𝑧‘(𝑤f𝑥)))))))
22 eqid 2819 . . . 4 (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ (Base‘𝑆) ↦ (({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {𝑥}) ∘f (.r𝑅)𝑓)) = (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ (Base‘𝑆) ↦ (({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {𝑥}) ∘f (.r𝑅)𝑓))
23 eqidd 2820 . . . 4 (𝜑 → (∏t‘({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)})) = (∏t‘({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)})))
249, 10, 11, 12, 13, 14, 17, 19, 21, 22, 23, 16, 1psrval 20134 . . 3 (𝜑𝑆 = ({⟨(Base‘ndx), (Base‘𝑆)⟩, ⟨(+g‘ndx), (+g𝑆)⟩, ⟨(.r‘ndx), (.r𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ (Base‘𝑆) ↦ (({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {𝑥}) ∘f (.r𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩}))
2524fveq2d 6667 . 2 (𝜑 → (Scalar‘𝑆) = (Scalar‘({⟨(Base‘ndx), (Base‘𝑆)⟩, ⟨(+g‘ndx), (+g𝑆)⟩, ⟨(.r‘ndx), (.r𝑆)⟩} ∪ {⟨(Scalar‘ndx), 𝑅⟩, ⟨( ·𝑠 ‘ndx), (𝑥 ∈ (Base‘𝑅), 𝑓 ∈ (Base‘𝑆) ↦ (({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {𝑥}) ∘f (.r𝑅)𝑓))⟩, ⟨(TopSet‘ndx), (∏t‘({ ∈ (ℕ0m 𝐼) ∣ ( “ ℕ) ∈ Fin} × {(TopOpen‘𝑅)}))⟩})))
268, 25eqtr4d 2857 1 (𝜑𝑅 = (Scalar‘𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1531  wcel 2108  {crab 3140  cun 3932  {csn 4559  {ctp 4563  cop 4565   × cxp 5546  ccnv 5547  cima 5551  cfv 6348  (class class class)co 7148  cmpo 7150  f cof 7399  m cmap 8398  Fincfn 8501  1c1 10530  cn 11630  9c9 11691  0cn0 11889  ndxcnx 16472  Basecbs 16475  +gcplusg 16557  .rcmulr 16558  Scalarcsca 16560   ·𝑠 cvsca 16561  TopSetcts 16563  TopOpenctopn 16687  tcpt 16704   mPwSer cmps 20123
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453  ax-cnex 10585  ax-resscn 10586  ax-1cn 10587  ax-icn 10588  ax-addcl 10589  ax-addrcl 10590  ax-mulcl 10591  ax-mulrcl 10592  ax-mulcom 10593  ax-addass 10594  ax-mulass 10595  ax-distr 10596  ax-i2m1 10597  ax-1ne0 10598  ax-1rid 10599  ax-rnegex 10600  ax-rrecex 10601  ax-cnre 10602  ax-pre-lttri 10603  ax-pre-lttrn 10604  ax-pre-ltadd 10605  ax-pre-mulgt0 10606
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1083  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-nel 3122  df-ral 3141  df-rex 3142  df-reu 3143  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-int 4868  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-of 7401  df-om 7573  df-1st 7681  df-2nd 7682  df-supp 7823  df-wrecs 7939  df-recs 8000  df-rdg 8038  df-1o 8094  df-oadd 8098  df-er 8281  df-map 8400  df-en 8502  df-dom 8503  df-sdom 8504  df-fin 8505  df-fsupp 8826  df-pnf 10669  df-mnf 10670  df-xr 10671  df-ltxr 10672  df-le 10673  df-sub 10864  df-neg 10865  df-nn 11631  df-2 11692  df-3 11693  df-4 11694  df-5 11695  df-6 11696  df-7 11697  df-8 11698  df-9 11699  df-n0 11890  df-z 11974  df-uz 12236  df-fz 12885  df-struct 16477  df-ndx 16478  df-slot 16479  df-base 16481  df-plusg 16570  df-mulr 16571  df-sca 16573  df-vsca 16574  df-tset 16576  df-psr 20128
This theorem is referenced by:  psrlmod  20173  psrassa  20186  mpllsslem  20207  mplsca  20217  opsrsca  20255  opsrassa  20261  ply1lss  20356  opsrlmod  20406
  Copyright terms: Public domain W3C validator