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 1130 | . 2 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → (𝐷‘𝐹) < 𝐺) | |
2 | breq2 5061 | . . . 4 ⊢ (𝑥 = 𝐺 → ((𝐷‘𝐹) < 𝑥 ↔ (𝐷‘𝐹) < 𝐺)) | |
3 | fveqeq2 6672 | . . . 4 ⊢ (𝑥 = 𝐺 → ((𝐴‘𝑥) = 0 ↔ (𝐴‘𝐺) = 0 )) | |
4 | 2, 3 | imbi12d 346 | . . 3 ⊢ (𝑥 = 𝐺 → (((𝐷‘𝐹) < 𝑥 → (𝐴‘𝑥) = 0 ) ↔ ((𝐷‘𝐹) < 𝐺 → (𝐴‘𝐺) = 0 ))) |
5 | deg1leb.d | . . . . . . 7 ⊢ 𝐷 = ( deg1 ‘𝑅) | |
6 | deg1leb.p | . . . . . . 7 ⊢ 𝑃 = (Poly1‘𝑅) | |
7 | deg1leb.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑃) | |
8 | 5, 6, 7 | deg1xrcl 24603 | . . . . . 6 ⊢ (𝐹 ∈ 𝐵 → (𝐷‘𝐹) ∈ ℝ*) |
9 | 8 | 3ad2ant1 1125 | . . . . 5 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → (𝐷‘𝐹) ∈ ℝ*) |
10 | 9 | xrleidd 12533 | . . . 4 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → (𝐷‘𝐹) ≤ (𝐷‘𝐹)) |
11 | simp1 1128 | . . . . 5 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → 𝐹 ∈ 𝐵) | |
12 | deg1leb.y | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
13 | deg1leb.a | . . . . . 6 ⊢ 𝐴 = (coe1‘𝐹) | |
14 | 5, 6, 7, 12, 13 | deg1leb 24616 | . . . . 5 ⊢ ((𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) ∈ ℝ*) → ((𝐷‘𝐹) ≤ (𝐷‘𝐹) ↔ ∀𝑥 ∈ ℕ0 ((𝐷‘𝐹) < 𝑥 → (𝐴‘𝑥) = 0 ))) |
15 | 11, 8, 14 | syl2anc2 585 | . . . 4 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → ((𝐷‘𝐹) ≤ (𝐷‘𝐹) ↔ ∀𝑥 ∈ ℕ0 ((𝐷‘𝐹) < 𝑥 → (𝐴‘𝑥) = 0 ))) |
16 | 10, 15 | mpbid 233 | . . 3 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → ∀𝑥 ∈ ℕ0 ((𝐷‘𝐹) < 𝑥 → (𝐴‘𝑥) = 0 )) |
17 | simp2 1129 | . . 3 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → 𝐺 ∈ ℕ0) | |
18 | 4, 16, 17 | rspcdva 3622 | . 2 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → ((𝐷‘𝐹) < 𝐺 → (𝐴‘𝐺) = 0 )) |
19 | 1, 18 | mpd 15 | 1 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ ℕ0 ∧ (𝐷‘𝐹) < 𝐺) → (𝐴‘𝐺) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 ∀wral 3135 class class class wbr 5057 ‘cfv 6348 ℝ*cxr 10662 < clt 10663 ≤ cle 10664 ℕ0cn0 11885 Basecbs 16471 0gc0g 16701 Poly1cpl1 20273 coe1cco1 20274 deg1 cdg1 24575 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 ax-addf 10604 ax-mulf 10605 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-of 7398 df-om 7570 df-1st 7678 df-2nd 7679 df-supp 7820 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-oadd 8095 df-er 8278 df-map 8397 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-fsupp 8822 df-sup 8894 df-oi 8962 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-fz 12881 df-fzo 13022 df-seq 13358 df-hash 13679 df-struct 16473 df-ndx 16474 df-slot 16475 df-base 16477 df-sets 16478 df-ress 16479 df-plusg 16566 df-mulr 16567 df-starv 16568 df-sca 16569 df-vsca 16570 df-tset 16572 df-ple 16573 df-ds 16575 df-unif 16576 df-0g 16703 df-gsum 16704 df-mgm 17840 df-sgrp 17889 df-mnd 17900 df-submnd 17945 df-grp 18044 df-minusg 18045 df-mulg 18163 df-cntz 18385 df-cmn 18837 df-abl 18838 df-mgp 19169 df-ur 19181 df-ring 19228 df-cring 19229 df-psr 20064 df-mpl 20066 df-opsr 20068 df-psr1 20276 df-ply1 20278 df-coe1 20279 df-cnfld 20474 df-mdeg 24576 df-deg1 24577 |
This theorem is referenced by: deg1ge 24619 coe1mul3 24620 deg1add 24624 |
Copyright terms: Public domain | W3C validator |