Theorem mplval 19428

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 6680	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) ∈ V)
3		id 22	. . . . . . . 8 ⊢ (𝑠 = (𝑖 mPwSer 𝑟) → 𝑠 = (𝑖 mPwSer 𝑟))
4		oveq12 6659	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) = (𝐼 mPwSer 𝑅))
5	3, 4	sylan9eqr 2678	. . . . . . 7 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = (𝐼 mPwSer 𝑅))
6		mplval.s	. . . . . . 7 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
7	5, 6	syl6eqr 2674	. . . . . 6 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = 𝑆)
8	7	fveq2d 6195	. . . . . . . . 9 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = (Base‘𝑆))
9		mplval.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑆)
10	8, 9	syl6eqr 2674	. . . . . . . 8 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = 𝐵)
11		simplr 792	. . . . . . . . . . 11 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑟 = 𝑅)
12	11	fveq2d 6195	. . . . . . . . . 10 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = (0g‘𝑅))
13		mplval.z	. . . . . . . . . 10 ⊢ 0 = (0g‘𝑅)
14	12, 13	syl6eqr 2674	. . . . . . . . 9 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = 0 )
15	14	breq2d 4665	. . . . . . . 8 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑓 finSupp (0g‘𝑟) ↔ 𝑓 finSupp 0 ))
16	10, 15	rabeqbidv 3195	. . . . . . 7 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 })
17		mplval.u	. . . . . . 7 ⊢ 𝑈 = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 }
18	16, 17	syl6eqr 2674	. . . . . 6 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = 𝑈)
19	7, 18	oveq12d 6668	. . . . 5 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
20	2, 19	csbied 3560	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
21		df-mpl 19358	. . . 4 ⊢ mPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}))
22		ovex 6678	. . . 4 ⊢ (𝑆 ↾s 𝑈) ∈ V
23	20, 21, 22	ovmpt2a 6791	. . 3 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
24		reldmmpl 19427	. . . . . 6 ⊢ Rel dom mPoly
25	24	ovprc 6683	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = ∅)
26		ress0 15934	. . . . 5 ⊢ (∅ ↾s 𝑈) = ∅
27	25, 26	syl6eqr 2674	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (∅ ↾s 𝑈))
28		reldmpsr 19361	. . . . . . 7 ⊢ Rel dom mPwSer
29	28	ovprc 6683	. . . . . 6 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPwSer 𝑅) = ∅)
30	6, 29	syl5eq 2668	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝑆 = ∅)
31	30	oveq1d 6665	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝑆 ↾s 𝑈) = (∅ ↾s 𝑈))
32	27, 31	eqtr4d 2659	. . 3 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
33	23, 32	pm2.61i 176	. 2 ⊢ (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈)
34	1, 33	eqtri 2644	1 ⊢ 𝑃 = (𝑆 ↾s 𝑈)

Syntax hints:  ¬ wn 3   ∧ wa 384   = wceq 1483   ∈ wcel 1990  {crab 2916  Vcvv 3200  ⦋csb 3533  ∅c0 3915   class class class wbr 4653  ‘cfv 5888  (class class class)co 6650   finSupp cfsupp 8275  Basecbs 15857   ↾_s cress 15858  0_gc0g 16100   mPwSer cmps 19351   mPoly cmpl 19353

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-iota 5851  df-fun 5890  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-slot 15861  df-base 15863  df-ress 15865  df-psr 19356  df-mpl 19358

This theorem is referenced by:  mplbas  19429  mplval2  19431