| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > prodge02 | GIF version | ||
| Description: Infer that a multiplier is nonnegative from a positive multiplicand and nonnegative product. (Contributed by NM, 2-Jul-2005.) |
| Ref | Expression |
|---|---|
| prodge02 | ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (0 < 𝐵 ∧ 0 ≤ (𝐴 · 𝐵))) → 0 ≤ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | recn 8093 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 2 | recn 8093 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
| 3 | mulcom 8089 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) = (𝐵 · 𝐴)) | |
| 4 | 1, 2, 3 | syl2an 289 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 · 𝐵) = (𝐵 · 𝐴)) |
| 5 | 4 | breq2d 4071 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐴 · 𝐵) ↔ 0 ≤ (𝐵 · 𝐴))) |
| 6 | 5 | biimpd 144 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐴 · 𝐵) → 0 ≤ (𝐵 · 𝐴))) |
| 7 | prodge0 8962 | . . . . 5 ⊢ (((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (0 < 𝐵 ∧ 0 ≤ (𝐵 · 𝐴))) → 0 ≤ 𝐴) | |
| 8 | 7 | ex 115 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((0 < 𝐵 ∧ 0 ≤ (𝐵 · 𝐴)) → 0 ≤ 𝐴)) |
| 9 | 8 | ancoms 268 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 < 𝐵 ∧ 0 ≤ (𝐵 · 𝐴)) → 0 ≤ 𝐴)) |
| 10 | 6, 9 | sylan2d 294 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 < 𝐵 ∧ 0 ≤ (𝐴 · 𝐵)) → 0 ≤ 𝐴)) |
| 11 | 10 | imp 124 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (0 < 𝐵 ∧ 0 ≤ (𝐴 · 𝐵))) → 0 ≤ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 ∈ wcel 2178 class class class wbr 4059 (class class class)co 5967 ℂcc 7958 ℝcr 7959 0cc0 7960 · cmul 7965 < clt 8142 ≤ cle 8143 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-sep 4178 ax-pow 4234 ax-pr 4269 ax-un 4498 ax-setind 4603 ax-cnex 8051 ax-resscn 8052 ax-1cn 8053 ax-1re 8054 ax-icn 8055 ax-addcl 8056 ax-addrcl 8057 ax-mulcl 8058 ax-mulrcl 8059 ax-addcom 8060 ax-mulcom 8061 ax-addass 8062 ax-distr 8064 ax-i2m1 8065 ax-0id 8068 ax-rnegex 8069 ax-cnre 8071 ax-pre-ltadd 8076 ax-pre-mulgt0 8077 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-nel 2474 df-ral 2491 df-rex 2492 df-reu 2493 df-rab 2495 df-v 2778 df-sbc 3006 df-dif 3176 df-un 3178 df-in 3180 df-ss 3187 df-pw 3628 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-br 4060 df-opab 4122 df-id 4358 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-iota 5251 df-fun 5292 df-fv 5298 df-riota 5922 df-ov 5970 df-oprab 5971 df-mpo 5972 df-pnf 8144 df-mnf 8145 df-xr 8146 df-ltxr 8147 df-le 8148 df-sub 8280 df-neg 8281 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |