![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > lesub0 | Structured version Visualization version GIF version |
Description: Lemma to show a nonnegative number is zero. (Contributed by NM, 8-Oct-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
lesub0 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 ≤ 𝐴 ∧ 𝐵 ≤ (𝐵 − 𝐴)) ↔ 𝐴 = 0)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0red 11293 | . . 3 ⊢ (𝐵 ∈ ℝ → 0 ∈ ℝ) | |
2 | letri3 11375 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 = 0 ↔ (𝐴 ≤ 0 ∧ 0 ≤ 𝐴))) | |
3 | 1, 2 | sylan2 592 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 = 0 ↔ (𝐴 ≤ 0 ∧ 0 ≤ 𝐴))) |
4 | ancom 460 | . . 3 ⊢ ((𝐴 ≤ 0 ∧ 0 ≤ 𝐴) ↔ (0 ≤ 𝐴 ∧ 𝐴 ≤ 0)) | |
5 | simpr 484 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → 𝐴 ∈ ℝ) | |
6 | 0red 11293 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → 0 ∈ ℝ) | |
7 | simpl 482 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → 𝐵 ∈ ℝ) | |
8 | lesub2 11785 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 0 ↔ (𝐵 − 0) ≤ (𝐵 − 𝐴))) | |
9 | 5, 6, 7, 8 | syl3anc 1371 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐴 ≤ 0 ↔ (𝐵 − 0) ≤ (𝐵 − 𝐴))) |
10 | 7 | recnd 11318 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → 𝐵 ∈ ℂ) |
11 | 10 | subid1d 11636 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 − 0) = 𝐵) |
12 | 11 | breq1d 5176 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((𝐵 − 0) ≤ (𝐵 − 𝐴) ↔ 𝐵 ≤ (𝐵 − 𝐴))) |
13 | 9, 12 | bitrd 279 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐴 ≤ 0 ↔ 𝐵 ≤ (𝐵 − 𝐴))) |
14 | 13 | ancoms 458 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 0 ↔ 𝐵 ≤ (𝐵 − 𝐴))) |
15 | 14 | anbi2d 629 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 ≤ 𝐴 ∧ 𝐴 ≤ 0) ↔ (0 ≤ 𝐴 ∧ 𝐵 ≤ (𝐵 − 𝐴)))) |
16 | 4, 15 | bitrid 283 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 0 ∧ 0 ≤ 𝐴) ↔ (0 ≤ 𝐴 ∧ 𝐵 ≤ (𝐵 − 𝐴)))) |
17 | 3, 16 | bitr2d 280 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 ≤ 𝐴 ∧ 𝐵 ≤ (𝐵 − 𝐴)) ↔ 𝐴 = 0)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 class class class wbr 5166 (class class class)co 7448 ℝcr 11183 0cc0 11184 ≤ cle 11325 − cmin 11520 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-po 5607 df-so 5608 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 |
This theorem is referenced by: lesub0i 11838 |
Copyright terms: Public domain | W3C validator |