| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > deg1addlt | Structured version Visualization version GIF version | ||
| Description: If both factors have degree bounded by 𝐿, then the sum of the polynomials also has degree bounded by 𝐿. See also deg1addle 26237. (Contributed by Thierry Arnoux, 2-Apr-2025.) |
| Ref | Expression |
|---|---|
| deg1addlt.y | ⊢ 𝑌 = (Poly1‘𝑅) |
| deg1addlt.d | ⊢ 𝐷 = (deg1‘𝑅) |
| deg1addlt.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
| deg1addlt.b | ⊢ 𝐵 = (Base‘𝑌) |
| deg1addlt.p | ⊢ + = (+g‘𝑌) |
| deg1addlt.f | ⊢ (𝜑 → 𝐹 ∈ 𝐵) |
| deg1addlt.g | ⊢ (𝜑 → 𝐺 ∈ 𝐵) |
| deg1addlt.l | ⊢ (𝜑 → 𝐿 ∈ ℝ*) |
| deg1addlt.1 | ⊢ (𝜑 → (𝐷‘𝐹) < 𝐿) |
| deg1addlt.2 | ⊢ (𝜑 → (𝐷‘𝐺) < 𝐿) |
| Ref | Expression |
|---|---|
| deg1addlt | ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) < 𝐿) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | deg1addlt.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
| 2 | deg1addlt.y | . . . . . 6 ⊢ 𝑌 = (Poly1‘𝑅) | |
| 3 | 2 | ply1ring 22386 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑌 ∈ Ring) |
| 4 | 1, 3 | syl 18 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ Ring) |
| 5 | deg1addlt.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
| 6 | deg1addlt.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 7 | deg1addlt.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑌) | |
| 8 | deg1addlt.p | . . . . 5 ⊢ + = (+g‘𝑌) | |
| 9 | 7, 8 | ringacl 20360 | . . . 4 ⊢ ((𝑌 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (𝐹 + 𝐺) ∈ 𝐵) |
| 10 | 4, 5, 6, 9 | syl3anc 1396 | . . 3 ⊢ (𝜑 → (𝐹 + 𝐺) ∈ 𝐵) |
| 11 | deg1addlt.d | . . . 4 ⊢ 𝐷 = (deg1‘𝑅) | |
| 12 | 11, 2, 7 | deg1xrcl 26218 | . . 3 ⊢ ((𝐹 + 𝐺) ∈ 𝐵 → (𝐷‘(𝐹 + 𝐺)) ∈ ℝ*) |
| 13 | 10, 12 | syl 18 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) ∈ ℝ*) |
| 14 | 11, 2, 7 | deg1xrcl 26218 | . . . 4 ⊢ (𝐺 ∈ 𝐵 → (𝐷‘𝐺) ∈ ℝ*) |
| 15 | 6, 14 | syl 18 | . . 3 ⊢ (𝜑 → (𝐷‘𝐺) ∈ ℝ*) |
| 16 | 11, 2, 7 | deg1xrcl 26218 | . . . 4 ⊢ (𝐹 ∈ 𝐵 → (𝐷‘𝐹) ∈ ℝ*) |
| 17 | 5, 16 | syl 18 | . . 3 ⊢ (𝜑 → (𝐷‘𝐹) ∈ ℝ*) |
| 18 | 15, 17 | ifcld 4533 | . 2 ⊢ (𝜑 → if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) ∈ ℝ*) |
| 19 | deg1addlt.l | . 2 ⊢ (𝜑 → 𝐿 ∈ ℝ*) | |
| 20 | 2, 11, 1, 7, 8, 5, 6 | deg1addle 26237 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) ≤ if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹))) |
| 21 | deg1addlt.1 | . . 3 ⊢ (𝜑 → (𝐷‘𝐹) < 𝐿) | |
| 22 | deg1addlt.2 | . . 3 ⊢ (𝜑 → (𝐷‘𝐺) < 𝐿) | |
| 23 | xrmaxlt 13206 | . . . 4 ⊢ (((𝐷‘𝐹) ∈ ℝ* ∧ (𝐷‘𝐺) ∈ ℝ* ∧ 𝐿 ∈ ℝ*) → (if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿 ↔ ((𝐷‘𝐹) < 𝐿 ∧ (𝐷‘𝐺) < 𝐿))) | |
| 24 | 17, 15, 19, 23 | syl3anc 1396 | . . 3 ⊢ (𝜑 → (if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿 ↔ ((𝐷‘𝐹) < 𝐿 ∧ (𝐷‘𝐺) < 𝐿))) |
| 25 | 21, 22, 24 | mpbir2and 725 | . 2 ⊢ (𝜑 → if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿) |
| 26 | 13, 18, 19, 20, 25 | xrlelttrd 13184 | 1 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) < 𝐿) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∈ wcel 2141 ifcif 4486 class class class wbr 5108 ‘cfv 6536 (class class class)co 7410 ℝ*cxr 11241 < clt 11242 ≤ cle 11243 Basecbs 17268 +gcplusg 17309 Ringcrg 20314 Poly1cpl1 22316 deg1cdg1 26190 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 ax-addf 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-iin 4958 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-of 7674 df-ofr 7675 df-om 7862 df-1st 7985 df-2nd 7986 df-supp 8156 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-er 8693 df-map 8825 df-pm 8826 df-ixp 8895 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-fsupp 9321 df-sup 9401 df-oi 9471 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-2 12302 df-3 12303 df-4 12304 df-5 12305 df-6 12306 df-7 12307 df-8 12308 df-9 12309 df-n0 12504 df-z 12591 df-dec 12711 df-uz 12862 df-fz 13535 df-fzo 13682 df-seq 14037 df-hash 14366 df-struct 17206 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-ress 17290 df-plusg 17322 df-mulr 17323 df-starv 17324 df-sca 17325 df-vsca 17326 df-ip 17327 df-tset 17328 df-ple 17329 df-ds 17331 df-unif 17332 df-hom 17333 df-cco 17334 df-0g 17493 df-gsum 17494 df-prds 17499 df-pws 17501 df-mre 17637 df-mrc 17638 df-acs 17640 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-mhm 18840 df-submnd 18841 df-grp 19002 df-minusg 19003 df-mulg 19133 df-subg 19188 df-ghm 19283 df-cntz 19386 df-cmn 19851 df-abl 19852 df-mgp 20216 df-rng 20230 df-ur 20263 df-ring 20316 df-cring 20317 df-subrng 20630 df-subrg 20654 df-cnfld 21502 df-psr 22038 df-mpl 22040 df-opsr 22042 df-psr1 22319 df-ply1 22321 df-mdeg 26191 df-deg1 26192 |
| This theorem is referenced by: q1pdir 33859 rtelextdg2lem 34082 |
| Copyright terms: Public domain | W3C validator |