![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > leltadd | Structured version Visualization version GIF version |
Description: Adding both sides of two orderings. (Contributed by NM, 15-Aug-2008.) |
Ref | Expression |
---|---|
leltadd | ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 < 𝐷) → (𝐴 + 𝐵) < (𝐶 + 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltleadd 11735 | . . . . 5 ⊢ (((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (𝐷 ∈ ℝ ∧ 𝐶 ∈ ℝ)) → ((𝐵 < 𝐷 ∧ 𝐴 ≤ 𝐶) → (𝐵 + 𝐴) < (𝐷 + 𝐶))) | |
2 | 1 | ancomsd 464 | . . . 4 ⊢ (((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (𝐷 ∈ ℝ ∧ 𝐶 ∈ ℝ)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 < 𝐷) → (𝐵 + 𝐴) < (𝐷 + 𝐶))) |
3 | 2 | ancom2s 648 | . . 3 ⊢ (((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 < 𝐷) → (𝐵 + 𝐴) < (𝐷 + 𝐶))) |
4 | 3 | ancom1s 651 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 < 𝐷) → (𝐵 + 𝐴) < (𝐷 + 𝐶))) |
5 | recn 11236 | . . . 4 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
6 | recn 11236 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
7 | addcom 11438 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) = (𝐵 + 𝐴)) | |
8 | 5, 6, 7 | syl2an 594 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) = (𝐵 + 𝐴)) |
9 | recn 11236 | . . . 4 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℂ) | |
10 | recn 11236 | . . . 4 ⊢ (𝐷 ∈ ℝ → 𝐷 ∈ ℂ) | |
11 | addcom 11438 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → (𝐶 + 𝐷) = (𝐷 + 𝐶)) | |
12 | 9, 10, 11 | syl2an 594 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ) → (𝐶 + 𝐷) = (𝐷 + 𝐶)) |
13 | 8, 12 | breqan12d 5168 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 + 𝐵) < (𝐶 + 𝐷) ↔ (𝐵 + 𝐴) < (𝐷 + 𝐶))) |
14 | 4, 13 | sylibrd 258 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 < 𝐷) → (𝐴 + 𝐵) < (𝐶 + 𝐷))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 class class class wbr 5152 (class class class)co 7426 ℂcc 11144 ℝcr 11145 + caddc 11149 < clt 11286 ≤ cle 11287 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-br 5153 df-opab 5215 df-mpt 5236 df-id 5580 df-po 5594 df-so 5595 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-ov 7429 df-er 8731 df-en 8971 df-dom 8972 df-sdom 8973 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 |
This theorem is referenced by: lt2add 11737 addgegt0 11739 leltaddd 11874 fldiv 13865 dp2lt10 32628 |
Copyright terms: Public domain | W3C validator |