| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xltmul1 | Structured version Visualization version GIF version | ||
| Description: Extended real version of ltmul1 12092. (Contributed by Mario Carneiro, 20-Aug-2015.) |
| Ref | Expression |
|---|---|
| xltmul1 | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → (𝐴 < 𝐵 ↔ (𝐴 ·e 𝐶) < (𝐵 ·e 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xlemul1 13345 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → (𝐵 ≤ 𝐴 ↔ (𝐵 ·e 𝐶) ≤ (𝐴 ·e 𝐶))) | |
| 2 | 1 | 3com12 1141 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → (𝐵 ≤ 𝐴 ↔ (𝐵 ·e 𝐶) ≤ (𝐴 ·e 𝐶))) |
| 3 | 2 | notbid 321 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → (¬ 𝐵 ≤ 𝐴 ↔ ¬ (𝐵 ·e 𝐶) ≤ (𝐴 ·e 𝐶))) |
| 4 | xrltnle 11303 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴)) | |
| 5 | 4 | 3adant3 1150 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴)) |
| 6 | simp1 1154 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → 𝐴 ∈ ℝ*) | |
| 7 | rpxr 13055 | . . . . 5 ⊢ (𝐶 ∈ ℝ+ → 𝐶 ∈ ℝ*) | |
| 8 | 7 | 3ad2ant3 1153 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → 𝐶 ∈ ℝ*) |
| 9 | xmulcl 13328 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐴 ·e 𝐶) ∈ ℝ*) | |
| 10 | 6, 8, 9 | syl2anc 596 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → (𝐴 ·e 𝐶) ∈ ℝ*) |
| 11 | simp2 1155 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → 𝐵 ∈ ℝ*) | |
| 12 | xmulcl 13328 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐵 ·e 𝐶) ∈ ℝ*) | |
| 13 | 11, 8, 12 | syl2anc 596 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → (𝐵 ·e 𝐶) ∈ ℝ*) |
| 14 | xrltnle 11303 | . . 3 ⊢ (((𝐴 ·e 𝐶) ∈ ℝ* ∧ (𝐵 ·e 𝐶) ∈ ℝ*) → ((𝐴 ·e 𝐶) < (𝐵 ·e 𝐶) ↔ ¬ (𝐵 ·e 𝐶) ≤ (𝐴 ·e 𝐶))) | |
| 15 | 10, 13, 14 | syl2anc 596 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → ((𝐴 ·e 𝐶) < (𝐵 ·e 𝐶) ↔ ¬ (𝐵 ·e 𝐶) ≤ (𝐴 ·e 𝐶))) |
| 16 | 3, 5, 15 | 3bitr4d 314 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐶 ∈ ℝ+) → (𝐴 < 𝐵 ↔ (𝐴 ·e 𝐶) < (𝐵 ·e 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ w3a 1103 ∈ wcel 2145 class class class wbr 5103 (class class class)co 7414 ℝ*cxr 11269 < clt 11270 ≤ cle 11271 ℝ+crp 13045 ·e cxmu 13165 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-1st 7987 df-2nd 7988 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-rp 13046 df-xneg 13166 df-xmul 13168 |
| This theorem is used by: xltmul2 13348 |
| Copyright terms: Public domain | W3C validator |