Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > axltadd | GIF version |
Description: Ordering property of addition on reals. Axiom for real and complex numbers, derived from set theory. (This restates ax-pre-ltadd 7704 with ordering on the extended reals.) (Contributed by NM, 13-Oct-2005.) |
Ref | Expression |
---|---|
axltadd | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐶 + 𝐴) < (𝐶 + 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-pre-ltadd 7704 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 <ℝ 𝐵 → (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) | |
2 | ltxrlt 7798 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ 𝐴 <ℝ 𝐵)) | |
3 | 2 | 3adant3 986 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 ↔ 𝐴 <ℝ 𝐵)) |
4 | readdcl 7714 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐶 + 𝐴) ∈ ℝ) | |
5 | readdcl 7714 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 + 𝐵) ∈ ℝ) | |
6 | ltxrlt 7798 | . . . . 5 ⊢ (((𝐶 + 𝐴) ∈ ℝ ∧ (𝐶 + 𝐵) ∈ ℝ) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) | |
7 | 4, 5, 6 | syl2an 287 | . . . 4 ⊢ (((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) |
8 | 7 | 3impdi 1256 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) |
9 | 8 | 3coml 1173 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) |
10 | 1, 3, 9 | 3imtr4d 202 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐶 + 𝐴) < (𝐶 + 𝐵))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 947 ∈ wcel 1465 class class class wbr 3899 (class class class)co 5742 ℝcr 7587 + caddc 7591 <ℝ cltrr 7592 < clt 7768 |
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 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-sep 4016 ax-pow 4068 ax-pr 4101 ax-un 4325 ax-setind 4422 ax-cnex 7679 ax-resscn 7680 ax-addrcl 7685 ax-pre-ltadd 7704 |
This theorem depends on definitions: df-bi 116 df-3an 949 df-tru 1319 df-fal 1322 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ne 2286 df-nel 2381 df-ral 2398 df-rex 2399 df-rab 2402 df-v 2662 df-dif 3043 df-un 3045 df-in 3047 df-ss 3054 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-br 3900 df-opab 3960 df-xp 4515 df-pnf 7770 df-mnf 7771 df-ltxr 7773 |
This theorem is referenced by: ltadd2 8149 nnge1 8711 ltoddhalfle 11517 |
Copyright terms: Public domain | W3C validator |