Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > ltsubsubaddltsub | Structured version Visualization version GIF version |
Description: If the result of subtracting two numbers is greater than a number, the result of adding one of these subtracted numbers to the number is less than the result of subtracting the other subtracted number only. (Contributed by Alexander van der Vekens, 9-Jun-2018.) |
Ref | Expression |
---|---|
ltsubsubaddltsub | ⊢ ((𝐽 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ)) → (𝐽 < ((𝐿 − 𝑀) − 𝑁) ↔ (𝐽 + 𝑀) < (𝐿 − 𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 485 | . . 3 ⊢ ((𝐽 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ)) → 𝐽 ∈ ℝ) | |
2 | resubcl 10952 | . . . . . 6 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝐿 − 𝑀) ∈ ℝ) | |
3 | 2 | 3adant3 1128 | . . . . 5 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝐿 − 𝑀) ∈ ℝ) |
4 | simp3 1134 | . . . . 5 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → 𝑁 ∈ ℝ) | |
5 | 3, 4 | resubcld 11070 | . . . 4 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝐿 − 𝑀) − 𝑁) ∈ ℝ) |
6 | 5 | adantl 484 | . . 3 ⊢ ((𝐽 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ)) → ((𝐿 − 𝑀) − 𝑁) ∈ ℝ) |
7 | simpr2 1191 | . . 3 ⊢ ((𝐽 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ)) → 𝑀 ∈ ℝ) | |
8 | 1, 6, 7 | ltadd1d 11235 | . 2 ⊢ ((𝐽 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ)) → (𝐽 < ((𝐿 − 𝑀) − 𝑁) ↔ (𝐽 + 𝑀) < (((𝐿 − 𝑀) − 𝑁) + 𝑀))) |
9 | recn 10629 | . . . . 5 ⊢ (𝐿 ∈ ℝ → 𝐿 ∈ ℂ) | |
10 | recn 10629 | . . . . 5 ⊢ (𝑀 ∈ ℝ → 𝑀 ∈ ℂ) | |
11 | recn 10629 | . . . . 5 ⊢ (𝑁 ∈ ℝ → 𝑁 ∈ ℂ) | |
12 | nnpcan 10911 | . . . . 5 ⊢ ((𝐿 ∈ ℂ ∧ 𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (((𝐿 − 𝑀) − 𝑁) + 𝑀) = (𝐿 − 𝑁)) | |
13 | 9, 10, 11, 12 | syl3an 1156 | . . . 4 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (((𝐿 − 𝑀) − 𝑁) + 𝑀) = (𝐿 − 𝑁)) |
14 | 13 | adantl 484 | . . 3 ⊢ ((𝐽 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ)) → (((𝐿 − 𝑀) − 𝑁) + 𝑀) = (𝐿 − 𝑁)) |
15 | 14 | breq2d 5080 | . 2 ⊢ ((𝐽 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ)) → ((𝐽 + 𝑀) < (((𝐿 − 𝑀) − 𝑁) + 𝑀) ↔ (𝐽 + 𝑀) < (𝐿 − 𝑁))) |
16 | 8, 15 | bitrd 281 | 1 ⊢ ((𝐽 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ)) → (𝐽 < ((𝐿 − 𝑀) − 𝑁) ↔ (𝐽 + 𝑀) < (𝐿 − 𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 class class class wbr 5068 (class class class)co 7158 ℂcc 10537 ℝcr 10538 + caddc 10542 < clt 10677 − cmin 10872 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-po 5476 df-so 5477 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-pnf 10679 df-mnf 10680 df-ltxr 10682 df-sub 10874 df-neg 10875 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |