Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > xle2add | GIF version |
Description: Extended real version of le2add 8206. (Contributed by Mario Carneiro, 23-Aug-2015.) |
Ref | Expression |
---|---|
xle2add | ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 ≤ 𝐷) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpll 518 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐴 ∈ ℝ*) | |
2 | simprl 520 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐶 ∈ ℝ*) | |
3 | simplr 519 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐵 ∈ ℝ*) | |
4 | xleadd1a 9656 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐴 ≤ 𝐶) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵)) | |
5 | 4 | ex 114 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐶 → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵))) |
6 | 1, 2, 3, 5 | syl3anc 1216 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐴 ≤ 𝐶 → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵))) |
7 | simprr 521 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐷 ∈ ℝ*) | |
8 | xleadd2a 9657 | . . . 4 ⊢ (((𝐵 ∈ ℝ* ∧ 𝐷 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ 𝐵 ≤ 𝐷) → (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷)) | |
9 | 8 | ex 114 | . . 3 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐷 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐵 ≤ 𝐷 → (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
10 | 3, 7, 2, 9 | syl3anc 1216 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐵 ≤ 𝐷 → (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
11 | xaddcl 9643 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 +𝑒 𝐵) ∈ ℝ*) | |
12 | 11 | adantr 274 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐴 +𝑒 𝐵) ∈ ℝ*) |
13 | xaddcl 9643 | . . . 4 ⊢ ((𝐶 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 +𝑒 𝐵) ∈ ℝ*) | |
14 | 2, 3, 13 | syl2anc 408 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐶 +𝑒 𝐵) ∈ ℝ*) |
15 | xaddcl 9643 | . . . 4 ⊢ ((𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*) → (𝐶 +𝑒 𝐷) ∈ ℝ*) | |
16 | 15 | adantl 275 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐶 +𝑒 𝐷) ∈ ℝ*) |
17 | xrletr 9591 | . . 3 ⊢ (((𝐴 +𝑒 𝐵) ∈ ℝ* ∧ (𝐶 +𝑒 𝐵) ∈ ℝ* ∧ (𝐶 +𝑒 𝐷) ∈ ℝ*) → (((𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵) ∧ (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷)) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) | |
18 | 12, 14, 16, 17 | syl3anc 1216 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (((𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵) ∧ (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷)) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
19 | 6, 10, 18 | syl2and 293 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 ≤ 𝐷) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 962 ∈ wcel 1480 class class class wbr 3929 (class class class)co 5774 ℝ*cxr 7799 ≤ cle 7801 +𝑒 cxad 9557 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-addcom 7720 ax-addass 7722 ax-i2m1 7725 ax-0id 7728 ax-rnegex 7729 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-apti 7735 ax-pre-ltadd 7736 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-if 3475 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-po 4218 df-iso 4219 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-fv 5131 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-xadd 9560 |
This theorem is referenced by: xrbdtri 11045 xmetxp 12676 |
Copyright terms: Public domain | W3C validator |