| 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 26082. (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 22227 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑌 ∈ Ring) |
| 4 | 1, 3 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ Ring) |
| 5 | deg1addlt.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
| 6 | deg1addlt.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 7 | deg1addlt.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑌) | |
| 8 | deg1addlt.p | . . . . 5 ⊢ + = (+g‘𝑌) | |
| 9 | 7, 8 | ringacl 20256 | . . . 4 ⊢ ((𝑌 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (𝐹 + 𝐺) ∈ 𝐵) |
| 10 | 4, 5, 6, 9 | syl3anc 1374 | . . 3 ⊢ (𝜑 → (𝐹 + 𝐺) ∈ 𝐵) |
| 11 | deg1addlt.d | . . . 4 ⊢ 𝐷 = (deg1‘𝑅) | |
| 12 | 11, 2, 7 | deg1xrcl 26063 | . . 3 ⊢ ((𝐹 + 𝐺) ∈ 𝐵 → (𝐷‘(𝐹 + 𝐺)) ∈ ℝ*) |
| 13 | 10, 12 | syl 17 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) ∈ ℝ*) |
| 14 | 11, 2, 7 | deg1xrcl 26063 | . . . 4 ⊢ (𝐺 ∈ 𝐵 → (𝐷‘𝐺) ∈ ℝ*) |
| 15 | 6, 14 | syl 17 | . . 3 ⊢ (𝜑 → (𝐷‘𝐺) ∈ ℝ*) |
| 16 | 11, 2, 7 | deg1xrcl 26063 | . . . 4 ⊢ (𝐹 ∈ 𝐵 → (𝐷‘𝐹) ∈ ℝ*) |
| 17 | 5, 16 | syl 17 | . . 3 ⊢ (𝜑 → (𝐷‘𝐹) ∈ ℝ*) |
| 18 | 15, 17 | ifcld 4514 | . 2 ⊢ (𝜑 → if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) ∈ ℝ*) |
| 19 | deg1addlt.l | . 2 ⊢ (𝜑 → 𝐿 ∈ ℝ*) | |
| 20 | 2, 11, 1, 7, 8, 5, 6 | deg1addle 26082 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) ≤ if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹))) |
| 21 | deg1addlt.1 | . . 3 ⊢ (𝜑 → (𝐷‘𝐹) < 𝐿) | |
| 22 | deg1addlt.2 | . . 3 ⊢ (𝜑 → (𝐷‘𝐺) < 𝐿) | |
| 23 | xrmaxlt 13130 | . . . 4 ⊢ (((𝐷‘𝐹) ∈ ℝ* ∧ (𝐷‘𝐺) ∈ ℝ* ∧ 𝐿 ∈ ℝ*) → (if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿 ↔ ((𝐷‘𝐹) < 𝐿 ∧ (𝐷‘𝐺) < 𝐿))) | |
| 24 | 17, 15, 19, 23 | syl3anc 1374 | . . 3 ⊢ (𝜑 → (if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿 ↔ ((𝐷‘𝐹) < 𝐿 ∧ (𝐷‘𝐺) < 𝐿))) |
| 25 | 21, 22, 24 | mpbir2and 714 | . 2 ⊢ (𝜑 → if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿) |
| 26 | 13, 18, 19, 20, 25 | xrlelttrd 13108 | 1 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) < 𝐿) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ifcif 4467 class class class wbr 5086 ‘cfv 6496 (class class class)co 7364 ℝ*cxr 11175 < clt 11176 ≤ cle 11177 Basecbs 17176 +gcplusg 17217 Ringcrg 20211 Poly1cpl1 22156 deg1cdg1 26035 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5306 ax-pr 5374 ax-un 7686 ax-cnex 11091 ax-resscn 11092 ax-1cn 11093 ax-icn 11094 ax-addcl 11095 ax-addrcl 11096 ax-mulcl 11097 ax-mulrcl 11098 ax-mulcom 11099 ax-addass 11100 ax-mulass 11101 ax-distr 11102 ax-i2m1 11103 ax-1ne0 11104 ax-1rid 11105 ax-rnegex 11106 ax-rrecex 11107 ax-cnre 11108 ax-pre-lttri 11109 ax-pre-lttrn 11110 ax-pre-ltadd 11111 ax-pre-mulgt0 11112 ax-pre-sup 11113 ax-addf 11114 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5523 df-eprel 5528 df-po 5536 df-so 5537 df-fr 5581 df-se 5582 df-we 5583 df-xp 5634 df-rel 5635 df-cnv 5636 df-co 5637 df-dm 5638 df-rn 5639 df-res 5640 df-ima 5641 df-pred 6263 df-ord 6324 df-on 6325 df-lim 6326 df-suc 6327 df-iota 6452 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-isom 6505 df-riota 7321 df-ov 7367 df-oprab 7368 df-mpo 7369 df-of 7628 df-ofr 7629 df-om 7815 df-1st 7939 df-2nd 7940 df-supp 8108 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-2o 8403 df-er 8640 df-map 8772 df-pm 8773 df-ixp 8843 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-fsupp 9272 df-sup 9352 df-oi 9422 df-card 9860 df-pnf 11178 df-mnf 11179 df-xr 11180 df-ltxr 11181 df-le 11182 df-sub 11376 df-neg 11377 df-nn 12172 df-2 12241 df-3 12242 df-4 12243 df-5 12244 df-6 12245 df-7 12246 df-8 12247 df-9 12248 df-n0 12435 df-z 12522 df-dec 12642 df-uz 12786 df-fz 13459 df-fzo 13606 df-seq 13961 df-hash 14290 df-struct 17114 df-sets 17131 df-slot 17149 df-ndx 17161 df-base 17177 df-ress 17198 df-plusg 17230 df-mulr 17231 df-starv 17232 df-sca 17233 df-vsca 17234 df-ip 17235 df-tset 17236 df-ple 17237 df-ds 17239 df-unif 17240 df-hom 17241 df-cco 17242 df-0g 17401 df-gsum 17402 df-prds 17407 df-pws 17409 df-mre 17545 df-mrc 17546 df-acs 17548 df-mgm 18605 df-sgrp 18684 df-mnd 18700 df-mhm 18748 df-submnd 18749 df-grp 18909 df-minusg 18910 df-mulg 19041 df-subg 19096 df-ghm 19185 df-cntz 19289 df-cmn 19754 df-abl 19755 df-mgp 20119 df-rng 20131 df-ur 20160 df-ring 20213 df-cring 20214 df-subrng 20520 df-subrg 20544 df-cnfld 21351 df-psr 21905 df-mpl 21907 df-opsr 21909 df-psr1 22159 df-ply1 22161 df-mdeg 26036 df-deg1 26037 |
| This theorem is referenced by: q1pdir 33684 rtelextdg2lem 33892 |
| Copyright terms: Public domain | W3C validator |