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

Theorem mplval 22329
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 7481 . . . . 5 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) ∈ V)
3 id 23 . . . . . . . 8 (𝑠 = (𝑖 mPwSer 𝑟) → 𝑠 = (𝑖 mPwSer 𝑟))
4 oveq12 7455 . . . . . . . 8 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) = (𝐼 mPwSer 𝑅))
53, 4sylan9eqr 2820 . . . . . . 7 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = (𝐼 mPwSer 𝑅))
6 mplval.s . . . . . . 7 𝑆 = (𝐼 mPwSer 𝑅)
75, 6eqtr4di 2816 . . . . . 6 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = 𝑆)
87fveq2d 6915 . . . . . . . . 9 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = (Base‘𝑆))
9 mplval.b . . . . . . . . 9 𝐵 = (Base‘𝑆)
108, 9eqtr4di 2816 . . . . . . . 8 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = 𝐵)
11 simplr 781 . . . . . . . . . . 11 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑟 = 𝑅)
1211fveq2d 6915 . . . . . . . . . 10 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = (0g‘𝑅))
13 mplval.z . . . . . . . . . 10 0 = (0g‘𝑅)
1412, 13eqtr4di 2816 . . . . . . . . 9 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = 0 )
1514breq2d 5118 . . . . . . . 8 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑓 finSupp (0g‘𝑟) ↔ 𝑓 finSupp 0 ))
1610, 15rabeqbidv 3433 . . . . . . 7 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 })
17 mplval.u . . . . . . 7 𝑈 = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 }
1816, 17eqtr4di 2816 . . . . . 6 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = 𝑈)
197, 18oveq12d 7464 . . . . 5 (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
202, 19csbied 3887 . . . 4 ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
21 df-mpl 22252 . . . 4 mPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}))
22 ovex 7479 . . . 4 (𝑆 ↾s 𝑈) ∈ V
2320, 21, 22ovmpoa 7602 . . 3 ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
24 reldmmpl 22328 . . . . . 6 Rel dom mPoly
2524ovprc 7484 . . . . 5 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = ∅)
26 ress0 17453 . . . . 5 (∅ ↾s 𝑈) = ∅
2725, 26eqtr4di 2816 . . . 4 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (∅ ↾s 𝑈))
28 reldmpsr 22255 . . . . . . 7 Rel dom mPwSer
2928ovprc 7484 . . . . . 6 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPwSer 𝑅) = ∅)
306, 29eqtrid 2810 . . . . 5 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝑆 = ∅)
3130oveq1d 7461 . . . 4 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝑆 ↾s 𝑈) = (∅ ↾s 𝑈))
3227, 31eqtr4d 2801 . . 3 (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
3323, 32pm2.61i 184 . 2 (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈)
341, 33eqtri 2786 1 𝑃 = (𝑆 ↾s 𝑈)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  ⦋csb 3851  ∅c0 4281   class class class wbr 5106  ‘cfv 6561  (class class class)co 7446   finSupp cfsupp 9384  Basecbs 17419   ↾s cress 17440  0gc0g 17642   mPwSer cmps 22245   mPoly cmpl 22247
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 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778  ax-cnex 11286  ax-1cn 11288  ax-addcl 11290
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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-om 7905  df-2nd 8029  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449  df-nn 12366  df-slot 17392  df-ndx 17404  df-base 17420  df-ress 17441  df-psr 22250  df-mpl 22252
This theorem is used by:  mplbas  22330  mplval2  22336  mplnzr  34228
  Copyright terms: Public domain W3C validator