Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > xle2add | GIF version |
Description: Extended real version of le2add 8363. (Contributed by Mario Carneiro, 23-Aug-2015.) |
Ref | Expression |
---|---|
xle2add | ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 ≤ 𝐷) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpll 524 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐴 ∈ ℝ*) | |
2 | simprl 526 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐶 ∈ ℝ*) | |
3 | simplr 525 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐵 ∈ ℝ*) | |
4 | xleadd1a 9830 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ 𝐴 ≤ 𝐶) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵)) | |
5 | 4 | ex 114 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐶 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 ≤ 𝐶 → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵))) |
6 | 1, 2, 3, 5 | syl3anc 1233 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐴 ≤ 𝐶 → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵))) |
7 | simprr 527 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → 𝐷 ∈ ℝ*) | |
8 | xleadd2a 9831 | . . . 4 ⊢ (((𝐵 ∈ ℝ* ∧ 𝐷 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) ∧ 𝐵 ≤ 𝐷) → (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷)) | |
9 | 8 | ex 114 | . . 3 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐷 ∈ ℝ* ∧ 𝐶 ∈ ℝ*) → (𝐵 ≤ 𝐷 → (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
10 | 3, 7, 2, 9 | syl3anc 1233 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐵 ≤ 𝐷 → (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
11 | xaddcl 9817 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 +𝑒 𝐵) ∈ ℝ*) | |
12 | 11 | adantr 274 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐴 +𝑒 𝐵) ∈ ℝ*) |
13 | xaddcl 9817 | . . . 4 ⊢ ((𝐶 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐶 +𝑒 𝐵) ∈ ℝ*) | |
14 | 2, 3, 13 | syl2anc 409 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐶 +𝑒 𝐵) ∈ ℝ*) |
15 | xaddcl 9817 | . . . 4 ⊢ ((𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*) → (𝐶 +𝑒 𝐷) ∈ ℝ*) | |
16 | 15 | adantl 275 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (𝐶 +𝑒 𝐷) ∈ ℝ*) |
17 | xrletr 9765 | . . 3 ⊢ (((𝐴 +𝑒 𝐵) ∈ ℝ* ∧ (𝐶 +𝑒 𝐵) ∈ ℝ* ∧ (𝐶 +𝑒 𝐷) ∈ ℝ*) → (((𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵) ∧ (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷)) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) | |
18 | 12, 14, 16, 17 | syl3anc 1233 | . 2 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → (((𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐵) ∧ (𝐶 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷)) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
19 | 6, 10, 18 | syl2and 293 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) ∧ (𝐶 ∈ ℝ* ∧ 𝐷 ∈ ℝ*)) → ((𝐴 ≤ 𝐶 ∧ 𝐵 ≤ 𝐷) → (𝐴 +𝑒 𝐵) ≤ (𝐶 +𝑒 𝐷))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 973 ∈ wcel 2141 class class class wbr 3989 (class class class)co 5853 ℝ*cxr 7953 ≤ cle 7955 +𝑒 cxad 9727 |
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 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-cnex 7865 ax-resscn 7866 ax-1cn 7867 ax-1re 7868 ax-icn 7869 ax-addcl 7870 ax-addrcl 7871 ax-mulcl 7872 ax-addcom 7874 ax-addass 7876 ax-i2m1 7879 ax-0id 7882 ax-rnegex 7883 ax-pre-ltirr 7886 ax-pre-ltwlin 7887 ax-pre-lttrn 7888 ax-pre-apti 7889 ax-pre-ltadd 7890 |
This theorem depends on definitions: df-bi 116 df-dc 830 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-if 3527 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-iun 3875 df-br 3990 df-opab 4051 df-mpt 4052 df-id 4278 df-po 4281 df-iso 4282 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-ima 4624 df-iota 5160 df-fun 5200 df-fn 5201 df-f 5202 df-fv 5206 df-ov 5856 df-oprab 5857 df-mpo 5858 df-1st 6119 df-2nd 6120 df-pnf 7956 df-mnf 7957 df-xr 7958 df-ltxr 7959 df-le 7960 df-xadd 9730 |
This theorem is referenced by: xrbdtri 11239 xmetxp 13301 |
Copyright terms: Public domain | W3C validator |