| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lt2addd | Structured version Visualization version GIF version | ||
| Description: Adding both side of two inequalities. Theorem I.25 of [Apostol] p. 20. (Contributed by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| leidd.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| ltnegd.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| ltadd1d.3 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| lt2addd.4 | ⊢ (𝜑 → 𝐷 ∈ ℝ) |
| lt2addd.5 | ⊢ (𝜑 → 𝐴 < 𝐶) |
| lt2addd.6 | ⊢ (𝜑 → 𝐵 < 𝐷) |
| Ref | Expression |
|---|---|
| lt2addd | ⊢ (𝜑 → (𝐴 + 𝐵) < (𝐶 + 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | leidd.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 2 | ltnegd.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 3 | ltadd1d.3 | . 2 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
| 4 | lt2addd.4 | . 2 ⊢ (𝜑 → 𝐷 ∈ ℝ) | |
| 5 | lt2addd.5 | . 2 ⊢ (𝜑 → 𝐴 < 𝐶) | |
| 6 | lt2addd.6 | . . 3 ⊢ (𝜑 → 𝐵 < 𝐷) | |
| 7 | 2, 4, 6 | ltled 11331 | . 2 ⊢ (𝜑 → 𝐵 ≤ 𝐷) |
| 8 | 1, 2, 3, 4, 5, 7 | ltleaddd 11808 | 1 ⊢ (𝜑 → (𝐴 + 𝐵) < (𝐶 + 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2142 class class class wbr 5100 (class class class)co 7396 ℝcr 11072 + caddc 11076 < clt 11216 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5542 df-po 5555 df-so 5556 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-ov 7399 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 |
| This theorem is referenced by: lt2addmuld 12471 mertenslem1 15914 sadcaddlem 16491 uniioombllem3 25647 itg2cnlem2 25824 ang180lem2 26875 sqsscirc1 34205 hgt750lemd 34942 unbdqndv2lem1 36947 heicant 38154 mblfinlem3 38158 ftc1anclem7 38198 isbnd3 38283 dffltz 43216 lt3addmuld 45880 lt4addmuld 45885 stoweidlem13 46587 2itscp 49403 |
| Copyright terms: Public domain | W3C validator |