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

Theorem ply1val 22422
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 6879 . . . . . 6 (𝑟 = 𝑅 → (PwSer1𝑟) = (PwSer1𝑅))
3 ply1val.2 . . . . . 6 𝑆 = (PwSer1𝑅)
42, 3eqtr4di 2813 . . . . 5 (𝑟 = 𝑅 → (PwSer1𝑟) = 𝑆)
5 oveq2 7422 . . . . . 6 (𝑟 = 𝑅 → (1o mPoly 𝑟) = (1o mPoly 𝑅))
65fveq2d 6883 . . . . 5 (𝑟 = 𝑅 → (Base‘(1o mPoly 𝑟)) = (Base‘(1o mPoly 𝑅)))
74, 6oveq12d 7432 . . . 4 (𝑟 = 𝑅 → ((PwSer1𝑟) ↾s (Base‘(1o mPoly 𝑟))) = (𝑆s (Base‘(1o mPoly 𝑅))))
8 df-ply1 22410 . . . 4 Poly1 = (𝑟 ∈ V ↦ ((PwSer1𝑟) ↾s (Base‘(1o mPoly 𝑟))))
9 ovex 7447 . . . 4 (𝑆s (Base‘(1o mPoly 𝑅))) ∈ V
107, 8, 9fvmpt 6987 . . 3 (𝑅 ∈ V → (Poly1𝑅) = (𝑆s (Base‘(1o mPoly 𝑅))))
11 fvprc 6871 . . . . 5 𝑅 ∈ V → (Poly1𝑅) = ∅)
12 ress0 17338 . . . . 5 (∅ ↾s (Base‘(1o mPoly 𝑅))) = ∅
1311, 12eqtr4di 2813 . . . 4 𝑅 ∈ V → (Poly1𝑅) = (∅ ↾s (Base‘(1o mPoly 𝑅))))
14 fvprc 6871 . . . . . 6 𝑅 ∈ V → (PwSer1𝑅) = ∅)
153, 14eqtrid 2807 . . . . 5 𝑅 ∈ V → 𝑆 = ∅)
1615oveq1d 7429 . . . 4 𝑅 ∈ V → (𝑆s (Base‘(1o mPoly 𝑅))) = (∅ ↾s (Base‘(1o mPoly 𝑅))))
1713, 16eqtr4d 2798 . . 3 𝑅 ∈ V → (Poly1𝑅) = (𝑆s (Base‘(1o mPoly 𝑅))))
1810, 17pm2.61i 184 . 2 (Poly1𝑅) = (𝑆s (Base‘(1o mPoly 𝑅)))
191, 18eqtri 2783 1 𝑃 = (𝑆s (Base‘(1o mPoly 𝑅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570  wcel 2145  Vcvv 3450  c0 4279  cfv 6533  (class class class)co 7414  1oc1o 8451  Basecbs 17304  s cress 17325   mPoly cmpl 22124  PwSer1cps1 22403  Poly1cpl1 22405
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-cnex 11183  ax-1cn 11185  ax-addcl 11187
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-nn 12261  df-slot 17277  df-ndx 17289  df-base 17305  df-ress 17326  df-ply1 22410
This theorem is used by:  ply1bas  22423  ply1crng  22426  ply1assa  22427  ply1bascl  22431  ply1plusg  22451  ply1vsca  22452  ply1mulr  22453  ply1ring  22475  ply1lmod  22479  ply1sca  22480
  Copyright terms: Public domain W3C validator