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 ↑m 𝐼) ∣ (◡𝑚 “ ℕ) ∈ Fin} |
mdegval.h | ⊢ 𝐻 = (ℎ ∈ 𝐴 ↦ (ℂfld Σg ℎ)) |
mdeglt.f | ⊢ (𝜑 → 𝐹 ∈ 𝐵) |
medglt.x | ⊢ (𝜑 → 𝑋 ∈ 𝐴) |
mdeglt.lt | ⊢ (𝜑 → (𝐷‘𝐹) < (𝐻‘𝑋)) |
Ref | Expression |
---|---|
mdeglt | ⊢ (𝜑 → (𝐹‘𝑋) = 0 ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mdeglt.lt | . 2 ⊢ (𝜑 → (𝐷‘𝐹) < (𝐻‘𝑋)) | |
2 | fveq2 6672 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝐻‘𝑥) = (𝐻‘𝑋)) | |
3 | 2 | breq2d 5080 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝐷‘𝐹) < (𝐻‘𝑥) ↔ (𝐷‘𝐹) < (𝐻‘𝑋))) |
4 | fveqeq2 6681 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) = 0 ↔ (𝐹‘𝑋) = 0 )) | |
5 | 3, 4 | imbi12d 347 | . . 3 ⊢ (𝑥 = 𝑋 → (((𝐷‘𝐹) < (𝐻‘𝑥) → (𝐹‘𝑥) = 0 ) ↔ ((𝐷‘𝐹) < (𝐻‘𝑋) → (𝐹‘𝑋) = 0 ))) |
6 | mdeglt.f | . . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
7 | mdegval.d | . . . . . . . 8 ⊢ 𝐷 = (𝐼 mDeg 𝑅) | |
8 | mdegval.p | . . . . . . . 8 ⊢ 𝑃 = (𝐼 mPoly 𝑅) | |
9 | mdegval.b | . . . . . . . 8 ⊢ 𝐵 = (Base‘𝑃) | |
10 | mdegval.z | . . . . . . . 8 ⊢ 0 = (0g‘𝑅) | |
11 | mdegval.a | . . . . . . . 8 ⊢ 𝐴 = {𝑚 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑚 “ ℕ) ∈ Fin} | |
12 | mdegval.h | . . . . . . . 8 ⊢ 𝐻 = (ℎ ∈ 𝐴 ↦ (ℂfld Σg ℎ)) | |
13 | 7, 8, 9, 10, 11, 12 | mdegval 24659 | . . . . . . 7 ⊢ (𝐹 ∈ 𝐵 → (𝐷‘𝐹) = sup((𝐻 “ (𝐹 supp 0 )), ℝ*, < )) |
14 | 6, 13 | syl 17 | . . . . . 6 ⊢ (𝜑 → (𝐷‘𝐹) = sup((𝐻 “ (𝐹 supp 0 )), ℝ*, < )) |
15 | imassrn 5942 | . . . . . . . 8 ⊢ (𝐻 “ (𝐹 supp 0 )) ⊆ ran 𝐻 | |
16 | 8, 9 | mplrcl 20272 | . . . . . . . . . 10 ⊢ (𝐹 ∈ 𝐵 → 𝐼 ∈ V) |
17 | 11, 12 | tdeglem1 24654 | . . . . . . . . . 10 ⊢ (𝐼 ∈ V → 𝐻:𝐴⟶ℕ0) |
18 | frn 6522 | . . . . . . . . . 10 ⊢ (𝐻:𝐴⟶ℕ0 → ran 𝐻 ⊆ ℕ0) | |
19 | 6, 16, 17, 18 | 4syl 19 | . . . . . . . . 9 ⊢ (𝜑 → ran 𝐻 ⊆ ℕ0) |
20 | nn0ssre 11904 | . . . . . . . . . 10 ⊢ ℕ0 ⊆ ℝ | |
21 | ressxr 10687 | . . . . . . . . . 10 ⊢ ℝ ⊆ ℝ* | |
22 | 20, 21 | sstri 3978 | . . . . . . . . 9 ⊢ ℕ0 ⊆ ℝ* |
23 | 19, 22 | sstrdi 3981 | . . . . . . . 8 ⊢ (𝜑 → ran 𝐻 ⊆ ℝ*) |
24 | 15, 23 | sstrid 3980 | . . . . . . 7 ⊢ (𝜑 → (𝐻 “ (𝐹 supp 0 )) ⊆ ℝ*) |
25 | supxrcl 12711 | . . . . . . 7 ⊢ ((𝐻 “ (𝐹 supp 0 )) ⊆ ℝ* → sup((𝐻 “ (𝐹 supp 0 )), ℝ*, < ) ∈ ℝ*) | |
26 | 24, 25 | syl 17 | . . . . . 6 ⊢ (𝜑 → sup((𝐻 “ (𝐹 supp 0 )), ℝ*, < ) ∈ ℝ*) |
27 | 14, 26 | eqeltrd 2915 | . . . . 5 ⊢ (𝜑 → (𝐷‘𝐹) ∈ ℝ*) |
28 | 27 | xrleidd 12548 | . . . 4 ⊢ (𝜑 → (𝐷‘𝐹) ≤ (𝐷‘𝐹)) |
29 | 7, 8, 9, 10, 11, 12 | mdegleb 24660 | . . . . 5 ⊢ ((𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) ∈ ℝ*) → ((𝐷‘𝐹) ≤ (𝐷‘𝐹) ↔ ∀𝑥 ∈ 𝐴 ((𝐷‘𝐹) < (𝐻‘𝑥) → (𝐹‘𝑥) = 0 ))) |
30 | 6, 27, 29 | syl2anc 586 | . . . 4 ⊢ (𝜑 → ((𝐷‘𝐹) ≤ (𝐷‘𝐹) ↔ ∀𝑥 ∈ 𝐴 ((𝐷‘𝐹) < (𝐻‘𝑥) → (𝐹‘𝑥) = 0 ))) |
31 | 28, 30 | mpbid 234 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ((𝐷‘𝐹) < (𝐻‘𝑥) → (𝐹‘𝑥) = 0 )) |
32 | medglt.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐴) | |
33 | 5, 31, 32 | rspcdva 3627 | . 2 ⊢ (𝜑 → ((𝐷‘𝐹) < (𝐻‘𝑋) → (𝐹‘𝑋) = 0 )) |
34 | 1, 33 | mpd 15 | 1 ⊢ (𝜑 → (𝐹‘𝑋) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1537 ∈ wcel 2114 ∀wral 3140 {crab 3144 Vcvv 3496 ⊆ wss 3938 class class class wbr 5068 ↦ cmpt 5148 ◡ccnv 5556 ran crn 5558 “ cima 5560 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 supp csupp 7832 ↑m cmap 8408 Fincfn 8511 supcsup 8906 ℝcr 10538 ℝ*cxr 10676 < clt 10677 ≤ cle 10678 ℕcn 11640 ℕ0cn0 11900 Basecbs 16485 0gc0g 16715 Σg cgsu 16716 mPoly cmpl 20135 ℂfldccnfld 20547 mDeg cmdg 24649 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 ax-addf 10618 ax-mulf 10619 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-se 5517 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-isom 6366 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-of 7411 df-om 7583 df-1st 7691 df-2nd 7692 df-supp 7833 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-fsupp 8836 df-sup 8908 df-oi 8976 df-card 9370 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-z 11985 df-dec 12102 df-uz 12247 df-fz 12896 df-fzo 13037 df-seq 13373 df-hash 13694 df-struct 16487 df-ndx 16488 df-slot 16489 df-base 16491 df-sets 16492 df-ress 16493 df-plusg 16580 df-mulr 16581 df-starv 16582 df-sca 16583 df-vsca 16584 df-tset 16586 df-ple 16587 df-ds 16589 df-unif 16590 df-0g 16717 df-gsum 16718 df-mgm 17854 df-sgrp 17903 df-mnd 17914 df-submnd 17959 df-grp 18108 df-minusg 18109 df-cntz 18449 df-cmn 18910 df-abl 18911 df-mgp 19242 df-ur 19254 df-ring 19301 df-cring 19302 df-psr 20138 df-mpl 20140 df-cnfld 20548 df-mdeg 24651 |
This theorem is referenced by: mdegaddle 24670 mdegvscale 24671 mdegmullem 24674 |
Copyright terms: Public domain | W3C validator |