| 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 11210 | . . 3 ⊢ (𝐵 ∈ ℝ → 0 ∈ ℝ) | |
| 2 | letri3 11294 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 = 0 ↔ (𝐴 ≤ 0 ∧ 0 ≤ 𝐴))) | |
| 3 | 1, 2 | sylan2 604 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 = 0 ↔ (𝐴 ≤ 0 ∧ 0 ≤ 𝐴))) |
| 4 | ancom 465 | . . 3 ⊢ ((𝐴 ≤ 0 ∧ 0 ≤ 𝐴) ↔ (0 ≤ 𝐴 ∧ 𝐴 ≤ 0)) | |
| 5 | simpr 489 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → 𝐴 ∈ ℝ) | |
| 6 | 0red 11210 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → 0 ∈ ℝ) | |
| 7 | simpl 487 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → 𝐵 ∈ ℝ) | |
| 8 | lesub2 11708 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 0 ↔ (𝐵 − 0) ≤ (𝐵 − 𝐴))) | |
| 9 | 5, 6, 7, 8 | syl3anc 1396 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐴 ≤ 0 ↔ (𝐵 − 0) ≤ (𝐵 − 𝐴))) |
| 10 | 7 | recnd 11236 | . . . . . . . 8 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → 𝐵 ∈ ℂ) |
| 11 | 10 | subid1d 11557 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 − 0) = 𝐵) |
| 12 | 11 | breq1d 5118 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((𝐵 − 0) ≤ (𝐵 − 𝐴) ↔ 𝐵 ≤ (𝐵 − 𝐴))) |
| 13 | 9, 12 | bitrd 282 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐴 ≤ 0 ↔ 𝐵 ≤ (𝐵 − 𝐴))) |
| 14 | 13 | ancoms 463 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 0 ↔ 𝐵 ≤ (𝐵 − 𝐴))) |
| 15 | 14 | anbi2d 641 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 ≤ 𝐴 ∧ 𝐴 ≤ 0) ↔ (0 ≤ 𝐴 ∧ 𝐵 ≤ (𝐵 − 𝐴)))) |
| 16 | 4, 15 | bitrid 286 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 ≤ 0 ∧ 0 ≤ 𝐴) ↔ (0 ≤ 𝐴 ∧ 𝐵 ≤ (𝐵 − 𝐴)))) |
| 17 | 3, 16 | bitr2d 283 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 ≤ 𝐴 ∧ 𝐵 ≤ (𝐵 − 𝐴)) ↔ 𝐴 = 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∈ wcel 2141 class class class wbr 5108 (class class class)co 7410 ℝcr 11098 0cc0 11099 ≤ cle 11243 − cmin 11440 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5556 df-po 5569 df-so 5570 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 |
| This theorem is referenced by: lesub0i 11761 |
| Copyright terms: Public domain | W3C validator |