![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > prodge0rd | Structured version Visualization version GIF version |
Description: Infer that a multiplicand is nonnegative from a positive multiplier and nonnegative product. (Contributed by NM, 2-Jul-2005.) (Revised by Mario Carneiro, 27-May-2016.) (Revised by AV, 9-Jul-2022.) |
Ref | Expression |
---|---|
prodge0rd.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ+) |
prodge0rd.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
prodge0rd.3 | ⊢ (𝜑 → 0 ≤ (𝐴 · 𝐵)) |
Ref | Expression |
---|---|
prodge0rd | ⊢ (𝜑 → 0 ≤ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0red 11293 | . 2 ⊢ (𝜑 → 0 ∈ ℝ) | |
2 | prodge0rd.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
3 | prodge0rd.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ+) | |
4 | 3 | rpred 13099 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ) |
5 | 4, 2 | remulcld 11320 | . . . 4 ⊢ (𝜑 → (𝐴 · 𝐵) ∈ ℝ) |
6 | prodge0rd.3 | . . . 4 ⊢ (𝜑 → 0 ≤ (𝐴 · 𝐵)) | |
7 | 1, 5, 6 | lensymd 11441 | . . 3 ⊢ (𝜑 → ¬ (𝐴 · 𝐵) < 0) |
8 | 4 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 0 < -𝐵) → 𝐴 ∈ ℝ) |
9 | 2 | renegcld 11717 | . . . . . . . 8 ⊢ (𝜑 → -𝐵 ∈ ℝ) |
10 | 9 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 0 < -𝐵) → -𝐵 ∈ ℝ) |
11 | 3 | rpgt0d 13102 | . . . . . . . 8 ⊢ (𝜑 → 0 < 𝐴) |
12 | 11 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 0 < -𝐵) → 0 < 𝐴) |
13 | simpr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 0 < -𝐵) → 0 < -𝐵) | |
14 | 8, 10, 12, 13 | mulgt0d 11445 | . . . . . 6 ⊢ ((𝜑 ∧ 0 < -𝐵) → 0 < (𝐴 · -𝐵)) |
15 | 4 | recnd 11318 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
16 | 15 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 0 < -𝐵) → 𝐴 ∈ ℂ) |
17 | 2 | recnd 11318 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
18 | 17 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 0 < -𝐵) → 𝐵 ∈ ℂ) |
19 | 16, 18 | mulneg2d 11744 | . . . . . 6 ⊢ ((𝜑 ∧ 0 < -𝐵) → (𝐴 · -𝐵) = -(𝐴 · 𝐵)) |
20 | 14, 19 | breqtrd 5192 | . . . . 5 ⊢ ((𝜑 ∧ 0 < -𝐵) → 0 < -(𝐴 · 𝐵)) |
21 | 20 | ex 412 | . . . 4 ⊢ (𝜑 → (0 < -𝐵 → 0 < -(𝐴 · 𝐵))) |
22 | 2 | lt0neg1d 11859 | . . . 4 ⊢ (𝜑 → (𝐵 < 0 ↔ 0 < -𝐵)) |
23 | 5 | lt0neg1d 11859 | . . . 4 ⊢ (𝜑 → ((𝐴 · 𝐵) < 0 ↔ 0 < -(𝐴 · 𝐵))) |
24 | 21, 22, 23 | 3imtr4d 294 | . . 3 ⊢ (𝜑 → (𝐵 < 0 → (𝐴 · 𝐵) < 0)) |
25 | 7, 24 | mtod 198 | . 2 ⊢ (𝜑 → ¬ 𝐵 < 0) |
26 | 1, 2, 25 | nltled 11440 | 1 ⊢ (𝜑 → 0 ≤ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2108 class class class wbr 5166 (class class class)co 7448 ℂcc 11182 ℝcr 11183 0cc0 11184 · cmul 11189 < clt 11324 ≤ cle 11325 -cneg 11521 ℝ+crp 13057 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-po 5607 df-so 5608 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-rp 13058 |
This theorem is referenced by: prodge0ld 13165 oexpneg 16393 evennn02n 16398 nvge0 30705 oexpnegALTV 47551 |
Copyright terms: Public domain | W3C validator |