Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > deg1lt | Structured version Visualization version GIF version |
Description: If the degree of a univariate polynomial is less than some index, then that coefficient must be zero. (Contributed by Stefan O'Rear, 23-Mar-2015.) |
Ref | Expression |
---|---|
deg1leb.d | ⊢ 𝐷 = ( deg1 ‘𝑅) |
deg1leb.p | ⊢ 𝑃 = (Poly1‘𝑅) |
deg1leb.b | ⊢ 𝐵 = (Base‘𝑃) |
deg1leb.y | ⊢ 0 = (0g‘𝑅) |
deg1leb.a | ⊢ 𝐴 = (coe1‘𝐹) |
Ref | Expression |
---|---|
deg1lt | ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → (𝐴‘𝐺) = 0 ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp3 1134 | . 2 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → (𝐷‘𝐹) < 𝐺) | |
2 | breq2 5073 | . . . 4 ⊢ (𝑥 = 𝐺 → ((𝐷‘𝐹) < 𝑥 ↔ (𝐷‘𝐹) < 𝐺)) | |
3 | fveqeq2 6682 | . . . 4 ⊢ (𝑥 = 𝐺 → ((𝐴‘𝑥) = 0 ↔ (𝐴‘𝐺) = 0 )) | |
4 | 2, 3 | imbi12d 347 | . . 3 ⊢ (𝑥 = 𝐺 → (((𝐷‘𝐹) < 𝑥 → (𝐴‘𝑥) = 0 ) ↔ ((𝐷‘𝐹) < 𝐺 → (𝐴‘𝐺) = 0 ))) |
5 | deg1leb.d | . . . . . . 7 ⊢ 𝐷 = ( deg1 ‘𝑅) | |
6 | deg1leb.p | . . . . . . 7 ⊢ 𝑃 = (Poly1‘𝑅) | |
7 | deg1leb.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑃) | |
8 | 5, 6, 7 | deg1xrcl 24679 | . . . . . 6 ⊢ (𝐹 ∈ 𝐵 → (𝐷‘𝐹) ∈ ℝ*) |
9 | 8 | 3ad2ant1 1129 | . . . . 5 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → (𝐷‘𝐹) ∈ ℝ*) |
10 | 9 | xrleidd 12548 | . . . 4 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → (𝐷‘𝐹) ≤ (𝐷‘𝐹)) |
11 | simp1 1132 | . . . . 5 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → 𝐹 ∈ 𝐵) | |
12 | deg1leb.y | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
13 | deg1leb.a | . . . . . 6 ⊢ 𝐴 = (coe1‘𝐹) | |
14 | 5, 6, 7, 12, 13 | deg1leb 24692 | . . . . 5 ⊢ ((𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) ∈ ℝ*) → ((𝐷‘𝐹) ≤ (𝐷‘𝐹) ↔ ∀𝑥 ∈ ℕ0 ((𝐷‘𝐹) < 𝑥 → (𝐴‘𝑥) = 0 ))) |
15 | 11, 8, 14 | syl2anc2 587 | . . . 4 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → ((𝐷‘𝐹) ≤ (𝐷‘𝐹) ↔ ∀𝑥 ∈ ℕ0 ((𝐷‘𝐹) < 𝑥 → (𝐴‘𝑥) = 0 ))) |
16 | 10, 15 | mpbid 234 | . . 3 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → ∀𝑥 ∈ ℕ0 ((𝐷‘𝐹) < 𝑥 → (𝐴‘𝑥) = 0 )) |
17 | simp2 1133 | . . 3 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → 𝐺 ∈ ℕ0) | |
18 | 4, 16, 17 | rspcdva 3628 | . 2 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → ((𝐷‘𝐹) < 𝐺 → (𝐴‘𝐺) = 0 )) |
19 | 1, 18 | mpd 15 | 1 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → (𝐴‘𝐺) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ w3a 1083 = wceq 1536 ∈ wcel 2113 ∀wral 3141 class class class wbr 5069 ‘cfv 6358 ℝ*cxr 10677 < clt 10678 ≤ cle 10679 ℕ0cn0 11900 Basecbs 16486 0gc0g 16716 Poly1cpl1 20348 coe1cco1 20349 deg1 cdg1 24651 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 ax-pre-sup 10618 ax-addf 10619 ax-mulf 10620 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-int 4880 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-se 5518 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-isom 6367 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-of 7412 df-om 7584 df-1st 7692 df-2nd 7693 df-supp 7834 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-oadd 8109 df-er 8292 df-map 8411 df-en 8513 df-dom 8514 df-sdom 8515 df-fin 8516 df-fsupp 8837 df-sup 8909 df-oi 8977 df-card 9371 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 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 16488 df-ndx 16489 df-slot 16490 df-base 16492 df-sets 16493 df-ress 16494 df-plusg 16581 df-mulr 16582 df-starv 16583 df-sca 16584 df-vsca 16585 df-tset 16587 df-ple 16588 df-ds 16590 df-unif 16591 df-0g 16718 df-gsum 16719 df-mgm 17855 df-sgrp 17904 df-mnd 17915 df-submnd 17960 df-grp 18109 df-minusg 18110 df-mulg 18228 df-cntz 18450 df-cmn 18911 df-abl 18912 df-mgp 19243 df-ur 19255 df-ring 19302 df-cring 19303 df-psr 20139 df-mpl 20141 df-opsr 20143 df-psr1 20351 df-ply1 20353 df-coe1 20354 df-cnfld 20549 df-mdeg 24652 df-deg1 24653 |
This theorem is referenced by: deg1ge 24695 coe1mul3 24696 deg1add 24700 |
Copyright terms: Public domain | W3C validator |