![]() |
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 8536 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 < 𝐴 ↔ (𝐵 / 𝐶) < (𝐴 / 𝐶))) | |
2 | 1 | 3com12 1168 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 < 𝐴 ↔ (𝐵 / 𝐶) < (𝐴 / 𝐶))) |
3 | 2 | notbid 639 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (¬ 𝐵 < 𝐴 ↔ ¬ (𝐵 / 𝐶) < (𝐴 / 𝐶))) |
4 | lenlt 7763 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) | |
5 | 4 | 3adant3 984 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ ¬ 𝐵 < 𝐴)) |
6 | gt0ap0 8306 | . . . . . . 7 ⊢ ((𝐶 ∈ ℝ ∧ 0 < 𝐶) → 𝐶 # 0) | |
7 | 6 | 3adant1 982 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 0 < 𝐶) → 𝐶 # 0) |
8 | redivclap 8404 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 𝐶 # 0) → (𝐴 / 𝐶) ∈ ℝ) | |
9 | 7, 8 | syld3an3 1244 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 0 < 𝐶) → (𝐴 / 𝐶) ∈ ℝ) |
10 | 9 | 3expb 1165 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 / 𝐶) ∈ ℝ) |
11 | 10 | 3adant2 983 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 / 𝐶) ∈ ℝ) |
12 | 6 | 3adant1 982 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 0 < 𝐶) → 𝐶 # 0) |
13 | redivclap 8404 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 𝐶 # 0) → (𝐵 / 𝐶) ∈ ℝ) | |
14 | 12, 13 | syld3an3 1244 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 0 < 𝐶) → (𝐵 / 𝐶) ∈ ℝ) |
15 | 14 | 3expb 1165 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 / 𝐶) ∈ ℝ) |
16 | 15 | 3adant1 982 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 / 𝐶) ∈ ℝ) |
17 | 11, 16 | lenltd 7803 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 / 𝐶) ≤ (𝐵 / 𝐶) ↔ ¬ (𝐵 / 𝐶) < (𝐴 / 𝐶))) |
18 | 3, 5, 17 | 3bitr4d 219 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ (𝐴 / 𝐶) ≤ (𝐵 / 𝐶))) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 945 ∈ wcel 1463 class class class wbr 3895 (class class class)co 5728 ℝcr 7546 0cc0 7547 < clt 7724 ≤ cle 7725 # cap 8261 / cdiv 8345 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 586 ax-in2 587 ax-io 681 ax-5 1406 ax-7 1407 ax-gen 1408 ax-ie1 1452 ax-ie2 1453 ax-8 1465 ax-10 1466 ax-11 1467 ax-i12 1468 ax-bndl 1469 ax-4 1470 ax-13 1474 ax-14 1475 ax-17 1489 ax-i9 1493 ax-ial 1497 ax-i5r 1498 ax-ext 2097 ax-sep 4006 ax-pow 4058 ax-pr 4091 ax-un 4315 ax-setind 4412 ax-cnex 7636 ax-resscn 7637 ax-1cn 7638 ax-1re 7639 ax-icn 7640 ax-addcl 7641 ax-addrcl 7642 ax-mulcl 7643 ax-mulrcl 7644 ax-addcom 7645 ax-mulcom 7646 ax-addass 7647 ax-mulass 7648 ax-distr 7649 ax-i2m1 7650 ax-0lt1 7651 ax-1rid 7652 ax-0id 7653 ax-rnegex 7654 ax-precex 7655 ax-cnre 7656 ax-pre-ltirr 7657 ax-pre-ltwlin 7658 ax-pre-lttrn 7659 ax-pre-apti 7660 ax-pre-ltadd 7661 ax-pre-mulgt0 7662 ax-pre-mulext 7663 |
This theorem depends on definitions: df-bi 116 df-3an 947 df-tru 1317 df-fal 1320 df-nf 1420 df-sb 1719 df-eu 1978 df-mo 1979 df-clab 2102 df-cleq 2108 df-clel 2111 df-nfc 2244 df-ne 2283 df-nel 2378 df-ral 2395 df-rex 2396 df-reu 2397 df-rmo 2398 df-rab 2399 df-v 2659 df-sbc 2879 df-dif 3039 df-un 3041 df-in 3043 df-ss 3050 df-pw 3478 df-sn 3499 df-pr 3500 df-op 3502 df-uni 3703 df-br 3896 df-opab 3950 df-id 4175 df-po 4178 df-iso 4179 df-xp 4505 df-rel 4506 df-cnv 4507 df-co 4508 df-dm 4509 df-iota 5046 df-fun 5083 df-fv 5089 df-riota 5684 df-ov 5731 df-oprab 5732 df-mpo 5733 df-pnf 7726 df-mnf 7727 df-xr 7728 df-ltxr 7729 df-le 7730 df-sub 7858 df-neg 7859 df-reap 8255 df-ap 8262 df-div 8346 |
This theorem is referenced by: ge0div 8539 ledivmul 8545 lediv23 8561 lediv1d 9429 icccntr 9676 sin01bnd 11315 cos01bnd 11316 sin02gt0 11321 hashdvds 11742 |
Copyright terms: Public domain | W3C validator |