mplmon2 - Metamath Proof Explorer

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

Theorem mplmon2 19815

Description: Express a scaled monomial. (Contributed by Stefan O'Rear, 8-Mar-2015.)

**Hypotheses**
Ref	Expression
mplmon2.p	⊢ 𝑃 = (𝐼 mPoly 𝑅)
mplmon2.v	⊢ · = ( ·_𝑠 ‘𝑃)
mplmon2.d	⊢ 𝐷 = {𝑓 ∈ (ℕ₀ ↑_𝑚 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}
mplmon2.o	⊢ 1 = (1_r‘𝑅)
mplmon2.z	⊢ 0 = (0_g‘𝑅)
mplmon2.b	⊢ 𝐵 = (Base‘𝑅)
mplmon2.i	⊢ (𝜑 → 𝐼 ∈ 𝑊)
mplmon2.r	⊢ (𝜑 → 𝑅 ∈ Ring)
mplmon2.k	⊢ (𝜑 → 𝐾 ∈ 𝐷)
mplmon2.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)

**Assertion**
Ref	Expression
mplmon2	⊢ (𝜑 → (𝑋 · (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝐾, 1 , 0 ))) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝐾, 𝑋, 0 )))

Distinct variable groups: 𝜑,𝑦 𝑦,𝐵 𝑦,𝐷 𝑓,𝐼 𝑓,𝐾,𝑦 𝑦, 1 𝑦,𝑅 𝑦,𝑋 𝑦, 0 Allowed substitution hints: 𝜑(𝑓) 𝐵(𝑓) 𝐷(𝑓) 𝑃(𝑦,𝑓) 𝑅(𝑓) · (𝑦,𝑓) 1 (𝑓) 𝐼(𝑦) 𝑊(𝑦,𝑓) 𝑋(𝑓) 0 (𝑓)

