| 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 11137 | . . . 4 ⊢ 0 ∈ ℝ | |
| 2 | leloe 11223 | . . . 4 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (0 ≤ 𝐴 ↔ (0 < 𝐴 ∨ 0 = 𝐴))) | |
| 3 | 1, 2 | mpan 691 | . . 3 ⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐴 ↔ (0 < 𝐴 ∨ 0 = 𝐴))) |
| 4 | breq2 5090 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (0 < 𝑥 ↔ 0 < 𝐴)) | |
| 5 | breq2 5090 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝐴 < 𝑥 ↔ 𝐴 < 𝐴)) | |
| 6 | 4, 5 | imbi12d 344 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ((0 < 𝑥 → 𝐴 < 𝑥) ↔ (0 < 𝐴 → 𝐴 < 𝐴))) |
| 7 | 6 | rspcv 3561 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → (0 < 𝐴 → 𝐴 < 𝐴))) |
| 8 | ltnr 11232 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → ¬ 𝐴 < 𝐴) | |
| 9 | 8 | pm2.21d 121 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (𝐴 < 𝐴 → 𝐴 = 0)) |
| 10 | 9 | com12 32 | . . . . . . 7 ⊢ (𝐴 < 𝐴 → (𝐴 ∈ ℝ → 𝐴 = 0)) |
| 11 | 10 | imim2i 16 | . . . . . 6 ⊢ ((0 < 𝐴 → 𝐴 < 𝐴) → (0 < 𝐴 → (𝐴 ∈ ℝ → 𝐴 = 0))) |
| 12 | 11 | com13 88 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (0 < 𝐴 → ((0 < 𝐴 → 𝐴 < 𝐴) → 𝐴 = 0))) |
| 13 | 7, 12 | syl5d 73 | . . . 4 ⊢ (𝐴 ∈ ℝ → (0 < 𝐴 → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0))) |
| 14 | ax-1 6 | . . . . . 6 ⊢ (𝐴 = 0 → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0)) | |
| 15 | 14 | eqcoms 2745 | . . . . 5 ⊢ (0 = 𝐴 → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0)) |
| 16 | 15 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ ℝ → (0 = 𝐴 → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0))) |
| 17 | 13, 16 | jaod 860 | . . 3 ⊢ (𝐴 ∈ ℝ → ((0 < 𝐴 ∨ 0 = 𝐴) → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0))) |
| 18 | 3, 17 | sylbid 240 | . 2 ⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐴 → (∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥) → 𝐴 = 0))) |
| 19 | 18 | 3imp 1111 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴 ∧ ∀𝑥 ∈ ℝ (0 < 𝑥 → 𝐴 < 𝑥)) → 𝐴 = 0) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∨ wo 848 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 class class class wbr 5086 ℝcr 11028 0cc0 11029 < clt 11170 ≤ cle 11171 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-resscn 11086 ax-1cn 11087 ax-addrcl 11090 ax-rnegex 11100 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5519 df-po 5532 df-so 5533 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 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-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |