| 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 26269. (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 22418 | . . . . 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 20368 | . . . 4 ⊢ ((𝑌 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (𝐹 + 𝐺) ∈ 𝐵) |
| 10 | 4, 5, 6, 9 | syl3anc 1397 | . . 3 ⊢ (𝜑 → (𝐹 + 𝐺) ∈ 𝐵) |
| 11 | deg1addlt.d | . . . 4 ⊢ 𝐷 = (deg1‘𝑅) | |
| 12 | 11, 2, 7 | deg1xrcl 26250 | . . 3 ⊢ ((𝐹 + 𝐺) ∈ 𝐵 → (𝐷‘(𝐹 + 𝐺)) ∈ ℝ*) |
| 13 | 10, 12 | syl 18 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) ∈ ℝ*) |
| 14 | 11, 2, 7 | deg1xrcl 26250 | . . . 4 ⊢ (𝐺 ∈ 𝐵 → (𝐷‘𝐺) ∈ ℝ*) |
| 15 | 6, 14 | syl 18 | . . 3 ⊢ (𝜑 → (𝐷‘𝐺) ∈ ℝ*) |
| 16 | 11, 2, 7 | deg1xrcl 26250 | . . . 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 26269 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) ≤ if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹))) |
| 21 | deg1addlt.1 | . . 3 ⊢ (𝜑 → (𝐷‘𝐹) < 𝐿) | |
| 22 | deg1addlt.2 | . . 3 ⊢ (𝜑 → (𝐷‘𝐺) < 𝐿) | |
| 23 | xrmaxlt 13213 | . . . 4 ⊢ (((𝐷‘𝐹) ∈ ℝ* ∧ (𝐷‘𝐺) ∈ ℝ* ∧ 𝐿 ∈ ℝ*) → (if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿 ↔ ((𝐷‘𝐹) < 𝐿 ∧ (𝐷‘𝐺) < 𝐿))) | |
| 24 | 17, 15, 19, 23 | syl3anc 1397 | . . 3 ⊢ (𝜑 → (if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿 ↔ ((𝐷‘𝐹) < 𝐿 ∧ (𝐷‘𝐺) < 𝐿))) |
| 25 | 21, 22, 24 | mpbir2and 725 | . 2 ⊢ (𝜑 → if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿) |
| 26 | 13, 18, 19, 20, 25 | xrlelttrd 13191 | 1 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) < 𝐿) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ifcif 4486 class class class wbr 5108 ‘cfv 6536 (class class class)co 7412 ℝ*cxr 11248 < clt 11249 ≤ cle 11250 Basecbs 17275 +gcplusg 17316 Ringcrg 20321 Poly1cpl1 22348 deg1cdg1 26222 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 ax-addf 11185 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 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 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-se 5614 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 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 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7676 df-ofr 7677 df-om 7861 df-1st 7984 df-2nd 7985 df-supp 8155 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-2o 8452 df-er 8692 df-map 8824 df-pm 8825 df-ixp 8894 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fsupp 9320 df-sup 9400 df-oi 9470 df-card 9932 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-nn 12240 df-2 12309 df-3 12310 df-4 12311 df-5 12312 df-6 12313 df-7 12314 df-8 12315 df-9 12316 df-n0 12511 df-z 12598 df-dec 12718 df-uz 12869 df-fz 13542 df-fzo 13690 df-seq 14045 df-hash 14374 df-struct 17213 df-sets 17230 df-slot 17248 df-ndx 17260 df-base 17276 df-ress 17297 df-plusg 17329 df-mulr 17330 df-starv 17331 df-sca 17332 df-vsca 17333 df-ip 17334 df-tset 17335 df-ple 17336 df-ds 17338 df-unif 17339 df-hom 17340 df-cco 17341 df-0g 17500 df-gsum 17501 df-prds 17506 df-pws 17508 df-mre 17644 df-mrc 17645 df-acs 17647 df-mgm 18704 df-sgrp 18783 df-mnd 18799 df-mhm 18847 df-submnd 18848 df-grp 19009 df-minusg 19010 df-mulg 19140 df-subg 19195 df-ghm 19290 df-cntz 19393 df-cmn 19858 df-abl 19859 df-mgp 20223 df-rng 20237 df-ur 20270 df-ring 20323 df-cring 20324 df-subrng 20656 df-subrg 20680 df-cnfld 21534 df-psr 22070 df-mpl 22072 df-opsr 22074 df-psr1 22351 df-ply1 22353 df-mdeg 26223 df-deg1 26224 |
| This theorem is used by: q1pdir 33902 rtelextdg2lem 34125 |
| Copyright terms: Public domain | W3C validator |