![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ltleaddd | Structured version Visualization version GIF version |
Description: Adding both sides of two orderings. (Contributed by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
leidd.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
ltnegd.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
ltadd1d.3 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
lt2addd.4 | ⊢ (𝜑 → 𝐷 ∈ ℝ) |
ltleaddd.5 | ⊢ (𝜑 → 𝐴 < 𝐶) |
ltleaddd.6 | ⊢ (𝜑 → 𝐵 ≤ 𝐷) |
Ref | Expression |
---|---|
ltleaddd | ⊢ (𝜑 → (𝐴 + 𝐵) < (𝐶 + 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltleaddd.5 | . 2 ⊢ (𝜑 → 𝐴 < 𝐶) | |
2 | ltleaddd.6 | . 2 ⊢ (𝜑 → 𝐵 ≤ 𝐷) | |
3 | leidd.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
4 | ltnegd.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
5 | ltadd1d.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
6 | lt2addd.4 | . . 3 ⊢ (𝜑 → 𝐷 ∈ ℝ) | |
7 | ltleadd 11749 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 < 𝐶 ∧ 𝐵 ≤ 𝐷) → (𝐴 + 𝐵) < (𝐶 + 𝐷))) | |
8 | 3, 4, 5, 6, 7 | syl22anc 837 | . 2 ⊢ (𝜑 → ((𝐴 < 𝐶 ∧ 𝐵 ≤ 𝐷) → (𝐴 + 𝐵) < (𝐶 + 𝐷))) |
9 | 1, 2, 8 | mp2and 697 | 1 ⊢ (𝜑 → (𝐴 + 𝐵) < (𝐶 + 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 ∈ wcel 2099 class class class wbr 5155 (class class class)co 7426 ℝcr 11159 + caddc 11163 < clt 11300 ≤ cle 11301 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-sep 5306 ax-nul 5313 ax-pow 5371 ax-pr 5435 ax-un 7748 ax-resscn 11217 ax-1cn 11218 ax-icn 11219 ax-addcl 11220 ax-addrcl 11221 ax-mulcl 11222 ax-mulrcl 11223 ax-mulcom 11224 ax-addass 11225 ax-mulass 11226 ax-distr 11227 ax-i2m1 11228 ax-1ne0 11229 ax-1rid 11230 ax-rnegex 11231 ax-rrecex 11232 ax-cnre 11233 ax-pre-lttri 11234 ax-pre-lttrn 11235 ax-pre-ltadd 11236 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rab 3420 df-v 3464 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4916 df-br 5156 df-opab 5218 df-mpt 5239 df-id 5582 df-po 5596 df-so 5597 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-iota 6508 df-fun 6558 df-fn 6559 df-f 6560 df-f1 6561 df-fo 6562 df-f1o 6563 df-fv 6564 df-ov 7429 df-er 8736 df-en 8977 df-dom 8978 df-sdom 8979 df-pnf 11302 df-mnf 11303 df-xr 11304 df-ltxr 11305 df-le 11306 |
This theorem is referenced by: lt2addd 11889 abelthlem7 26471 atanlogsublem 26946 mblfinlem4 37363 sticksstones6 41851 pell14qrgapw 42551 lptre2pt 45279 smfmullem1 46430 |
Copyright terms: Public domain | W3C validator |