| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > posdif | Structured version Visualization version GIF version | ||
| Description: Comparison of two numbers whose difference is positive. (Contributed by NM, 17-Nov-2004.) |
| Ref | Expression |
|---|---|
| posdif | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ 0 < (𝐵 − 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resubcl 11456 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 − 𝐴) ∈ ℝ) | |
| 2 | 1 | ancoms 459 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐵 − 𝐴) ∈ ℝ) |
| 3 | simpl 483 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 4 | ltaddpos 11638 | . . 3 ⊢ (((𝐵 − 𝐴) ∈ ℝ ∧ 𝐴 ∈ ℝ) → (0 < (𝐵 − 𝐴) ↔ 𝐴 < (𝐴 + (𝐵 − 𝐴)))) | |
| 5 | 2, 3, 4 | syl2anc 590 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 < (𝐵 − 𝐴) ↔ 𝐴 < (𝐴 + (𝐵 − 𝐴)))) |
| 6 | recn 11126 | . . . 4 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 7 | recn 11126 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
| 8 | pncan3 11399 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + (𝐵 − 𝐴)) = 𝐵) | |
| 9 | 6, 7, 8 | syl2an 602 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + (𝐵 − 𝐴)) = 𝐵) |
| 10 | 9 | breq2d 5091 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < (𝐴 + (𝐵 − 𝐴)) ↔ 𝐴 < 𝐵)) |
| 11 | 5, 10 | bitr2d 281 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ 0 < (𝐵 − 𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 class class class wbr 5079 (class class class)co 7363 ℂcc 11034 ℝcr 11035 0cc0 11036 + caddc 11039 < clt 11177 − cmin 11375 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-po 5533 df-so 5534 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-ltxr 11182 df-sub 11377 df-neg 11378 |
| This theorem is referenced by: posdifi 11698 posdifd 11735 nnsub 12219 nn0sub 12485 znnsub 12571 rpnnen1lem5 12929 difrp 12980 qbtwnre 13149 eluzgtdifelfzo 13680 subfzo0 13745 expnbnd 14192 expmulnbnd 14195 pfxccatin12lem3 14692 eflt 16082 cos01gt0 16156 ndvdsadd 16377 nn0seqcvgd 16537 prmgaplem7 17026 cshwshashlem2 17065 dvcvx 26012 abelthlem7 26428 sinq12gt0 26496 cosq14gt0 26499 cosne0 26518 tanregt0 26528 logdivlti 26609 logcnlem4 26634 scvxcvx 26974 perfectlem2 27218 rplogsumlem2 27473 dchrisum0flblem1 27496 crctcshwlkn0lem3 29905 crctcshwlkn0lem7 29909 mblfinlem3 38033 mblfinlem4 38034 dvasin 38078 geomcau 38133 bfp 38198 submodlt 47826 perfectALTVlem2 48220 |
| Copyright terms: Public domain | W3C validator |