| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > squeeze0 | Structured version Visualization version GIF version | ||
| Description: If a nonnegative number is less than any positive number, it is zero. (Contributed by NM, 11-Feb-2006.) |
| Ref | Expression |
|---|---|
| squeeze0 | ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴 ∧ ∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥)) → 𝐴 = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0re 11291 | . . . 4 ⊢ 0 ∈ ℝ | |
| 2 | leloe 11377 | . . . 4 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (0 ≤ 𝐴 ↔ (0 < 𝐴 ∨ 0 = 𝐴))) | |
| 3 | 1, 2 | mpan 703 | . . 3 ⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐴 ↔ (0 < 𝐴 ∨ 0 = 𝐴))) |
| 4 | breq2 5107 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (0 < 𝑥 ↔ 0 < 𝐴)) | |
| 5 | breq2 5107 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝐴 < 𝑥 ↔ 𝐴 < 𝐴)) | |
| 6 | 4, 5 | imbi12d 347 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((0 < 𝑥 → 𝐴 < 𝑥) ↔ (0 < 𝐴 → 𝐴 < 𝐴))) |
| 7 | 6 | rspcv 3573 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → (0 < 𝐴 → 𝐴 < 𝐴))) |
| 8 | ltnr 11386 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → ¬ 𝐴 < 𝐴) | |
| 9 | 8 | pm2.21d 122 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (𝐴 < 𝐴 → 𝐴 = 0)) |
| 10 | 9 | com12 33 | . . . . . . 7 ⊢ (𝐴 < 𝐴 → (𝐴 ∈ ℝ → 𝐴 = 0)) |
| 11 | 10 | imim2i 17 | . . . . . 6 ⊢ ((0 < 𝐴 → 𝐴 < 𝐴) → (0 < 𝐴 → (𝐴 ∈ ℝ → 𝐴 = 0))) |
| 12 | 11 | com13 89 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (0 < 𝐴 → ((0 < 𝐴 → 𝐴 < 𝐴) → 𝐴 = 0))) |
| 13 | 7, 12 | syl5d 74 | . . . 4 ⊢ (𝐴 ∈ ℝ → (0 < 𝐴 → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0))) |
| 14 | ax-1 6 | . . . . . 6 ⊢ (𝐴 = 0 → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0)) | |
| 15 | 14 | eqcoms 2769 | . . . . 5 ⊢ (0 = 𝐴 → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0)) |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ ℝ → (0 = 𝐴 → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0))) |
| 17 | 13, 16 | jaod 873 | . . 3 ⊢ (𝐴 ∈ ℝ → ((0 < 𝐴 ∨ 0 = 𝐴) → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0))) |
| 18 | 3, 17 | sylbid 243 | . 2 ⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐴 → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0))) |
| 19 | 18 | 3imp 1128 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴 ∧ ∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥)) → 𝐴 = 0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∀wral 3077 class class class wbr 5103 ℝcr 11180 0cc0 11181 < clt 11324 ≤ cle 11325 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-resscn 11238 ax-1cn 11239 ax-addrcl 11242 ax-rnegex 11252 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-po 5559 df-so 5560 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |