Theorem mplval 21967

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.

Step	Hyp	Ref	Expression
1		mplval.p	. 2 ⊢ 𝑃 = (𝐼 mPoly 𝑅)
2		ovexd 7402	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) ∈ V)
3		id 22	. . . . . . . 8 ⊢ (𝑠 = (𝑖 mPwSer 𝑟) → 𝑠 = (𝑖 mPwSer 𝑟))
4		oveq12 7376	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) = (𝐼 mPwSer 𝑅))
5	3, 4	sylan9eqr 2793	. . . . . . 7 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = (𝐼 mPwSer 𝑅))
6		mplval.s	. . . . . . 7 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
7	5, 6	eqtr4di 2789	. . . . . 6 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = 𝑆)
8	7	fveq2d 6844	. . . . . . . . 9 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = (Base‘𝑆))
9		mplval.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑆)
10	8, 9	eqtr4di 2789	. . . . . . . 8 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = 𝐵)
11		simplr 769	. . . . . . . . . . 11 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑟 = 𝑅)
12	11	fveq2d 6844	. . . . . . . . . 10 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = (0g‘𝑅))
13		mplval.z	. . . . . . . . . 10 ⊢ 0 = (0g‘𝑅)
14	12, 13	eqtr4di 2789	. . . . . . . . 9 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = 0 )
15	14	breq2d 5097	. . . . . . . 8 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑓 finSupp (0g‘𝑟) ↔ 𝑓 finSupp 0 ))
16	10, 15	rabeqbidv 3407	. . . . . . 7 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 })
17		mplval.u	. . . . . . 7 ⊢ 𝑈 = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 }
18	16, 17	eqtr4di 2789	. . . . . 6 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = 𝑈)
19	7, 18	oveq12d 7385	. . . . 5 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
20	2, 19	csbied 3873	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
21		df-mpl 21891	. . . 4 ⊢ mPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}))
22		ovex 7400	. . . 4 ⊢ (𝑆 ↾s 𝑈) ∈ V
23	20, 21, 22	ovmpoa 7522	. . 3 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
24		reldmmpl 21966	. . . . . 6 ⊢ Rel dom mPoly
25	24	ovprc 7405	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = ∅)
26		ress0 17213	. . . . 5 ⊢ (∅ ↾s 𝑈) = ∅
27	25, 26	eqtr4di 2789	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (∅ ↾s 𝑈))
28		reldmpsr 21894	. . . . . . 7 ⊢ Rel dom mPwSer
29	28	ovprc 7405	. . . . . 6 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPwSer 𝑅) = ∅)
30	6, 29	eqtrid 2783	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝑆 = ∅)
31	30	oveq1d 7382	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝑆 ↾s 𝑈) = (∅ ↾s 𝑈))
32	27, 31	eqtr4d 2774	. . 3 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
33	23, 32	pm2.61i 182	. 2 ⊢ (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈)
34	1, 33	eqtri 2759	1 ⊢ 𝑃 = (𝑆 ↾s 𝑈)

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {crab 3389  Vcvv 3429  ⦋csb 3837  ∅c0 4273   class class class wbr 5085  ‘cfv 6498  (class class class)co 7367   finSupp cfsupp 9274  Basecbs 17179   ↾_s cress 17200  0_gc0g 17402   mPwSer cmps 21884   mPoly cmpl 21886

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-1cn 11096  ax-addcl 11098

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-nn 12175  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-psr 21889  df-mpl 21891

This theorem is referenced by:  mplbas  21968  mplval2  21974