**Proof of Theorem mplmon2**
Step	Hyp	Ref	Expression
1		mplmon2.p	. . 3 ⊢ 𝑃 = (𝐼 mPoly 𝑅)
2		mplmon2.v	. . 3 ⊢ · = ( ·_𝑠 ‘𝑃)
3		mplmon2.b	. . 3 ⊢ 𝐵 = (Base‘𝑅)
4		eqid 2799	. . 3 ⊢ (Base‘𝑃) = (Base‘𝑃)
5		eqid 2799	. . 3 ⊢ (._r‘𝑅) = (._r‘𝑅)
6		mplmon2.d	. . 3 ⊢ 𝐷 = {𝑓 ∈ (ℕ₀ ↑_𝑚 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}
7		mplmon2.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
8		mplmon2.z	. . . 4 ⊢ 0 = (0_g‘𝑅)
9		mplmon2.o	. . . 4 ⊢ 1 = (1_r‘𝑅)
10		mplmon2.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
11		mplmon2.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Ring)
12		mplmon2.k	. . . 4 ⊢ (𝜑 → 𝐾 ∈ 𝐷)
13	1, 4, 8, 9, 6, 10, 11, 12	mplmon 19786	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝐾, 1 , 0 )) ∈ (Base‘𝑃))
14	1, 2, 3, 4, 5, 6, 7, 13	mplvsca 19770	. 2 ⊢ (𝜑 → (𝑋 · (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝐾, 1 , 0 ))) = ((𝐷 × {𝑋}) ∘_𝑓 (._r‘𝑅)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝐾, 1 , 0 ))))
15		ovex 6910	. . . . 5 ⊢ (ℕ₀ ↑_𝑚 𝐼) ∈ V
16	6, 15	rabex2 5009	. . . 4 ⊢ 𝐷 ∈ V
17	16	a1i 11	. . 3 ⊢ (𝜑 → 𝐷 ∈ V)
18	7	adantr 473	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → 𝑋 ∈ 𝐵)
19	9	fvexi 6425	. . . . 5 ⊢ 1 ∈ V
20	8	fvexi 6425	. . . . 5 ⊢ 0 ∈ V
21	19, 20	ifex 4325	. . . 4 ⊢ if(𝑦 = 𝐾, 1 , 0 ) ∈ V
22	21	a1i 11	. . 3 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → if(𝑦 = 𝐾, 1 , 0 ) ∈ V)
23		fconstmpt 5368	. . . 4 ⊢ (𝐷 × {𝑋}) = (𝑦 ∈ 𝐷 ↦ 𝑋)
24	23	a1i 11	. . 3 ⊢ (𝜑 → (𝐷 × {𝑋}) = (𝑦 ∈ 𝐷 ↦ 𝑋))
25		eqidd 2800	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝐾, 1 , 0 )) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝐾, 1 , 0 )))
26	17, 18, 22, 24, 25	offval2 7148	. 2 ⊢ (𝜑 → ((𝐷 × {𝑋}) ∘_𝑓 (._r‘𝑅)(𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝐾, 1 , 0 ))) = (𝑦 ∈ 𝐷 ↦ (𝑋(._r‘𝑅)if(𝑦 = 𝐾, 1 , 0 ))))
27		oveq2 6886	. . . . 5 ⊢ ( 1 = if(𝑦 = 𝐾, 1 , 0 ) → (𝑋(._r‘𝑅) 1 ) = (𝑋(._r‘𝑅)if(𝑦 = 𝐾, 1 , 0 )))
28	27	eqeq1d 2801	. . . 4 ⊢ ( 1 = if(𝑦 = 𝐾, 1 , 0 ) → ((𝑋(._r‘𝑅) 1 ) = if(𝑦 = 𝐾, 𝑋, 0 ) ↔ (𝑋(._r‘𝑅)if(𝑦 = 𝐾, 1 , 0 )) = if(𝑦 = 𝐾, 𝑋, 0 )))
29		oveq2 6886	. . . . 5 ⊢ ( 0 = if(𝑦 = 𝐾, 1 , 0 ) → (𝑋(._r‘𝑅) 0 ) = (𝑋(._r‘𝑅)if(𝑦 = 𝐾, 1 , 0 )))
30	29	eqeq1d 2801	. . . 4 ⊢ ( 0 = if(𝑦 = 𝐾, 1 , 0 ) → ((𝑋(._r‘𝑅) 0 ) = if(𝑦 = 𝐾, 𝑋, 0 ) ↔ (𝑋(._r‘𝑅)if(𝑦 = 𝐾, 1 , 0 )) = if(𝑦 = 𝐾, 𝑋, 0 )))
31	3, 5, 9	ringridm 18888	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋(._r‘𝑅) 1 ) = 𝑋)
32	11, 7, 31	syl2anc 580	. . . . 5 ⊢ (𝜑 → (𝑋(._r‘𝑅) 1 ) = 𝑋)
33		iftrue 4283	. . . . . 6 ⊢ (𝑦 = 𝐾 → if(𝑦 = 𝐾, 𝑋, 0 ) = 𝑋)
34	33	eqcomd 2805	. . . . 5 ⊢ (𝑦 = 𝐾 → 𝑋 = if(𝑦 = 𝐾, 𝑋, 0 ))
35	32, 34	sylan9eq 2853	. . . 4 ⊢ ((𝜑 ∧ 𝑦 = 𝐾) → (𝑋(._r‘𝑅) 1 ) = if(𝑦 = 𝐾, 𝑋, 0 ))
36	3, 5, 8	ringrz 18904	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋(._r‘𝑅) 0 ) = 0 )
37	11, 7, 36	syl2anc 580	. . . . 5 ⊢ (𝜑 → (𝑋(._r‘𝑅) 0 ) = 0 )
38		iffalse 4286	. . . . . 6 ⊢ (¬ 𝑦 = 𝐾 → if(𝑦 = 𝐾, 𝑋, 0 ) = 0 )
39	38	eqcomd 2805	. . . . 5 ⊢ (¬ 𝑦 = 𝐾 → 0 = if(𝑦 = 𝐾, 𝑋, 0 ))
40	37, 39	sylan9eq 2853	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑦 = 𝐾) → (𝑋(._r‘𝑅) 0 ) = if(𝑦 = 𝐾, 𝑋, 0 ))
41	28, 30, 35, 40	ifbothda 4314	. . 3 ⊢ (𝜑 → (𝑋(._r‘𝑅)if(𝑦 = 𝐾, 1 , 0 )) = if(𝑦 = 𝐾, 𝑋, 0 ))
42	41	mpteq2dv 4938	. 2 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ (𝑋(._r‘𝑅)if(𝑦 = 𝐾, 1 , 0 ))) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝐾, 𝑋, 0 )))
43	14, 26, 42	3eqtrd 2837	1 ⊢ (𝜑 → (𝑋 · (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝐾, 1 , 0 ))) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝐾, 𝑋, 0 )))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 385 = wceq 1653 ∈ wcel 2157 {crab 3093 Vcvv 3385 ifcif 4277 {csn 4368 ↦ cmpt 4922 × cxp 5310 ^◡ccnv 5311 “ cima 5315 ‘cfv 6101 (class class class)co 6878 ∘_𝑓 cof 7129 ↑_𝑚 cmap 8095 Fincfn 8195 ℕcn 11312 ℕ₀cn0 11580 Basecbs 16184 ._rcmulr 16268 ·_𝑠 cvsca 16271 0_gc0g 16415 1_rcur 18817 Ringcrg 18863 mPoly cmpl 19676

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2377 ax-ext 2777 ax-rep 4964 ax-sep 4975 ax-nul 4983 ax-pow 5035 ax-pr 5097 ax-un 7183 ax-cnex 10280 ax-resscn 10281 ax-1cn 10282 ax-icn 10283 ax-addcl 10284 ax-addrcl 10285 ax-mulcl 10286 ax-mulrcl 10287 ax-mulcom 10288 ax-addass 10289 ax-mulass 10290 ax-distr 10291 ax-i2m1 10292 ax-1ne0 10293 ax-1rid 10294 ax-rnegex 10295 ax-rrecex 10296 ax-cnre 10297 ax-pre-lttri 10298 ax-pre-lttrn 10299 ax-pre-ltadd 10300 ax-pre-mulgt0 10301

This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3or 1109 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2591 df-eu 2609 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ne 2972 df-nel 3075 df-ral 3094 df-rex 3095 df-reu 3096 df-rmo 3097 df-rab 3098 df-v 3387 df-sbc 3634 df-csb 3729 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-pss 3785 df-nul 4116 df-if 4278 df-pw 4351 df-sn 4369 df-pr 4371 df-tp 4373 df-op 4375 df-uni 4629 df-int 4668 df-iun 4712 df-br 4844 df-opab 4906 df-mpt 4923 df-tr 4946 df-id 5220 df-eprel 5225 df-po 5233 df-so 5234 df-fr 5271 df-we 5273 df-xp 5318 df-rel 5319 df-cnv 5320 df-co 5321 df-dm 5322 df-rn 5323 df-res 5324 df-ima 5325 df-pred 5898 df-ord 5944 df-on 5945 df-lim 5946 df-suc 5947 df-iota 6064 df-fun 6103 df-fn 6104 df-f 6105 df-f1 6106 df-fo 6107 df-f1o 6108 df-fv 6109 df-riota 6839 df-ov 6881 df-oprab 6882 df-mpt2 6883 df-of 7131 df-om 7300 df-1st 7401 df-2nd 7402 df-supp 7533 df-wrecs 7645 df-recs 7707 df-rdg 7745 df-1o 7799 df-oadd 7803 df-er 7982 df-map 8097 df-en 8196 df-dom 8197 df-sdom 8198 df-fin 8199 df-fsupp 8518 df-pnf 10365 df-mnf 10366 df-xr 10367 df-ltxr 10368 df-le 10369 df-sub 10558 df-neg 10559 df-nn 11313 df-2 11376 df-3 11377 df-4 11378 df-5 11379 df-6 11380 df-7 11381 df-8 11382 df-9 11383 df-n0 11581 df-z 11667 df-uz 11931 df-fz 12581 df-struct 16186 df-ndx 16187 df-slot 16188 df-base 16190 df-sets 16191 df-ress 16192 df-plusg 16280 df-mulr 16281 df-sca 16283 df-vsca 16284 df-tset 16286 df-0g 16417 df-mgm 17557 df-sgrp 17599 df-mnd 17610 df-grp 17741 df-mgp 18806 df-ur 18818 df-ring 18865 df-psr 19679 df-mpl 19681

This theorem is referenced by: mplascl 19818 mplmon2cl 19822 mplmon2mul 19823 mplcoe4 19825 coe1tm 19965

W3C validator