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

Theorem mplval 22276
Description: Value of the set of multivariate polynomials. (Contributed by Mario Carneiro, 7-Jan-2015.) (Revised by Mario Carneiro, 2-Oct-2015.) (Revised by AV, 25-Jun-2019.)
Hypotheses
Ref Expression
mplval.p 𝑃 = (𝐼 mPoly 𝑅)
mplval.s 𝑆 = (𝐼 mPwSer 𝑅)
mplval.b 𝐵 = (Base‘𝑆)
mplval.z 0 = (0g‘𝑅)
mplval.u 𝑈 = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 }
Assertion
Ref Expression
mplval 𝑃 = (𝑆 ↾s 𝑈)
Distinct variable groups:   𝐵,𝑓   𝑓,𝐼   𝑅,𝑓   0 ,𝑓
Allowed substitution hints:   𝑃(𝑓)   𝑆(𝑓)   𝑈(𝑓)

Proof of Theorem mplval
Dummy variables 𝑖 𝑟 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mplval.p . 2 𝑃 = (𝐼 mPoly 𝑅)
2 ovexd 7447 . . . . 5 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) ∈ V)
3 id 23 . . . . . . . 8 (𝑠 = (𝑖 mPwSer 𝑟) → 𝑠 = (𝑖 mPwSer 𝑟))
4 oveq12 7421 . . . . . . . 8 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) = (𝐼 mPwSer 𝑅))
53, 4sylan9eqr 2818 . . . . . . 7 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = (𝐼 mPwSer 𝑅))
6 mplval.s . . . . . . 7 𝑆 = (𝐼 mPwSer 𝑅)
75, 6eqtr4di 2814 . . . . . 6 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = 𝑆)
87fveq2d 6881 . . . . . . . . 9 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = (Base‘𝑆))
9 mplval.b . . . . . . . . 9 𝐵 = (Base‘𝑆)
108, 9eqtr4di 2814 . . . . . . . 8 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = 𝐵)
11 simplr 781 . . . . . . . . . . 11 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑟 = 𝑅)
1211fveq2d 6881 . . . . . . . . . 10 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = (0g‘𝑅))
13 mplval.z . . . . . . . . . 10 0 = (0g‘𝑅)
1412, 13eqtr4di 2814 . . . . . . . . 9 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = 0 )
1514breq2d 5115 . . . . . . . 8 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑓 finSupp (0g‘𝑟) ↔ 𝑓 finSupp 0 ))
1610, 15rabeqbidv 3430 . . . . . . 7 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 })
17 mplval.u . . . . . . 7 𝑈 = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 }
1816, 17eqtr4di 2814 . . . . . 6 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = 𝑈)
197, 18oveq12d 7430 . . . . 5 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
202, 19csbied 3883 . . . 4 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
21 df-mpl 22199 . . . 4 mPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}))
22 ovex 7445 . . . 4 (𝑆 ↾s 𝑈) ∈ V
2320, 21, 22ovmpoa 7567 . . 3 ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
24 reldmmpl 22275 . . . . . 6 Rel dom mPoly
2524ovprc 7450 . . . . 5 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = ∅)
26 ress0 17401 . . . . 5 (∅ ↾s 𝑈) = ∅
2725, 26eqtr4di 2814 . . . 4 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (∅ ↾s 𝑈))
28 reldmpsr 22202 . . . . . . 7 Rel dom mPwSer
2928ovprc 7450 . . . . . 6 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPwSer 𝑅) = ∅)
306, 29eqtrid 2808 . . . . 5 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝑆 = ∅)
3130oveq1d 7427 . . . 4 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝑆 ↾s 𝑈) = (∅ ↾s 𝑈))
3227, 31eqtr4d 2799 . . 3 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
3323, 32pm2.61i 184 . 2 (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈)
341, 33eqtri 2784 1 𝑃 = (𝑆 ↾s 𝑈)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451  ⦋csb 3847  ∅c0 4279   class class class wbr 5103  ‘cfv 6531  (class class class)co 7412   finSupp cfsupp 9337  Basecbs 17367   ↾s cress 17388  0gc0g 17590   mPwSer cmps 22192   mPoly cmpl 22194
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 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-1cn 11239  ax-addcl 11241
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  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 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-nn 12317  df-slot 17340  df-ndx 17352  df-base 17368  df-ress 17389  df-psr 22197  df-mpl 22199
This theorem is used by:  mplbas  22277  mplval2  22283  mplnzr  34127
  Copyright terms: Public domain W3C validator