![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > leltadd | GIF version |
Description: Adding both sides of two orderings. (Contributed by NM, 15-Aug-2008.) |
Ref | Expression |
---|---|
leltadd | ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 < 𝐷) → (𝐴 + 𝐵) < (𝐶 + 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltleadd 7922 | . . . . 5 ⊢ (((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (𝐷 ∈ ℝ ∧ 𝐶 ∈ ℝ)) → ((𝐵 < 𝐷 ∧ 𝐴 ≤ 𝐶) → (𝐵 + 𝐴) < (𝐷 + 𝐶))) | |
2 | 1 | ancomsd 265 | . . . 4 ⊢ (((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (𝐷 ∈ ℝ ∧ 𝐶 ∈ ℝ)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 < 𝐷) → (𝐵 + 𝐴) < (𝐷 + 𝐶))) |
3 | 2 | ancom2s 533 | . . 3 ⊢ (((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 < 𝐷) → (𝐵 + 𝐴) < (𝐷 + 𝐶))) |
4 | 3 | ancom1s 536 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 < 𝐷) → (𝐵 + 𝐴) < (𝐷 + 𝐶))) |
5 | recn 7473 | . . . 4 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
6 | recn 7473 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
7 | addcom 7617 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴)) | |
8 | 5, 6, 7 | syl2an 283 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) = (𝐵 + 𝐴)) |
9 | recn 7473 | . . . 4 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℂ) | |
10 | recn 7473 | . . . 4 ⊢ (𝐷 ∈ ℝ → 𝐷 ∈ ℂ) | |
11 | addcom 7617 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → (𝐶 + 𝐷) = (𝐷 + 𝐶)) | |
12 | 9, 10, 11 | syl2an 283 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ) → (𝐶 + 𝐷) = (𝐷 + 𝐶)) |
13 | 8, 12 | breqan12d 3860 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 + 𝐵) < (𝐶 + 𝐷) ↔ (𝐵 + 𝐴) < (𝐷 + 𝐶))) |
14 | 4, 13 | sylibrd 167 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 < 𝐷) → (𝐴 + 𝐵) < (𝐶 + 𝐷))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 = wceq 1289 ∈ wcel 1438 class class class wbr 3845 (class class class)co 5652 ℂcc 7346 ℝcr 7347 + caddc 7351 < clt 7520 ≤ cle 7521 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 579 ax-in2 580 ax-io 665 ax-5 1381 ax-7 1382 ax-gen 1383 ax-ie1 1427 ax-ie2 1428 ax-8 1440 ax-10 1441 ax-11 1442 ax-i12 1443 ax-bndl 1444 ax-4 1445 ax-13 1449 ax-14 1450 ax-17 1464 ax-i9 1468 ax-ial 1472 ax-i5r 1473 ax-ext 2070 ax-sep 3957 ax-pow 4009 ax-pr 4036 ax-un 4260 ax-setind 4353 ax-cnex 7434 ax-resscn 7435 ax-1cn 7436 ax-icn 7438 ax-addcl 7439 ax-addrcl 7440 ax-mulcl 7441 ax-addcom 7443 ax-addass 7445 ax-i2m1 7448 ax-0id 7451 ax-rnegex 7452 ax-pre-ltwlin 7456 ax-pre-ltadd 7459 |
This theorem depends on definitions: df-bi 115 df-3an 926 df-tru 1292 df-fal 1295 df-nf 1395 df-sb 1693 df-eu 1951 df-mo 1952 df-clab 2075 df-cleq 2081 df-clel 2084 df-nfc 2217 df-ne 2256 df-nel 2351 df-ral 2364 df-rex 2365 df-rab 2368 df-v 2621 df-dif 3001 df-un 3003 df-in 3005 df-ss 3012 df-pw 3431 df-sn 3452 df-pr 3453 df-op 3455 df-uni 3654 df-br 3846 df-opab 3900 df-xp 4444 df-cnv 4446 df-iota 4980 df-fv 5023 df-ov 5655 df-pnf 7522 df-mnf 7523 df-xr 7524 df-ltxr 7525 df-le 7526 |
This theorem is referenced by: addgegt0 7925 leltaddd 8041 |
Copyright terms: Public domain | W3C validator |