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

Theorem ply1val 22567
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 6916 . . . . . 6 (𝑟 = 𝑅 → (PwSer1‘𝑟) = (PwSer1‘𝑅))
3 ply1val.2 . . . . . 6 𝑆 = (PwSer1‘𝑅)
42, 3eqtr4di 2816 . . . . 5 (𝑟 = 𝑅 → (PwSer1‘𝑟) = 𝑆)
5 oveq2 7459 . . . . . 6 (𝑟 = 𝑅 → (1o mPoly 𝑟) = (1o mPoly 𝑅))
65fveq2d 6920 . . . . 5 (𝑟 = 𝑅 → (Base‘(1o mPoly 𝑟)) = (Base‘(1o mPoly 𝑅)))
74, 6oveq12d 7469 . . . 4 (𝑟 = 𝑅 → ((PwSer1‘𝑟) ↾s (Base‘(1o mPoly 𝑟))) = (𝑆 ↾s (Base‘(1o mPoly 𝑅))))
8 df-ply1 22555 . . . 4 Poly1 = (𝑟 ∈ V ↦ ((PwSer1‘𝑟) ↾s (Base‘(1o mPoly 𝑟))))
9 ovex 7484 . . . 4 (𝑆 ↾s (Base‘(1o mPoly 𝑅))) ∈ V
107, 8, 9fvmpt 7024 . . 3 (𝑅 ∈ V → (Poly1‘𝑅) = (𝑆 ↾s (Base‘(1o mPoly 𝑅))))
11 fvprc 6908 . . . . 5 (¬ 𝑅 ∈ V → (Poly1‘𝑅) = ∅)
12 ress0 17465 . . . . 5 (∅ ↾s (Base‘(1o mPoly 𝑅))) = ∅
1311, 12eqtr4di 2816 . . . 4 (¬ 𝑅 ∈ V → (Poly1‘𝑅) = (∅ ↾s (Base‘(1o mPoly 𝑅))))
14 fvprc 6908 . . . . . 6 (¬ 𝑅 ∈ V → (PwSer1‘𝑅) = ∅)
153, 14eqtrid 2810 . . . . 5 (¬ 𝑅 ∈ V → 𝑆 = ∅)
1615oveq1d 7466 . . . 4 (¬ 𝑅 ∈ V → (𝑆 ↾s (Base‘(1o mPoly 𝑅))) = (∅ ↾s (Base‘(1o mPoly 𝑅))))
1713, 16eqtr4d 2801 . . 3 (¬ 𝑅 ∈ V → (Poly1‘𝑅) = (𝑆 ↾s (Base‘(1o mPoly 𝑅))))
1810, 17pm2.61i 184 . 2 (Poly1‘𝑅) = (𝑆 ↾s (Base‘(1o mPoly 𝑅)))
191, 18eqtri 2786 1 𝑃 = (𝑆 ↾s (Base‘(1o mPoly 𝑅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ∅c0 4281  ‘cfv 6566  (class class class)co 7451  1oc1o 8507  Basecbs 17431   ↾s cress 17452   mPoly cmpl 22269  PwSer1cps1 22548  Poly1cpl1 22550
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-1cn 11297  ax-addcl 11299
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-nn 12376  df-slot 17404  df-ndx 17416  df-base 17432  df-ress 17453  df-ply1 22555
This theorem is used by:  ply1bas  22568  ply1crng  22571  ply1assa  22572  ply1bascl  22576  ply1plusg  22596  ply1vsca  22597  ply1mulr  22598  ply1ring  22620  ply1lmod  22624  ply1sca  22625
  Copyright terms: Public domain W3C validator