Theorem mplval 22009

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 7466	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) ∈ V)
3		id 22	. . . . . . . 8 ⊢ (𝑠 = (𝑖 mPwSer 𝑟) → 𝑠 = (𝑖 mPwSer 𝑟))
4		oveq12 7440	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPwSer 𝑟) = (𝐼 mPwSer 𝑅))
5	3, 4	sylan9eqr 2799	. . . . . . 7 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = (𝐼 mPwSer 𝑅))
6		mplval.s	. . . . . . 7 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
7	5, 6	eqtr4di 2795	. . . . . 6 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑠 = 𝑆)
8	7	fveq2d 6910	. . . . . . . . 9 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = (Base‘𝑆))
9		mplval.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑆)
10	8, 9	eqtr4di 2795	. . . . . . . 8 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (Base‘𝑠) = 𝐵)
11		simplr 769	. . . . . . . . . . 11 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → 𝑟 = 𝑅)
12	11	fveq2d 6910	. . . . . . . . . 10 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = (0g‘𝑅))
13		mplval.z	. . . . . . . . . 10 ⊢ 0 = (0g‘𝑅)
14	12, 13	eqtr4di 2795	. . . . . . . . 9 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (0g‘𝑟) = 0 )
15	14	breq2d 5155	. . . . . . . 8 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑓 finSupp (0g‘𝑟) ↔ 𝑓 finSupp 0 ))
16	10, 15	rabeqbidv 3455	. . . . . . 7 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 })
17		mplval.u	. . . . . . 7 ⊢ 𝑈 = {𝑓 ∈ 𝐵 ∣ 𝑓 finSupp 0 }
18	16, 17	eqtr4di 2795	. . . . . 6 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)} = 𝑈)
19	7, 18	oveq12d 7449	. . . . 5 ⊢ (((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) ∧ 𝑠 = (𝑖 mPwSer 𝑟)) → (𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
20	2, 19	csbied 3935	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}) = (𝑆 ↾s 𝑈))
21		df-mpl 21931	. . . 4 ⊢ mPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ ⦋(𝑖 mPwSer 𝑟) / 𝑠⦌(𝑠 ↾s {𝑓 ∈ (Base‘𝑠) ∣ 𝑓 finSupp (0g‘𝑟)}))
22		ovex 7464	. . . 4 ⊢ (𝑆 ↾s 𝑈) ∈ V
23	20, 21, 22	ovmpoa 7588	. . 3 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
24		reldmmpl 22008	. . . . . 6 ⊢ Rel dom mPoly
25	24	ovprc 7469	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = ∅)
26		ress0 17289	. . . . 5 ⊢ (∅ ↾s 𝑈) = ∅
27	25, 26	eqtr4di 2795	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (∅ ↾s 𝑈))
28		reldmpsr 21934	. . . . . . 7 ⊢ Rel dom mPwSer
29	28	ovprc 7469	. . . . . 6 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPwSer 𝑅) = ∅)
30	6, 29	eqtrid 2789	. . . . 5 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → 𝑆 = ∅)
31	30	oveq1d 7446	. . . 4 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝑆 ↾s 𝑈) = (∅ ↾s 𝑈))
32	27, 31	eqtr4d 2780	. . 3 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈))
33	23, 32	pm2.61i 182	. 2 ⊢ (𝐼 mPoly 𝑅) = (𝑆 ↾s 𝑈)
34	1, 33	eqtri 2765	1 ⊢ 𝑃 = (𝑆 ↾s 𝑈)

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1540   ∈ wcel 2108  {crab 3436  Vcvv 3480  ⦋csb 3899  ∅c0 4333   class class class wbr 5143  ‘cfv 6561  (class class class)co 7431   finSupp cfsupp 9401  Basecbs 17247   ↾_s cress 17274  0_gc0g 17484   mPwSer cmps 21924   mPoly cmpl 21926

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-cnex 11211  ax-1cn 11213  ax-addcl 11215

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-nn 12267  df-slot 17219  df-ndx 17231  df-base 17248  df-ress 17275  df-psr 21929  df-mpl 21931

This theorem is referenced by:  mplbas  22010  mplval2  22016