Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > leaddsub | Structured version Visualization version GIF version |
Description: 'Less than or equal to' relationship between addition and subtraction. (Contributed by NM, 6-Apr-2005.) |
Ref | Expression |
---|---|
leaddsub | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 + 𝐵) ≤ 𝐶 ↔ 𝐴 ≤ (𝐶 − 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltsubadd 11445 | . . . 4 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((𝐶 − 𝐵) < 𝐴 ↔ 𝐶 < (𝐴 + 𝐵))) | |
2 | 1 | 3com13 1123 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 − 𝐵) < 𝐴 ↔ 𝐶 < (𝐴 + 𝐵))) |
3 | resubcl 11285 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 − 𝐵) ∈ ℝ) | |
4 | ltnle 11054 | . . . . 5 ⊢ (((𝐶 − 𝐵) ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((𝐶 − 𝐵) < 𝐴 ↔ ¬ 𝐴 ≤ (𝐶 − 𝐵))) | |
5 | 3, 4 | stoic3 1779 | . . . 4 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((𝐶 − 𝐵) < 𝐴 ↔ ¬ 𝐴 ≤ (𝐶 − 𝐵))) |
6 | 5 | 3com13 1123 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 − 𝐵) < 𝐴 ↔ ¬ 𝐴 ≤ (𝐶 − 𝐵))) |
7 | readdcl 10954 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
8 | ltnle 11054 | . . . . . 6 ⊢ ((𝐶 ∈ ℝ ∧ (𝐴 + 𝐵) ∈ ℝ) → (𝐶 < (𝐴 + 𝐵) ↔ ¬ (𝐴 + 𝐵) ≤ 𝐶)) | |
9 | 7, 8 | sylan2 593 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ)) → (𝐶 < (𝐴 + 𝐵) ↔ ¬ (𝐴 + 𝐵) ≤ 𝐶)) |
10 | 9 | 3impb 1114 | . . . 4 ⊢ ((𝐶 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 < (𝐴 + 𝐵) ↔ ¬ (𝐴 + 𝐵) ≤ 𝐶)) |
11 | 10 | 3coml 1126 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 < (𝐴 + 𝐵) ↔ ¬ (𝐴 + 𝐵) ≤ 𝐶)) |
12 | 2, 6, 11 | 3bitr3rd 310 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (¬ (𝐴 + 𝐵) ≤ 𝐶 ↔ ¬ 𝐴 ≤ (𝐶 − 𝐵))) |
13 | 12 | con4bid 317 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 + 𝐵) ≤ 𝐶 ↔ 𝐴 ≤ (𝐶 − 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 ∈ wcel 2106 class class class wbr 5074 (class class class)co 7275 ℝcr 10870 + caddc 10874 < clt 11009 ≤ cle 11010 − cmin 11205 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-po 5503 df-so 5504 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 |
This theorem is referenced by: leaddsub2 11452 lesub 11454 lesub2 11470 subge0 11488 lesub3d 11593 div4p1lem1div2 12228 eluzp1m1 12608 eluzsubi 12612 fzen 13273 fznatpl1 13310 expmulnbnd 13950 hashdvds 16476 sylow1lem5 19207 gsumbagdiaglemOLD 21141 gsumbagdiaglem 21144 voliunlem2 24715 itg2split 24914 dvfsumlem3 25192 pilem2 25611 logimul 25769 emcllem2 26146 chtublem 26359 dchrisum0re 26661 pntlemg 26746 crctcshwlkn0 28186 logdivsqrle 32630 poimirlem7 35784 totbndbnd 35947 aks4d1p1p5 40083 aks4d1p1 40084 sticksstones10 40111 sticksstones12a 40113 sticksstones12 40114 metakunt16 40140 binomcxplemnn0 41967 fmtnodvds 44996 lighneallem4a 45060 nnolog2flm1 45936 |
Copyright terms: Public domain | W3C validator |