![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > lemul2 | GIF version |
Description: Multiplication of both sides of 'less than or equal to' by a positive number. (Contributed by NM, 16-Mar-2005.) |
Ref | Expression |
---|---|
lemul2 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ (𝐶 · 𝐴) ≤ (𝐶 · 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lemul1 8124 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ (𝐴 · 𝐶) ≤ (𝐵 · 𝐶))) | |
2 | recn 7529 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
3 | recn 7529 | . . . . . 6 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℂ) | |
4 | mulcom 7525 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐶) = (𝐶 · 𝐴)) | |
5 | 2, 3, 4 | syl2an 284 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 · 𝐶) = (𝐶 · 𝐴)) |
6 | 5 | 3adant2 963 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 · 𝐶) = (𝐶 · 𝐴)) |
7 | recn 7529 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
8 | mulcom 7525 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 · 𝐶) = (𝐶 · 𝐵)) | |
9 | 7, 3, 8 | syl2an 284 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 · 𝐶) = (𝐶 · 𝐵)) |
10 | 9 | 3adant1 962 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 · 𝐶) = (𝐶 · 𝐵)) |
11 | 6, 10 | breq12d 3864 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 · 𝐶) ≤ (𝐵 · 𝐶) ↔ (𝐶 · 𝐴) ≤ (𝐶 · 𝐵))) |
12 | 11 | 3adant3r 1172 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 · 𝐶) ≤ (𝐵 · 𝐶) ↔ (𝐶 · 𝐴) ≤ (𝐶 · 𝐵))) |
13 | 1, 12 | bitrd 187 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ (𝐶 · 𝐴) ≤ (𝐶 · 𝐵))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 925 = wceq 1290 ∈ wcel 1439 class class class wbr 3851 (class class class)co 5666 ℂcc 7402 ℝcr 7403 0cc0 7404 · cmul 7409 < clt 7576 ≤ cle 7577 |
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 580 ax-in2 581 ax-io 666 ax-5 1382 ax-7 1383 ax-gen 1384 ax-ie1 1428 ax-ie2 1429 ax-8 1441 ax-10 1442 ax-11 1443 ax-i12 1444 ax-bndl 1445 ax-4 1446 ax-13 1450 ax-14 1451 ax-17 1465 ax-i9 1469 ax-ial 1473 ax-i5r 1474 ax-ext 2071 ax-sep 3963 ax-pow 4015 ax-pr 4045 ax-un 4269 ax-setind 4366 ax-cnex 7490 ax-resscn 7491 ax-1cn 7492 ax-1re 7493 ax-icn 7494 ax-addcl 7495 ax-addrcl 7496 ax-mulcl 7497 ax-mulrcl 7498 ax-addcom 7499 ax-mulcom 7500 ax-addass 7501 ax-mulass 7502 ax-distr 7503 ax-i2m1 7504 ax-1rid 7506 ax-0id 7507 ax-rnegex 7508 ax-precex 7509 ax-cnre 7510 ax-pre-ltadd 7515 ax-pre-mulgt0 7516 |
This theorem depends on definitions: df-bi 116 df-3an 927 df-tru 1293 df-fal 1296 df-nf 1396 df-sb 1694 df-eu 1952 df-mo 1953 df-clab 2076 df-cleq 2082 df-clel 2085 df-nfc 2218 df-ne 2257 df-nel 2352 df-ral 2365 df-rex 2366 df-reu 2367 df-rab 2369 df-v 2622 df-sbc 2842 df-dif 3002 df-un 3004 df-in 3006 df-ss 3013 df-pw 3435 df-sn 3456 df-pr 3457 df-op 3459 df-uni 3660 df-br 3852 df-opab 3906 df-id 4129 df-xp 4457 df-rel 4458 df-cnv 4459 df-co 4460 df-dm 4461 df-iota 4993 df-fun 5030 df-fv 5036 df-riota 5622 df-ov 5669 df-oprab 5670 df-mpt2 5671 df-pnf 7578 df-mnf 7579 df-xr 7580 df-ltxr 7581 df-le 7582 df-sub 7709 df-neg 7710 |
This theorem is referenced by: lediv2 8406 lemul2i 8440 lemul2d 9272 nnlesq 10112 |
Copyright terms: Public domain | W3C validator |