![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ltsubadd | Structured version Visualization version GIF version |
Description: 'Less than' relationship between subtraction and addition. (Contributed by NM, 21-Jan-1997.) (Proof shortened by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
ltsubadd | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 − 𝐵) < 𝐶 ↔ 𝐴 < (𝐶 + 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1137 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐴 ∈ ℝ) | |
2 | simp2 1138 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℝ) | |
3 | 1, 2 | resubcld 11698 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 − 𝐵) ∈ ℝ) |
4 | simp3 1139 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐶 ∈ ℝ) | |
5 | ltadd1 11737 | . . 3 ⊢ (((𝐴 − 𝐵) ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 − 𝐵) < 𝐶 ↔ ((𝐴 − 𝐵) + 𝐵) < (𝐶 + 𝐵))) | |
6 | 3, 4, 2, 5 | syl3anc 1372 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 − 𝐵) < 𝐶 ↔ ((𝐴 − 𝐵) + 𝐵) < (𝐶 + 𝐵))) |
7 | 1 | recnd 11296 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐴 ∈ ℂ) |
8 | 2 | recnd 11296 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℂ) |
9 | 7, 8 | npcand 11631 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴) |
10 | 9 | breq1d 5161 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (((𝐴 − 𝐵) + 𝐵) < (𝐶 + 𝐵) ↔ 𝐴 < (𝐶 + 𝐵))) |
11 | 6, 10 | bitrd 279 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 − 𝐵) < 𝐶 ↔ 𝐴 < (𝐶 + 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1087 ∈ wcel 2108 class class class wbr 5151 (class class class)co 7438 ℝcr 11161 + caddc 11165 < clt 11302 − cmin 11499 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5305 ax-nul 5315 ax-pow 5374 ax-pr 5441 ax-un 7761 ax-resscn 11219 ax-1cn 11220 ax-icn 11221 ax-addcl 11222 ax-addrcl 11223 ax-mulcl 11224 ax-mulrcl 11225 ax-mulcom 11226 ax-addass 11227 ax-mulass 11228 ax-distr 11229 ax-i2m1 11230 ax-1ne0 11231 ax-1rid 11232 ax-rnegex 11233 ax-rrecex 11234 ax-cnre 11235 ax-pre-lttri 11236 ax-pre-lttrn 11237 ax-pre-ltadd 11238 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3483 df-sbc 3795 df-csb 3912 df-dif 3969 df-un 3971 df-in 3973 df-ss 3983 df-nul 4343 df-if 4535 df-pw 4610 df-sn 4635 df-pr 4637 df-op 4641 df-uni 4916 df-br 5152 df-opab 5214 df-mpt 5235 df-id 5587 df-po 5601 df-so 5602 df-xp 5699 df-rel 5700 df-cnv 5701 df-co 5702 df-dm 5703 df-rn 5704 df-res 5705 df-ima 5706 df-iota 6522 df-fun 6571 df-fn 6572 df-f 6573 df-f1 6574 df-fo 6575 df-f1o 6576 df-fv 6577 df-riota 7395 df-ov 7441 df-oprab 7442 df-mpo 7443 df-er 8753 df-en 8994 df-dom 8995 df-sdom 8996 df-pnf 11304 df-mnf 11305 df-ltxr 11307 df-sub 11501 df-neg 11502 |
This theorem is referenced by: ltsubadd2 11741 leaddsub 11746 ltsub23 11750 ltsubpos 11762 ltsubaddi 11827 ltsubaddd 11866 nnsub 12317 nnunb 12529 zbtwnre 12995 rebtwnz 12996 iooshf 13472 modsumfzodifsn 13991 expnbnd 14277 srgbinomlem4 20256 sincosq2sgn 26567 sincosq3sgn 26568 sincosq4sgn 26569 zetacvg 27084 crctcshwlkn0 29867 ftc1anclem5 37698 ftc1anclem6 37699 |
Copyright terms: Public domain | W3C validator |