| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ltadd1 | GIF version | ||
| Description: Addition to both sides of 'less than'. Part of definition 11.2.7(vi) of [HoTT], p. (varies). (Contributed by NM, 12-Nov-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| ltadd1 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 ↔ (𝐴 + 𝐶) < (𝐵 + 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltadd2 8522 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 ↔ (𝐶 + 𝐴) < (𝐶 + 𝐵))) | |
| 2 | simp3 1002 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐶 ∈ ℝ) | |
| 3 | 2 | recnd 8131 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐶 ∈ ℂ) |
| 4 | simp1 1000 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 5 | 4 | recnd 8131 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐴 ∈ ℂ) |
| 6 | 3, 5 | addcomd 8253 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 + 𝐴) = (𝐴 + 𝐶)) |
| 7 | simp2 1001 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℝ) | |
| 8 | 7 | recnd 8131 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℂ) |
| 9 | 3, 8 | addcomd 8253 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 + 𝐵) = (𝐵 + 𝐶)) |
| 10 | 6, 9 | breq12d 4067 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 + 𝐴) < (𝐶 + 𝐵) ↔ (𝐴 + 𝐶) < (𝐵 + 𝐶))) |
| 11 | 1, 10 | bitrd 188 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 ↔ (𝐴 + 𝐶) < (𝐵 + 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∧ w3a 981 ∈ wcel 2177 class class class wbr 4054 (class class class)co 5962 ℝcr 7954 + caddc 7958 < clt 8137 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4173 ax-pow 4229 ax-pr 4264 ax-un 4493 ax-setind 4598 ax-cnex 8046 ax-resscn 8047 ax-1cn 8048 ax-icn 8050 ax-addcl 8051 ax-addrcl 8052 ax-mulcl 8053 ax-addcom 8055 ax-addass 8057 ax-i2m1 8060 ax-0id 8063 ax-rnegex 8064 ax-pre-ltadd 8071 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-rab 2494 df-v 2775 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3860 df-br 4055 df-opab 4117 df-xp 4694 df-iota 5246 df-fv 5293 df-ov 5965 df-pnf 8139 df-mnf 8140 df-ltxr 8142 |
| This theorem is referenced by: leadd1 8533 ltsubadd 8535 ltaddsub 8539 lt2add 8548 ltleadd 8549 ltadd1i 8605 ltadd1d 8641 reapadd1 8699 addltmul 9304 avglt2 9307 xltadd1 10028 icoshft 10142 fzonn0p1p1 10374 caucvgre 11377 |
| Copyright terms: Public domain | W3C validator |