![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > le2addd | GIF version |
Description: Adding both side of two inequalities. (Contributed by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
leidd.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
ltnegd.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
ltadd1d.3 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
lt2addd.4 | ⊢ (𝜑 → 𝐷 ∈ ℝ) |
le2addd.5 | ⊢ (𝜑 → 𝐴 ≤ 𝐶) |
le2addd.6 | ⊢ (𝜑 → 𝐵 ≤ 𝐷) |
Ref | Expression |
---|---|
le2addd | ⊢ (𝜑 → (𝐴 + 𝐵) ≤ (𝐶 + 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | le2addd.5 | . 2 ⊢ (𝜑 → 𝐴 ≤ 𝐶) | |
2 | le2addd.6 | . 2 ⊢ (𝜑 → 𝐵 ≤ 𝐷) | |
3 | leidd.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
4 | ltnegd.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
5 | ltadd1d.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
6 | lt2addd.4 | . . 3 ⊢ (𝜑 → 𝐷 ∈ ℝ) | |
7 | le2add 8073 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 ≤ 𝐷) → (𝐴 + 𝐵) ≤ (𝐶 + 𝐷))) | |
8 | 3, 4, 5, 6, 7 | syl22anc 1185 | . 2 ⊢ (𝜑 → ((𝐴 ≤ 𝐶 ∧ 𝐵 ≤ 𝐷) → (𝐴 + 𝐵) ≤ (𝐶 + 𝐷))) |
9 | 1, 2, 8 | mp2and 427 | 1 ⊢ (𝜑 → (𝐴 + 𝐵) ≤ (𝐶 + 𝐷)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∈ wcel 1448 class class class wbr 3875 (class class class)co 5706 ℝcr 7499 + caddc 7503 ≤ cle 7673 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 584 ax-in2 585 ax-io 671 ax-5 1391 ax-7 1392 ax-gen 1393 ax-ie1 1437 ax-ie2 1438 ax-8 1450 ax-10 1451 ax-11 1452 ax-i12 1453 ax-bndl 1454 ax-4 1455 ax-13 1459 ax-14 1460 ax-17 1474 ax-i9 1478 ax-ial 1482 ax-i5r 1483 ax-ext 2082 ax-sep 3986 ax-pow 4038 ax-pr 4069 ax-un 4293 ax-setind 4390 ax-cnex 7586 ax-resscn 7587 ax-1cn 7588 ax-icn 7590 ax-addcl 7591 ax-addrcl 7592 ax-mulcl 7593 ax-addcom 7595 ax-addass 7597 ax-i2m1 7600 ax-0id 7603 ax-rnegex 7604 ax-pre-ltwlin 7608 ax-pre-ltadd 7611 |
This theorem depends on definitions: df-bi 116 df-3an 932 df-tru 1302 df-fal 1305 df-nf 1405 df-sb 1704 df-eu 1963 df-mo 1964 df-clab 2087 df-cleq 2093 df-clel 2096 df-nfc 2229 df-ne 2268 df-nel 2363 df-ral 2380 df-rex 2381 df-rab 2384 df-v 2643 df-dif 3023 df-un 3025 df-in 3027 df-ss 3034 df-pw 3459 df-sn 3480 df-pr 3481 df-op 3483 df-uni 3684 df-br 3876 df-opab 3930 df-xp 4483 df-cnv 4485 df-iota 5024 df-fv 5067 df-ov 5709 df-pnf 7674 df-mnf 7675 df-xr 7676 df-ltxr 7677 df-le 7678 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |