| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lediv1 | GIF version | ||
| Description: Division of both sides of a less than or equal to relation by a positive number. (Contributed by NM, 18-Nov-2004.) |
| Ref | Expression |
|---|---|
| lediv1 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ (𝐴 / 𝐶) ≤ (𝐵 / 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltdiv1 8940 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 < 𝐴 ↔ (𝐵 / 𝐶) < (𝐴 / 𝐶))) | |
| 2 | 1 | 3com12 1209 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 < 𝐴 ↔ (𝐵 / 𝐶) < (𝐴 / 𝐶))) |
| 3 | 2 | notbid 668 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (¬ 𝐵 < 𝐴 ↔ ¬ (𝐵 / 𝐶) < (𝐴 / 𝐶))) |
| 4 | lenlt 8147 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
| 5 | 4 | 3adant3 1019 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
| 6 | gt0ap0 8698 | . . . . . . 7 ⊢ ((𝐶 ∈ ℝ ∧ 0 < 𝐶) → 𝐶 # 0) | |
| 7 | 6 | 3adant1 1017 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 0 < 𝐶) → 𝐶 # 0) |
| 8 | redivclap 8803 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 𝐶 # 0) → (𝐴 / 𝐶) ∈ ℝ) | |
| 9 | 7, 8 | syld3an3 1294 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 0 < 𝐶) → (𝐴 / 𝐶) ∈ ℝ) |
| 10 | 9 | 3expb 1206 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 / 𝐶) ∈ ℝ) |
| 11 | 10 | 3adant2 1018 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 / 𝐶) ∈ ℝ) |
| 12 | 6 | 3adant1 1017 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 0 < 𝐶) → 𝐶 # 0) |
| 13 | redivclap 8803 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 𝐶 # 0) → (𝐵 / 𝐶) ∈ ℝ) | |
| 14 | 12, 13 | syld3an3 1294 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 0 < 𝐶) → (𝐵 / 𝐶) ∈ ℝ) |
| 15 | 14 | 3expb 1206 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 / 𝐶) ∈ ℝ) |
| 16 | 15 | 3adant1 1017 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 / 𝐶) ∈ ℝ) |
| 17 | 11, 16 | lenltd 8189 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 / 𝐶) ≤ (𝐵 / 𝐶) ↔ ¬ (𝐵 / 𝐶) < (𝐴 / 𝐶))) |
| 18 | 3, 5, 17 | 3bitr4d 220 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ (𝐴 / 𝐶) ≤ (𝐵 / 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 980 ∈ wcel 2175 class class class wbr 4043 (class class class)co 5943 ℝcr 7923 0cc0 7924 < clt 8106 ≤ cle 8107 # cap 8653 / cdiv 8744 |
| 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 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4479 ax-setind 4584 ax-cnex 8015 ax-resscn 8016 ax-1cn 8017 ax-1re 8018 ax-icn 8019 ax-addcl 8020 ax-addrcl 8021 ax-mulcl 8022 ax-mulrcl 8023 ax-addcom 8024 ax-mulcom 8025 ax-addass 8026 ax-mulass 8027 ax-distr 8028 ax-i2m1 8029 ax-0lt1 8030 ax-1rid 8031 ax-0id 8032 ax-rnegex 8033 ax-precex 8034 ax-cnre 8035 ax-pre-ltirr 8036 ax-pre-ltwlin 8037 ax-pre-lttrn 8038 ax-pre-apti 8039 ax-pre-ltadd 8040 ax-pre-mulgt0 8041 ax-pre-mulext 8042 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-nel 2471 df-ral 2488 df-rex 2489 df-reu 2490 df-rmo 2491 df-rab 2492 df-v 2773 df-sbc 2998 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-br 4044 df-opab 4105 df-id 4339 df-po 4342 df-iso 4343 df-xp 4680 df-rel 4681 df-cnv 4682 df-co 4683 df-dm 4684 df-iota 5231 df-fun 5272 df-fv 5278 df-riota 5898 df-ov 5946 df-oprab 5947 df-mpo 5948 df-pnf 8108 df-mnf 8109 df-xr 8110 df-ltxr 8111 df-le 8112 df-sub 8244 df-neg 8245 df-reap 8647 df-ap 8654 df-div 8745 |
| This theorem is referenced by: ge0div 8943 ledivmul 8949 lediv23 8965 lediv1d 9864 icccntr 10121 sin01bnd 12010 cos01bnd 12011 sin02gt0 12017 hashdvds 12485 cosordlem 15263 gausslemma2dlem1a 15477 gausslemma2dlem3 15482 lgseisenlem1 15489 2lgslem1c 15509 |
| Copyright terms: Public domain | W3C validator |