mplmon - Metamath Proof Explorer

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

Theorem mplmon 19463

Description: A monomial is a polynomial. (Contributed by Mario Carneiro, 9-Jan-2015.)

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

**Assertion**
Ref	Expression
mplmon	⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ 𝐵)

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

**Proof of Theorem mplmon**
Step	Hyp	Ref	Expression
1		mplmon.r	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ Ring)
2		eqid 2622	. . . . . . . . 9 ⊢ (Base‘𝑅) = (Base‘𝑅)
3		mplmon.o	. . . . . . . . 9 ⊢ 1 = (1_r‘𝑅)
4	2, 3	ringidcl 18568	. . . . . . . 8 ⊢ (𝑅 ∈ Ring → 1 ∈ (Base‘𝑅))
5		mplmon.z	. . . . . . . . 9 ⊢ 0 = (0_g‘𝑅)
6	2, 5	ring0cl 18569	. . . . . . . 8 ⊢ (𝑅 ∈ Ring → 0 ∈ (Base‘𝑅))
7	4, 6	ifcld 4131	. . . . . . 7 ⊢ (𝑅 ∈ Ring → if(𝑦 = 𝑋, 1 , 0 ) ∈ (Base‘𝑅))
8	1, 7	syl 17	. . . . . 6 ⊢ (𝜑 → if(𝑦 = 𝑋, 1 , 0 ) ∈ (Base‘𝑅))
9	8	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → if(𝑦 = 𝑋, 1 , 0 ) ∈ (Base‘𝑅))
10		eqid 2622	. . . . 5 ⊢ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) = (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))
11	9, 10	fmptd 6385	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )):𝐷⟶(Base‘𝑅))
12		fvex 6201	. . . . 5 ⊢ (Base‘𝑅) ∈ V
13		mplmon.d	. . . . . 6 ⊢ 𝐷 = {𝑓 ∈ (ℕ₀ ↑_𝑚 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}
14		ovex 6678	. . . . . 6 ⊢ (ℕ₀ ↑_𝑚 𝐼) ∈ V
15	13, 14	rabex2 4815	. . . . 5 ⊢ 𝐷 ∈ V
16	12, 15	elmap 7886	. . . 4 ⊢ ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ ((Base‘𝑅) ↑_𝑚 𝐷) ↔ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )):𝐷⟶(Base‘𝑅))
17	11, 16	sylibr 224	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ ((Base‘𝑅) ↑_𝑚 𝐷))
18		eqid 2622	. . . 4 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅)
19		eqid 2622	. . . 4 ⊢ (Base‘(𝐼 mPwSer 𝑅)) = (Base‘(𝐼 mPwSer 𝑅))
20		mplmon.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
21	18, 2, 13, 19, 20	psrbas 19378	. . 3 ⊢ (𝜑 → (Base‘(𝐼 mPwSer 𝑅)) = ((Base‘𝑅) ↑_𝑚 𝐷))
22	17, 21	eleqtrrd 2704	. 2 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ (Base‘(𝐼 mPwSer 𝑅)))
23	15	mptex 6486	. . . . 5 ⊢ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ V
24		funmpt 5926	. . . . 5 ⊢ Fun (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 ))
25		fvex 6201	. . . . . 6 ⊢ (0_g‘𝑅) ∈ V
26	5, 25	eqeltri 2697	. . . . 5 ⊢ 0 ∈ V
27	23, 24, 26	3pm3.2i 1239	. . . 4 ⊢ ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ V ∧ Fun (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∧ 0 ∈ V)
28	27	a1i 11	. . 3 ⊢ (𝜑 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ V ∧ Fun (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∧ 0 ∈ V))
29		snfi 8038	. . . 4 ⊢ {𝑋} ∈ Fin
30	29	a1i 11	. . 3 ⊢ (𝜑 → {𝑋} ∈ Fin)
31		eldifsni 4320	. . . . . . 7 ⊢ (𝑦 ∈ (𝐷 ∖ {𝑋}) → 𝑦 ≠ 𝑋)
32	31	adantl 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐷 ∖ {𝑋})) → 𝑦 ≠ 𝑋)
33	32	neneqd 2799	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐷 ∖ {𝑋})) → ¬ 𝑦 = 𝑋)
34	33	iffalsed 4097	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐷 ∖ {𝑋})) → if(𝑦 = 𝑋, 1 , 0 ) = 0 )
35	15	a1i 11	. . . 4 ⊢ (𝜑 → 𝐷 ∈ V)
36	34, 35	suppss2 7329	. . 3 ⊢ (𝜑 → ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) supp 0 ) ⊆ {𝑋})
37		suppssfifsupp 8290	. . 3 ⊢ ((((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ V ∧ Fun (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∧ 0 ∈ V) ∧ ({𝑋} ∈ Fin ∧ ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) supp 0 ) ⊆ {𝑋})) → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) finSupp 0 )
38	28, 30, 36, 37	syl12anc 1324	. 2 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) finSupp 0 )
39		mplmon.s	. . 3 ⊢ 𝑃 = (𝐼 mPoly 𝑅)
40		mplmon.b	. . 3 ⊢ 𝐵 = (Base‘𝑃)
41	39, 18, 19, 5, 40	mplelbas 19430	. 2 ⊢ ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ 𝐵 ↔ ((𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ (Base‘(𝐼 mPwSer 𝑅)) ∧ (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) finSupp 0 ))
42	22, 38, 41	sylanbrc 698	1 ⊢ (𝜑 → (𝑦 ∈ 𝐷 ↦ if(𝑦 = 𝑋, 1 , 0 )) ∈ 𝐵)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 {crab 2916 Vcvv 3200 ∖ cdif 3571 ⊆ wss 3574 ifcif 4086 {csn 4177 class class class wbr 4653 ↦ cmpt 4729 ^◡ccnv 5113 “ cima 5117 Fun wfun 5882 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 supp csupp 7295 ↑_𝑚 cmap 7857 Fincfn 7955 finSupp cfsupp 8275 ℕcn 11020 ℕ₀cn0 11292 Basecbs 15857 0_gc0g 16100 1_rcur 18501 Ringcrg 18547 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-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 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-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 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-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-of 6897 df-om 7066 df-1st 7168 df-2nd 7169 df-supp 7296 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-fsupp 8276 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 df-plusg 15954 df-mulr 15955 df-sca 15957 df-vsca 15958 df-tset 15960 df-0g 16102 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-grp 17425 df-mgp 18490 df-ur 18502 df-ring 18549 df-psr 19356 df-mpl 19358

This theorem is referenced by: mplmonmul 19464 mplcoe1 19465 mplbas2 19470 mplmon2 19493 mplmon2cl 19500 mplmon2mul 19501

W3C validator