| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Multiplication of both sides of 'less than or equal to' by a positive number. |
| Ref | Expression |
|---|---|
| ltplus1.1 | ⊢ A ∈ ℝ |
| ltmul1.2 | ⊢ B ∈ ℝ |
| ltmul1.3 | ⊢ C ∈ ℝ |
| Ref | Expression |
|---|---|
| lemul2 | ⊢ (0 < C → (A ≤ B ↔ (C · A) ≤ (C · B))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltplus1.1 | . . . 4 ⊢ A ∈ ℝ | |
| 2 | ltmul1.2 | . . . 4 ⊢ B ∈ ℝ | |
| 3 | ltmul1.3 | . . . 4 ⊢ C ∈ ℝ | |
| 4 | 1, 2, 3 | ltmul2 4395 | . . 3 ⊢ (0 < C → (A < B ↔ (C · A) < (C · B))) |
| 5 | 3 | gt0ne0 4340 | . . . 4 ⊢ (0 < C → C ≠ 0) |
| 6 | 3 | recn 4098 | . . . . . . 7 ⊢ C ∈ ℂ |
| 7 | 1 | recn 4098 | . . . . . . 7 ⊢ A ∈ ℂ |
| 8 | 2 | recn 4098 | . . . . . . 7 ⊢ B ∈ ℂ |
| 9 | 6, 7, 8 | 3pm3.2i 603 | . . . . . 6 ⊢ (C ∈ ℂ ∧ A ∈ ℂ ∧ B ∈ ℂ) |
| 10 | mulcant2 4209 | . . . . . 6 ⊢ (((C ∈ ℂ ∧ A ∈ ℂ ∧ B ∈ ℂ) ∧ C ≠ 0) → ((C · A) = (C · B) ↔ A = B)) | |
| 11 | 9, 10 | mpan 518 | . . . . 5 ⊢ (C ≠ 0 → ((C · A) = (C · B) ↔ A = B)) |
| 12 | 11 | bicomd 399 | . . . 4 ⊢ (C ≠ 0 → (A = B ↔ (C · A) = (C · B))) |
| 13 | 5, 12 | syl 12 | . . 3 ⊢ (0 < C → (A = B ↔ (C · A) = (C · B))) |
| 14 | 4, 13 | orbi12d 475 | . 2 ⊢ (0 < C → ((A < B ∨ A = B) ↔ ((C · A) < (C · B) ∨ (C · A) = (C · B)))) |
| 15 | 1, 2 | leloe 4298 | . 2 ⊢ (A ≤ B ↔ (A < B ∨ A = B)) |
| 16 | 3, 1 | remulcl 4119 | . . 3 ⊢ (C · A) ∈ ℝ |
| 17 | 3, 2 | remulcl 4119 | . . 3 ⊢ (C · B) ∈ ℝ |
| 18 | 16, 17 | leloe 4298 | . 2 ⊢ ((C · A) ≤ (C · B) ↔ ((C · A) < (C · B) ∨ (C · A) = (C · B))) |
| 19 | 14, 15, 18 | 3bitr4g 428 | 1 ⊢ (0 < C → (A ≤ B ↔ (C · A) ≤ (C · B))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 2 ↔ wb 127 ∨ wo 195 ∧ w3a 581 = wceq 1091 ∈ wcel 1092 ≠ wne 1190 class class class wbr 2054 (class class class)co 3001 ℂcc 4026 ℝcr 4027 0cc0 4028 · cmulc 4032 < clt 4033 ≤ cle 4092 |
| This theorem is referenced by: lemul1 4397 lt2sq 4414 discrlem1 4713 nnlesq 4718 abstri 4859 bcs 5101 projlem3 5195 projlem4 5196 projlem18 5210 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-un 1076 ax-pow 1077 ax-reg 1078 ax-inf 1079 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-3or 582 df-3an 583 df-ex 679 df-sb 853 df-eu 1009 df-mo 1010 df-clab 1093 df-cleq 1097 df-clel 1099 df-ne 1192 df-ral 1205 df-rex 1206 df-reu 1207 df-rab 1208 df-v 1349 df-sbc 1441 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-pss 1494 df-nul 1708 df-if 1777 df-pw 1799 df-sn 1811 df-pr 1812 df-tp 1814 df-op 1815 df-uni 1920 df-int 1966 df-iun 1996 df-tr 2042 df-br 2063 df-opab 2098 df-eprel 2122 df-id 2125 df-po 2128 df-so 2138 df-fr 2169 df-we 2186 df-ord 2202 df-on 2203 df-lim 2204 df-suc 2205 df-om 2373 df-xp 2424 df-rel 2425 df-cnv 2426 df-co 2427 df-dm 2428 df-rn 2429 df-res 2430 df-ima 2431 df-fun 2432 df-fn 2433 df-f 2434 df-f1 2435 df-fv 2438 df-rdg 2970 df-opr 3003 df-oprab 3004 df-1o 3104 df-oadd 3106 df-omul 3107 df-er 3200 df-ec 3202 df-qs 3205 df-ni 3794 df-pli 3795 df-mi 3796 df-lti 3797 df-plpq 3829 df-mpq 3830 df-enq 3831 df-nq 3832 df-plq 3833 df-mq 3834 df-rq 3835 df-ltq 3836 df-1q 3837 df-np 3880 df-1p 3881 df-plp 3882 df-mp 3883 df-ltp 3884 df-plpr 3958 df-mpr 3959 df-enr 3960 df-nr 3961 df-plr 3962 df-mr 3963 df-ltr 3964 df-0r 3965 df-1r 3966 df-m1r 3967 df-c 4034 df-0 4035 df-1 4036 df-r 4038 df-plus 4039 df-mul 4040 df-lt 4041 df-sub 4133 df-neg 4135 df-div 4216 df-le 4277 |