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

Theorem ply1val 22406
Description: The value of the set of univariate polynomials. (Contributed by Mario Carneiro, 9-Feb-2015.)
Hypotheses
Ref Expression
ply1val.1 𝑃 = (Poly1𝑅)
ply1val.2 𝑆 = (PwSer1𝑅)
Assertion
Ref Expression
ply1val 𝑃 = (𝑆s (Base‘(1o mPoly 𝑅)))

Proof of Theorem ply1val
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 ply1val.1 . 2 𝑃 = (Poly1𝑅)
2 fveq2 6885 . . . . . 6 (𝑟 = 𝑅 → (PwSer1𝑟) = (PwSer1𝑅))
3 ply1val.2 . . . . . 6 𝑆 = (PwSer1𝑅)
42, 3eqtr4di 2818 . . . . 5 (𝑟 = 𝑅 → (PwSer1𝑟) = 𝑆)
5 oveq2 7427 . . . . . 6 (𝑟 = 𝑅 → (1o mPoly 𝑟) = (1o mPoly 𝑅))
65fveq2d 6889 . . . . 5 (𝑟 = 𝑅 → (Base‘(1o mPoly 𝑟)) = (Base‘(1o mPoly 𝑅)))
74, 6oveq12d 7437 . . . 4 (𝑟 = 𝑅 → ((PwSer1𝑟) ↾s (Base‘(1o mPoly 𝑟))) = (𝑆s (Base‘(1o mPoly 𝑅))))
8 df-ply1 22394 . . . 4 Poly1 = (𝑟 ∈ V ↦ ((PwSer1𝑟) ↾s (Base‘(1o mPoly 𝑟))))
9 ovex 7452 . . . 4 (𝑆s (Base‘(1o mPoly 𝑅))) ∈ V
107, 8, 9fvmpt 6993 . . 3 (𝑅 ∈ V → (Poly1𝑅) = (𝑆s (Base‘(1o mPoly 𝑅))))
11 fvprc 6877 . . . . 5 𝑅 ∈ V → (Poly1𝑅) = ∅)
12 ress0 17327 . . . . 5 (∅ ↾s (Base‘(1o mPoly 𝑅))) = ∅
1311, 12eqtr4di 2818 . . . 4 𝑅 ∈ V → (Poly1𝑅) = (∅ ↾s (Base‘(1o mPoly 𝑅))))
14 fvprc 6877 . . . . . 6 𝑅 ∈ V → (PwSer1𝑅) = ∅)
153, 14eqtrid 2812 . . . . 5 𝑅 ∈ V → 𝑆 = ∅)
1615oveq1d 7434 . . . 4 𝑅 ∈ V → (𝑆s (Base‘(1o mPoly 𝑅))) = (∅ ↾s (Base‘(1o mPoly 𝑅))))
1713, 16eqtr4d 2803 . . 3 𝑅 ∈ V → (Poly1𝑅) = (𝑆s (Base‘(1o mPoly 𝑅))))
1810, 17pm2.61i 184 . 2 (Poly1𝑅) = (𝑆s (Base‘(1o mPoly 𝑅)))
191, 18eqtri 2788 1 𝑃 = (𝑆s (Base‘(1o mPoly 𝑅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570  wcel 2146  Vcvv 3457  c0 4286  cfv 6540  (class class class)co 7419  1oc1o 8452  Basecbs 17293  s cress 17314   mPoly cmpl 22108  PwSer1cps1 22387  Poly1cpl1 22389
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11173  ax-1cn 11175  ax-addcl 11177
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-nn 12251  df-slot 17266  df-ndx 17278  df-base 17294  df-ress 17315  df-ply1 22394
This theorem is used by:  ply1bas  22407  ply1crng  22410  ply1assa  22411  ply1bascl  22415  ply1plusg  22435  ply1vsca  22436  ply1mulr  22437  ply1ring  22459  ply1lmod  22463  ply1sca  22464
  Copyright terms: Public domain W3C validator