![]() |
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 11583 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 − 𝐵) < 𝐶 ↔ 𝐴 < (𝐶 + 𝐵))) | |
5 | 1, 2, 3, 4 | syl3anc 1371 | 1 ⊢ (𝜑 → ((𝐴 − 𝐵) < 𝐶 ↔ 𝐴 < (𝐶 + 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∈ wcel 2106 class class class wbr 5103 (class class class)co 7351 ℝcr 11008 + caddc 11012 < clt 11147 − cmin 11343 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7664 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-br 5104 df-opab 5166 df-mpt 5187 df-id 5529 df-po 5543 df-so 5544 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7307 df-ov 7354 df-oprab 7355 df-mpo 7356 df-er 8606 df-en 8842 df-dom 8843 df-sdom 8844 df-pnf 11149 df-mnf 11150 df-ltxr 11152 df-sub 11345 df-neg 11346 |
This theorem is referenced by: sublt0d 11739 ltaddsublt 11740 supaddc 12080 suprzcl 12541 2submod 13791 hashdvds 16601 prmreclem6 16747 4sqlem6 16769 ovolshftlem1 24819 opnmbllem 24911 mbfaddlem 24970 itg2monolem1 25061 dvlt0 25315 lhop1 25324 plydivlem3 25601 efif1olem1 25844 ang180lem2 26106 atanlogsublem 26211 bposlem1 26578 crctcshwlkn0lem5 28604 eucrctshift 29032 bcm1n 31540 subfacval3 33611 opnmbllem0 36046 itg2addnclem 36061 itg2gt0cn 36065 aks4d1p1p3 40458 aks4d1p1 40465 iooiinicc 43675 0ellimcdiv 43785 wallispilem3 44203 fourierdlem41 44284 fourierdlem49 44291 fourierdlem97 44339 elaa2lem 44369 sge0ltfirp 44536 sfprmdvdsmersenne 45690 proththdlem 45700 ltsubaddb 46490 ltsubsubb 46491 ltsubadd2b 46492 |
Copyright terms: Public domain | W3C validator |