Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > xle2add | GIF version |
Description: Extended real version of le2add 8342. (Contributed by Mario Carneiro, 23-Aug-2015.) |
Ref | Expression |
---|---|
xle2add | ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 ≤ 𝐷) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpll 519 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐴 ∈ ℝ*) | |
2 | simprl 521 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐶 ∈ ℝ*) | |
3 | simplr 520 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐵 ∈ ℝ*) | |
4 | xleadd1a 9809 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐴 ≤ 𝐶) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵)) | |
5 | 4 | ex 114 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐶 → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵))) |
6 | 1, 2, 3, 5 | syl3anc 1228 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐴 ≤ 𝐶 → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵))) |
7 | simprr 522 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐷 ∈ ℝ*) | |
8 | xleadd2a 9810 | . . . 4 ⊢ (((𝐵 ∈ ℝ* ∧ 𝐷 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ 𝐵 ≤ 𝐷) → (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷)) | |
9 | 8 | ex 114 | . . 3 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐷 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐵 ≤ 𝐷 → (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
10 | 3, 7, 2, 9 | syl3anc 1228 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐵 ≤ 𝐷 → (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
11 | xaddcl 9796 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 +𝑒 𝐵) ∈ ℝ*) | |
12 | 11 | adantr 274 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐴 +𝑒 𝐵) ∈ ℝ*) |
13 | xaddcl 9796 | . . . 4 ⊢ ((𝐶 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 +𝑒 𝐵) ∈ ℝ*) | |
14 | 2, 3, 13 | syl2anc 409 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐶 +𝑒 𝐵) ∈ ℝ*) |
15 | xaddcl 9796 | . . . 4 ⊢ ((𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*) → (𝐶 +𝑒 𝐷) ∈ ℝ*) | |
16 | 15 | adantl 275 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐶 +𝑒 𝐷) ∈ ℝ*) |
17 | xrletr 9744 | . . 3 ⊢ (((𝐴 +𝑒 𝐵) ∈ ℝ* ∧ (𝐶 +𝑒 𝐵) ∈ ℝ* ∧ (𝐶 +𝑒 𝐷) ∈ ℝ*) → (((𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵) ∧ (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷)) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) | |
18 | 12, 14, 16, 17 | syl3anc 1228 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (((𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵) ∧ (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷)) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
19 | 6, 10, 18 | syl2and 293 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 ≤ 𝐷) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 968 ∈ wcel 2136 class class class wbr 3982 (class class class)co 5842 ℝ*cxr 7932 ≤ cle 7934 +𝑒 cxad 9706 |
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 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 ax-cnex 7844 ax-resscn 7845 ax-1cn 7846 ax-1re 7847 ax-icn 7848 ax-addcl 7849 ax-addrcl 7850 ax-mulcl 7851 ax-addcom 7853 ax-addass 7855 ax-i2m1 7858 ax-0id 7861 ax-rnegex 7862 ax-pre-ltirr 7865 ax-pre-ltwlin 7866 ax-pre-lttrn 7867 ax-pre-apti 7868 ax-pre-ltadd 7869 |
This theorem depends on definitions: df-bi 116 df-dc 825 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-nel 2432 df-ral 2449 df-rex 2450 df-rab 2453 df-v 2728 df-sbc 2952 df-csb 3046 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-if 3521 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-iun 3868 df-br 3983 df-opab 4044 df-mpt 4045 df-id 4271 df-po 4274 df-iso 4275 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-rn 4615 df-res 4616 df-ima 4617 df-iota 5153 df-fun 5190 df-fn 5191 df-f 5192 df-fv 5196 df-ov 5845 df-oprab 5846 df-mpo 5847 df-1st 6108 df-2nd 6109 df-pnf 7935 df-mnf 7936 df-xr 7937 df-ltxr 7938 df-le 7939 df-xadd 9709 |
This theorem is referenced by: xrbdtri 11217 xmetxp 13147 |
Copyright terms: Public domain | W3C validator |