![]() |
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 7929 with ordering on the extended reals.) (Contributed by NM, 13-Oct-2005.) |
Ref | Expression |
---|---|
axltadd | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐶 + 𝐴) < (𝐶 + 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-pre-ltadd 7929 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 <ℝ 𝐵 → (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) | |
2 | ltxrlt 8025 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ 𝐴 <ℝ 𝐵)) | |
3 | 2 | 3adant3 1017 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 ↔ 𝐴 <ℝ 𝐵)) |
4 | readdcl 7939 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐶 + 𝐴) ∈ ℝ) | |
5 | readdcl 7939 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 + 𝐵) ∈ ℝ) | |
6 | ltxrlt 8025 | . . . . 5 ⊢ (((𝐶 + 𝐴) ∈ ℝ ∧ (𝐶 + 𝐵) ∈ ℝ) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) | |
7 | 4, 5, 6 | syl2an 289 | . . . 4 ⊢ (((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) |
8 | 7 | 3impdi 1293 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) |
9 | 8 | 3coml 1210 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) |
10 | 1, 3, 9 | 3imtr4d 203 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐶 + 𝐴) < (𝐶 + 𝐵))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 978 ∈ wcel 2148 class class class wbr 4005 (class class class)co 5877 ℝcr 7812 + caddc 7816 <ℝ cltrr 7817 < clt 7994 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-cnex 7904 ax-resscn 7905 ax-addrcl 7910 ax-pre-ltadd 7929 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-rab 2464 df-v 2741 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-br 4006 df-opab 4067 df-xp 4634 df-pnf 7996 df-mnf 7997 df-ltxr 7999 |
This theorem is referenced by: ltadd2 8378 nnge1 8944 ltoddhalfle 11900 |
Copyright terms: Public domain | W3C validator |