| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > axltadd | Structured version Visualization version GIF version | ||
| Description: Ordering property of addition on reals. Axiom 20 of 22 for real and complex numbers, derived from ZF set theory. (This restates ax-pre-ltadd 11146 with ordering on the extended reals.) (Contributed by NM, 13-Oct-2005.) |
| Ref | Expression |
|---|---|
| axltadd | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐶 + 𝐴) < (𝐶 + 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-pre-ltadd 11146 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 <ℝ 𝐵 → (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) | |
| 2 | ltxrlt 11250 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ 𝐴 <ℝ 𝐵)) | |
| 3 | 2 | 3adant3 1144 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 ↔ 𝐴 <ℝ 𝐵)) |
| 4 | readdcl 11153 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐶 + 𝐴) ∈ ℝ) | |
| 5 | readdcl 11153 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 + 𝐵) ∈ ℝ) | |
| 6 | ltxrlt 11250 | . . . . 5 ⊢ (((𝐶 + 𝐴) ∈ ℝ ∧ (𝐶 + 𝐵) ∈ ℝ) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) | |
| 7 | 4, 5, 6 | syl2an 605 | . . . 4 ⊢ (((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) |
| 8 | 7 | 3impdi 1363 | . . 3 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) |
| 9 | 8 | 3coml 1139 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐶 + 𝐴) <ℝ (𝐶 + 𝐵))) |
| 10 | 1, 3, 9 | 3imtr4d 296 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 → (𝐶 + 𝐴) < (𝐶 + 𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 ∈ wcel 2141 class class class wbr 5099 (class class class)co 7392 ℝcr 11069 + caddc 11073 <ℝ cltrr 11074 < clt 11213 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-resscn 11127 ax-addrcl 11131 ax-pre-ltadd 11146 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-pnf 11215 df-mnf 11216 df-ltxr 11218 |
| This theorem is referenced by: ltadd2 11284 nnge1 12238 ltoddhalfle 16378 dp2lt 33023 sqrtpwpw2p 48111 |
| Copyright terms: Public domain | W3C validator |