| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ltdiv1 | GIF version | ||
| Description: Division of both sides of 'less than' by a positive number. (Contributed by NM, 10-Oct-2004.) (Revised by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| ltdiv1 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 ↔ (𝐴 / 𝐶) < (𝐵 / 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1024 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐴 ∈ ℝ) | |
| 2 | simp2 1025 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐵 ∈ ℝ) | |
| 3 | simp3l 1052 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐶 ∈ ℝ) | |
| 4 | simp3r 1053 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 0 < 𝐶) | |
| 5 | 3, 4 | gt0ap0d 8903 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐶 # 0) |
| 6 | 3, 5 | rerecclapd 9108 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (1 / 𝐶) ∈ ℝ) |
| 7 | recgt0 9124 | . . . 4 ⊢ ((𝐶 ∈ ℝ ∧ 0 < 𝐶) → 0 < (1 / 𝐶)) | |
| 8 | 7 | 3ad2ant3 1047 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 0 < (1 / 𝐶)) |
| 9 | ltmul1 8866 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ ((1 / 𝐶) ∈ ℝ ∧ 0 < (1 / 𝐶))) → (𝐴 < 𝐵 ↔ (𝐴 · (1 / 𝐶)) < (𝐵 · (1 / 𝐶)))) | |
| 10 | 1, 2, 6, 8, 9 | syl112anc 1278 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 ↔ (𝐴 · (1 / 𝐶)) < (𝐵 · (1 / 𝐶)))) |
| 11 | 1 | recnd 8302 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐴 ∈ ℂ) |
| 12 | 3 | recnd 8302 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐶 ∈ ℂ) |
| 13 | 11, 12, 5 | divrecapd 9067 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 / 𝐶) = (𝐴 · (1 / 𝐶))) |
| 14 | 2 | recnd 8302 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐵 ∈ ℂ) |
| 15 | 14, 12, 5 | divrecapd 9067 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 / 𝐶) = (𝐵 · (1 / 𝐶))) |
| 16 | 13, 15 | breq12d 4122 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 / 𝐶) < (𝐵 / 𝐶) ↔ (𝐴 · (1 / 𝐶)) < (𝐵 · (1 / 𝐶)))) |
| 17 | 10, 16 | bitr4d 191 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 ↔ (𝐴 / 𝐶) < (𝐵 / 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1005 ∈ wcel 2203 class class class wbr 4109 (class class class)co 6050 ℝcr 8126 0cc0 8127 1c1 8128 · cmul 8132 < clt 8308 / cdiv 8946 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-mulrcl 8226 ax-addcom 8227 ax-mulcom 8228 ax-addass 8229 ax-mulass 8230 ax-distr 8231 ax-i2m1 8232 ax-0lt1 8233 ax-1rid 8234 ax-0id 8235 ax-rnegex 8236 ax-precex 8237 ax-cnre 8238 ax-pre-ltirr 8239 ax-pre-ltwlin 8240 ax-pre-lttrn 8241 ax-pre-apti 8242 ax-pre-ltadd 8243 ax-pre-mulgt0 8244 ax-pre-mulext 8245 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2815 df-sbc 3043 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-br 4110 df-opab 4172 df-id 4414 df-po 4417 df-iso 4418 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-iota 5312 df-fun 5354 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 df-sub 8446 df-neg 8447 df-reap 8849 df-ap 8856 df-div 8947 |
| This theorem is referenced by: lediv1 9143 gt0div 9144 ltmuldiv 9148 ltdivmul 9150 ltdiv23 9166 ltdiv1i 9195 ltdiv1d 10075 flltdivnn0lt 10664 flqdiv 10683 hashdvds 12918 hashgcdlem 12935 sinq12gt0 15695 lgsquadlem1 15950 lgsquadlem2 15951 2lgslem1a2 15960 |
| Copyright terms: Public domain | W3C validator |