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

Theorem mplval 22301
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 7455 . . . . 5 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) ∈ V)
3 id 23 . . . . . . . 8 (𝑠 = (𝑖 mPwSer 𝑟) → 𝑠 = (𝑖 mPwSer 𝑟))
4 oveq12 7429 . . . . . . . 8 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) = (𝐼 mPwSer 𝑅))
53, 4sylan9eqr 2817 . . . . . . 7 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = (𝐼 mPwSer 𝑅))
6 mplval.s . . . . . . 7 𝑆 = (𝐼 mPwSer 𝑅)
75, 6eqtr4di 2813 . . . . . 6 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = 𝑆)
87fveq2d 6889 . . . . . . . . 9 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = (Base‘𝑆))
9 mplval.b . . . . . . . . 9 𝐵 = (Base‘𝑆)
108, 9eqtr4di 2813 . . . . . . . 8 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = 𝐵)
11 simplr 781 . . . . . . . . . . 11 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑟 = 𝑅)
1211fveq2d 6889 . . . . . . . . . 10 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = (0g‘𝑅))
13 mplval.z . . . . . . . . . 10 0 = (0g‘𝑅)
1412, 13eqtr4di 2813 . . . . . . . . 9 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = 0 )
1514breq2d 5114 . . . . . . . 8 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑓 finSupp (0g‘𝑟) ↔ 𝑓 finSupp 0 ))
1610, 15rabeqbidv 3429 . . . . . . 7 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 })
17 mplval.u . . . . . . 7 𝑈 = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 }
1816, 17eqtr4di 2813 . . . . . 6 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = 𝑈)
197, 18oveq12d 7438 . . . . 5 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
202, 19csbied 3882 . . . 4 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
21 df-mpl 22224 . . . 4 mPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}))
22 ovex 7453 . . . 4 (𝑆 ↾s 𝑈) ∈ V
2320, 21, 22ovmpoa 7575 . . 3 ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
24 reldmmpl 22300 . . . . . 6 Rel dom mPoly
2524ovprc 7458 . . . . 5 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = ∅)
26 ress0 17426 . . . . 5 (∅ ↾s 𝑈) = ∅
2725, 26eqtr4di 2813 . . . 4 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (∅ ↾s 𝑈))
28 reldmpsr 22227 . . . . . . 7 Rel dom mPwSer
2928ovprc 7458 . . . . . 6 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPwSer 𝑅) = ∅)
306, 29eqtrid 2807 . . . . 5 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝑆 = ∅)
3130oveq1d 7435 . . . 4 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝑆 ↾s 𝑈) = (∅ ↾s 𝑈))
3227, 31eqtr4d 2798 . . 3 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
3323, 32pm2.61i 184 . 2 (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈)
341, 33eqtri 2783 1 𝑃 = (𝑆 ↾s 𝑈)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450  ⦋csb 3846  ∅c0 4278   class class class wbr 5102  ‘cfv 6538  (class class class)co 7420   finSupp cfsupp 9356  Basecbs 17392   ↾s cress 17413  0gc0g 17615   mPwSer cmps 22217   mPoly cmpl 22219
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11259  ax-1cn 11261  ax-addcl 11263
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-nn 12339  df-slot 17365  df-ndx 17377  df-base 17393  df-ress 17414  df-psr 22222  df-mpl 22224
This theorem is used by:  mplbas  22302  mplval2  22308  mplnzr  34191
  Copyright terms: Public domain W3C validator