| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > axmulgt0 | GIF version | ||
| Description: The product of two positive reals is positive. Axiom for real and complex numbers, derived from set theory. (This restates ax-pre-mulgt0 8296 with ordering on the extended reals.) (Contributed by NM, 13-Oct-2005.) |
| Ref | Expression |
|---|---|
| axmulgt0 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 < 𝐴 ∧ 0 < 𝐵) → 0 < (𝐴 · 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-pre-mulgt0 8296 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵) → 0 <ℝ (𝐴 · 𝐵))) | |
| 2 | 0re 8326 | . . . 4 ⊢ 0 ∈ ℝ | |
| 3 | ltxrlt 8391 | . . . 4 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (0 < 𝐴 ↔ 0 <ℝ 𝐴)) | |
| 4 | 2, 3 | mpan 428 | . . 3 ⊢ (𝐴 ∈ ℝ → (0 < 𝐴 ↔ 0 <ℝ 𝐴)) |
| 5 | ltxrlt 8391 | . . . 4 ⊢ ((0 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 < 𝐵 ↔ 0 <ℝ 𝐵)) | |
| 6 | 2, 5 | mpan 428 | . . 3 ⊢ (𝐵 ∈ ℝ → (0 < 𝐵 ↔ 0 <ℝ 𝐵)) |
| 7 | 4, 6 | bi2anan9 614 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 < 𝐴 ∧ 0 < 𝐵) ↔ (0 <ℝ 𝐴 ∧ 0 <ℝ 𝐵))) |
| 8 | remulcl 8307 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 · 𝐵) ∈ ℝ) | |
| 9 | ltxrlt 8391 | . . 3 ⊢ ((0 ∈ ℝ ∧ (𝐴 · 𝐵) ∈ ℝ) → (0 < (𝐴 · 𝐵) ↔ 0 <ℝ (𝐴 · 𝐵))) | |
| 10 | 2, 8, 9 | sylancr 418 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 < (𝐴 · 𝐵) ↔ 0 <ℝ (𝐴 · 𝐵))) |
| 11 | 1, 7, 10 | 3imtr4d 203 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 < 𝐴 ∧ 0 < 𝐵) → 0 < (𝐴 · 𝐵))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2209 class class class wbr 4130 (class class class)co 6085 ℝcr 8178 0cc0 8179 <ℝ cltrr 8183 · cmul 8184 < clt 8360 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1re 8273 ax-addrcl 8276 ax-mulrcl 8278 ax-rnegex 8288 ax-pre-mulgt0 8296 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-xp 4780 df-pnf 8362 df-mnf 8363 df-ltxr 8365 |
| This theorem is used by: mulgt0 8400 mulgt0i 8435 sin02gt0 12531 sinq12gt0 15931 |
| Copyright terms: Public domain | W3C validator |