| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lt2addd | 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 8297 | . 2 ⊢ (𝜑 → 𝐵 ≤ 𝐷) |
| 8 | 1, 2, 3, 4, 5, 7 | ltleaddd 8744 | 1 ⊢ (𝜑 → (𝐴 + 𝐵) < (𝐶 + 𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∈ wcel 2202 class class class wbr 4088 (class class class)co 6017 ℝcr 8030 + caddc 8034 < clt 8213 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-i2m1 8136 ax-0id 8139 ax-rnegex 8140 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-xp 4731 df-cnv 4733 df-iota 5286 df-fv 5334 df-ov 6020 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 |
| This theorem is referenced by: modaddmodup 10648 modsumfzodifsn 10657 resqrexlemnm 11578 mertenslemi1 12095 |
| Copyright terms: Public domain | W3C validator |