Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mdeglt | Structured version Visualization version GIF version |
Description: If there is an upper limit on the degree of a polynomial that is lower than the degree of some exponent bag, then that exponent bag is unrepresented in the polynomial. (Contributed by Stefan O'Rear, 26-Mar-2015.) (Proof shortened by AV, 27-Jul-2019.) |
Ref | Expression |
---|---|
mdegval.d | ⊢ 𝐷 = (𝐼 mDeg 𝑅) |
mdegval.p | ⊢ 𝑃 = (𝐼 mPoly 𝑅) |
mdegval.b | ⊢ 𝐵 = (Base‘𝑃) |
mdegval.z | ⊢ 0 = (0g‘𝑅) |
mdegval.a | ⊢ 𝐴 = {𝑚 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑚 “ ℕ) ∈ Fin} |
mdegval.h | ⊢ 𝐻 = (ℎ ∈ 𝐴 ↦ (ℂfld Σg ℎ)) |
mdeglt.f | ⊢ (𝜑 → 𝐹 ∈ 𝐵) |
medglt.x | ⊢ (𝜑 → 𝑋 ∈ 𝐴) |
mdeglt.lt | ⊢ (𝜑 → (𝐷‘𝐹) < (𝐻‘𝑋)) |
Ref | Expression |
---|---|
mdeglt | ⊢ (𝜑 → (𝐹‘𝑋) = 0 ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mdeglt.lt | . 2 ⊢ (𝜑 → (𝐷‘𝐹) < (𝐻‘𝑋)) | |
2 | medglt.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐴) | |
3 | mdeglt.f | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
4 | mdegval.d | . . . . . . . 8 ⊢ 𝐷 = (𝐼 mDeg 𝑅) | |
5 | mdegval.p | . . . . . . . 8 ⊢ 𝑃 = (𝐼 mPoly 𝑅) | |
6 | mdegval.b | . . . . . . . 8 ⊢ 𝐵 = (Base‘𝑃) | |
7 | mdegval.z | . . . . . . . 8 ⊢ 0 = (0g‘𝑅) | |
8 | mdegval.a | . . . . . . . 8 ⊢ 𝐴 = {𝑚 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑚 “ ℕ) ∈ Fin} | |
9 | mdegval.h | . . . . . . . 8 ⊢ 𝐻 = (ℎ ∈ 𝐴 ↦ (ℂfld Σg ℎ)) | |
10 | 4, 5, 6, 7, 8, 9 | mdegval 23823 | . . . . . . 7 ⊢ (𝐹 ∈ 𝐵 → (𝐷‘𝐹) = sup((𝐻 “ (𝐹 supp 0 )), ℝ*, < )) |
11 | 3, 10 | syl 17 | . . . . . 6 ⊢ (𝜑 → (𝐷‘𝐹) = sup((𝐻 “ (𝐹 supp 0 )), ℝ*, < )) |
12 | imassrn 5477 | . . . . . . . 8 ⊢ (𝐻 “ (𝐹 supp 0 )) ⊆ ran 𝐻 | |
13 | 5, 6 | mplrcl 19490 | . . . . . . . . . 10 ⊢ (𝐹 ∈ 𝐵 → 𝐼 ∈ V) |
14 | 8, 9 | tdeglem1 23818 | . . . . . . . . . 10 ⊢ (𝐼 ∈ V → 𝐻:𝐴⟶ℕ0) |
15 | frn 6053 | . . . . . . . . . 10 ⊢ (𝐻:𝐴⟶ℕ0 → ran 𝐻 ⊆ ℕ0) | |
16 | 3, 13, 14, 15 | 4syl 19 | . . . . . . . . 9 ⊢ (𝜑 → ran 𝐻 ⊆ ℕ0) |
17 | nn0ssre 11296 | . . . . . . . . . 10 ⊢ ℕ0 ⊆ ℝ | |
18 | ressxr 10083 | . . . . . . . . . 10 ⊢ ℝ ⊆ ℝ* | |
19 | 17, 18 | sstri 3612 | . . . . . . . . 9 ⊢ ℕ0 ⊆ ℝ* |
20 | 16, 19 | syl6ss 3615 | . . . . . . . 8 ⊢ (𝜑 → ran 𝐻 ⊆ ℝ*) |
21 | 12, 20 | syl5ss 3614 | . . . . . . 7 ⊢ (𝜑 → (𝐻 “ (𝐹 supp 0 )) ⊆ ℝ*) |
22 | supxrcl 12145 | . . . . . . 7 ⊢ ((𝐻 “ (𝐹 supp 0 )) ⊆ ℝ* → sup((𝐻 “ (𝐹 supp 0 )), ℝ*, < ) ∈ ℝ*) | |
23 | 21, 22 | syl 17 | . . . . . 6 ⊢ (𝜑 → sup((𝐻 “ (𝐹 supp 0 )), ℝ*, < ) ∈ ℝ*) |
24 | 11, 23 | eqeltrd 2701 | . . . . 5 ⊢ (𝜑 → (𝐷‘𝐹) ∈ ℝ*) |
25 | xrleid 11983 | . . . . 5 ⊢ ((𝐷‘𝐹) ∈ ℝ* → (𝐷‘𝐹) ≤ (𝐷‘𝐹)) | |
26 | 24, 25 | syl 17 | . . . 4 ⊢ (𝜑 → (𝐷‘𝐹) ≤ (𝐷‘𝐹)) |
27 | 4, 5, 6, 7, 8, 9 | mdegleb 23824 | . . . . 5 ⊢ ((𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) ∈ ℝ*) → ((𝐷‘𝐹) ≤ (𝐷‘𝐹) ↔ ∀𝑥 ∈ 𝐴 ((𝐷‘𝐹) < (𝐻‘𝑥) → (𝐹‘𝑥) = 0 ))) |
28 | 3, 24, 27 | syl2anc 693 | . . . 4 ⊢ (𝜑 → ((𝐷‘𝐹) ≤ (𝐷‘𝐹) ↔ ∀𝑥 ∈ 𝐴 ((𝐷‘𝐹) < (𝐻‘𝑥) → (𝐹‘𝑥) = 0 ))) |
29 | 26, 28 | mpbid 222 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ((𝐷‘𝐹) < (𝐻‘𝑥) → (𝐹‘𝑥) = 0 )) |
30 | fveq2 6191 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐻‘𝑥) = (𝐻‘𝑋)) | |
31 | 30 | breq2d 4665 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐷‘𝐹) < (𝐻‘𝑥) ↔ (𝐷‘𝐹) < (𝐻‘𝑋))) |
32 | fveq2 6191 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
33 | 32 | eqeq1d 2624 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) = 0 ↔ (𝐹‘𝑋) = 0 )) |
34 | 31, 33 | imbi12d 334 | . . . 4 ⊢ (𝑥 = 𝑋 → (((𝐷‘𝐹) < (𝐻‘𝑥) → (𝐹‘𝑥) = 0 ) ↔ ((𝐷‘𝐹) < (𝐻‘𝑋) → (𝐹‘𝑋) = 0 ))) |
35 | 34 | rspcva 3307 | . . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ((𝐷‘𝐹) < (𝐻‘𝑥) → (𝐹‘𝑥) = 0 )) → ((𝐷‘𝐹) < (𝐻‘𝑋) → (𝐹‘𝑋) = 0 )) |
36 | 2, 29, 35 | syl2anc 693 | . 2 ⊢ (𝜑 → ((𝐷‘𝐹) < (𝐻‘𝑋) → (𝐹‘𝑋) = 0 )) |
37 | 1, 36 | mpd 15 | 1 ⊢ (𝜑 → (𝐹‘𝑋) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 = wceq 1483 ∈ wcel 1990 ∀wral 2912 {crab 2916 Vcvv 3200 ⊆ wss 3574 class class class wbr 4653 ↦ cmpt 4729 ◡ccnv 5113 ran crn 5115 “ cima 5117 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 supp csupp 7295 ↑𝑚 cmap 7857 Fincfn 7955 supcsup 8346 ℝcr 9935 ℝ*cxr 10073 < clt 10074 ≤ cle 10075 ℕcn 11020 ℕ0cn0 11292 Basecbs 15857 0gc0g 16100 Σg cgsu 16101 mPoly cmpl 19353 ℂfldccnfld 19746 mDeg cmdg 23813 |
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 ax-pre-sup 10014 ax-addf 10015 ax-mulf 10016 |
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-se 5074 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-isom 5897 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-sup 8348 df-oi 8415 df-card 8765 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-dec 11494 df-uz 11688 df-fz 12327 df-fzo 12466 df-seq 12802 df-hash 13118 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-starv 15956 df-sca 15957 df-vsca 15958 df-tset 15960 df-ple 15961 df-ds 15964 df-unif 15965 df-0g 16102 df-gsum 16103 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-submnd 17336 df-grp 17425 df-minusg 17426 df-cntz 17750 df-cmn 18195 df-abl 18196 df-mgp 18490 df-ur 18502 df-ring 18549 df-cring 18550 df-psr 19356 df-mpl 19358 df-cnfld 19747 df-mdeg 23815 |
This theorem is referenced by: mdegaddle 23834 mdegvscale 23835 mdegmullem 23838 |
Copyright terms: Public domain | W3C validator |