![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ltsubaddd | Structured version Visualization version GIF version |
Description: 'Less than' relationship between subtraction and addition. (Contributed by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
leidd.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
ltnegd.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
ltadd1d.3 | ⊢ (𝜑 → 𝐶 ∈ ℝ) |
Ref | Expression |
---|---|
ltsubaddd | ⊢ (𝜑 → ((𝐴 − 𝐵) < 𝐶 ↔ 𝐴 < (𝐶 + 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | leidd.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
2 | ltnegd.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
3 | ltadd1d.3 | . 2 ⊢ (𝜑 → 𝐶 ∈ ℝ) | |
4 | ltsubadd 11731 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 − 𝐵) < 𝐶 ↔ 𝐴 < (𝐶 + 𝐵))) | |
5 | 1, 2, 3, 4 | syl3anc 1370 | 1 ⊢ (𝜑 → ((𝐴 − 𝐵) < 𝐶 ↔ 𝐴 < (𝐶 + 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2106 class class class wbr 5148 (class class class)co 7431 ℝcr 11152 + caddc 11156 < clt 11293 − cmin 11490 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-po 5597 df-so 5598 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11295 df-mnf 11296 df-ltxr 11298 df-sub 11492 df-neg 11493 |
This theorem is referenced by: sublt0d 11887 ltaddsublt 11888 supaddc 12233 suprzcl 12696 2submod 13970 hashdvds 16809 prmreclem6 16955 4sqlem6 16977 ovolshftlem1 25558 opnmbllem 25650 mbfaddlem 25709 itg2monolem1 25800 dvlt0 26059 lhop1 26068 plydivlem3 26352 efif1olem1 26599 ang180lem2 26868 atanlogsublem 26973 bposlem1 27343 crctcshwlkn0lem5 29844 eucrctshift 30272 bcm1n 32803 subfacval3 35174 opnmbllem0 37643 itg2addnclem 37658 itg2gt0cn 37662 aks4d1p1p3 42051 aks4d1p1 42058 posbezout 42082 iooiinicc 45495 0ellimcdiv 45605 wallispilem3 46023 fourierdlem41 46104 fourierdlem49 46111 fourierdlem97 46159 elaa2lem 46189 sge0ltfirp 46356 sfprmdvdsmersenne 47528 proththdlem 47538 ltsubaddb 48360 ltsubsubb 48361 ltsubadd2b 48362 |
Copyright terms: Public domain | W3C validator |