| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: There exists no smallest positive real number. |
| Ref | Expression |
|---|---|
| nominpos | ⊢ ¬ ∃x ∈ ℝ (0 < x ∧ ¬ ∃y ∈ ℝ (0 < y ∧ y < x)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2re 4470 | . . . . . . 7 ⊢ 2 ∈ ℝ | |
| 2 | 2pos 4479 | . . . . . . . . 9 ⊢ 0 < 2 | |
| 3 | 1, 2 | gt0ne0i 4345 | . . . . . . . 8 ⊢ 2 ≠ 0 |
| 4 | redivclt 4276 | . . . . . . . 8 ⊢ (((x ∈ ℝ ∧ 2 ∈ ℝ) ∧ 2 ≠ 0) → (x / 2) ∈ ℝ) | |
| 5 | 3, 4 | mpan2 519 | . . . . . . 7 ⊢ ((x ∈ ℝ ∧ 2 ∈ ℝ) → (x / 2) ∈ ℝ) |
| 6 | 1, 5 | mpan2 519 | . . . . . 6 ⊢ (x ∈ ℝ → (x / 2) ∈ ℝ) |
| 7 | 6 | a1d 14 | . . . . 5 ⊢ (x ∈ ℝ → (0 < x → (x / 2) ∈ ℝ)) |
| 8 | divgt0t 4402 | . . . . . . . 8 ⊢ ((x ∈ ℝ ∧ 2 ∈ ℝ) → ((0 < x ∧ 0 < 2) → 0 < (x / 2))) | |
| 9 | 1, 8 | mpan2 519 | . . . . . . 7 ⊢ (x ∈ ℝ → ((0 < x ∧ 0 < 2) → 0 < (x / 2))) |
| 10 | 2, 9 | mpan2i 522 | . . . . . 6 ⊢ (x ∈ ℝ → (0 < x → 0 < (x / 2))) |
| 11 | halfpost 4508 | . . . . . . 7 ⊢ (x ∈ ℝ → (0 < x ↔ (x / 2) < x)) | |
| 12 | 11 | biimpd 135 | . . . . . 6 ⊢ (x ∈ ℝ → (0 < x → (x / 2) < x)) |
| 13 | 10, 12 | jcad 455 | . . . . 5 ⊢ (x ∈ ℝ → (0 < x → (0 < (x / 2) ∧ (x / 2) < x))) |
| 14 | 7, 13 | jcad 455 | . . . 4 ⊢ (x ∈ ℝ → (0 < x → ((x / 2) ∈ ℝ ∧ (0 < (x / 2) ∧ (x / 2) < x)))) |
| 15 | breq2 2066 | . . . . . 6 ⊢ (y = (x / 2) → (0 < y ↔ 0 < (x / 2))) | |
| 16 | breq1 2065 | . . . . . 6 ⊢ (y = (x / 2) → (y < x ↔ (x / 2) < x)) | |
| 17 | 15, 16 | anbi12d 476 | . . . . 5 ⊢ (y = (x / 2) → ((0 < y ∧ y < x) ↔ (0 < (x / 2) ∧ (x / 2) < x))) |
| 18 | 17 | rcla4ev 1403 | . . . 4 ⊢ (((x / 2) ∈ ℝ ∧ (0 < (x / 2) ∧ (x / 2) < x)) → ∃y ∈ ℝ (0 < y ∧ y < x)) |
| 19 | 14, 18 | syl6 23 | . . 3 ⊢ (x ∈ ℝ → (0 < x → ∃y ∈ ℝ (0 < y ∧ y < x))) |
| 20 | iman 205 | . . 3 ⊢ ((0 < x → ∃y ∈ ℝ (0 < y ∧ y < x)) ↔ ¬ (0 < x ∧ ¬ ∃y ∈ ℝ (0 < y ∧ y < x))) | |
| 21 | 19, 20 | sylib 173 | . 2 ⊢ (x ∈ ℝ → ¬ (0 < x ∧ ¬ ∃y ∈ ℝ (0 < y ∧ y < x))) |
| 22 | 21 | nrex 1270 | 1 ⊢ ¬ ∃x ∈ ℝ (0 < x ∧ ¬ ∃y ∈ ℝ (0 < y ∧ y < x)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 1 → wi 2 ∧ wa 196 = wceq 1091 ∈ wcel 1092 ≠ wne 1190 ∃wrex 1202 class class class wbr 2054 (class class class)co 3001 ℝcr 4027 0cc0 4028 < clt 4033 / cdiv 4091 2c2 4454 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-un 1076 ax-pow 1077 ax-reg 1078 ax-inf 1079 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-3or 582 df-3an 583 df-ex 679 df-sb 853 df-eu 1009 df-mo 1010 df-clab 1093 df-cleq 1097 df-clel 1099 df-ne 1192 df-ral 1205 df-rex 1206 df-reu 1207 df-rab 1208 df-v 1349 df-sbc 1441 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-pss 1494 df-nul 1708 df-if 1777 df-pw 1799 df-sn 1811 df-pr 1812 df-tp 1814 df-op 1815 df-uni 1920 df-int 1966 df-iun 1996 df-tr 2042 df-br 2063 df-opab 2098 df-eprel 2122 df-id 2125 df-po 2128 df-so 2138 df-fr 2169 df-we 2186 df-ord 2202 df-on 2203 df-lim 2204 df-suc 2205 df-om 2373 df-xp 2424 df-rel 2425 df-cnv 2426 df-co 2427 df-dm 2428 df-rn 2429 df-res 2430 df-ima 2431 df-fun 2432 df-fn 2433 df-f 2434 df-f1 2435 df-fv 2438 df-rdg 2970 df-opr 3003 df-oprab 3004 df-1o 3104 df-oadd 3106 df-omul 3107 df-er 3200 df-ec 3202 df-qs 3205 df-ni 3794 df-pli 3795 df-mi 3796 df-lti 3797 df-plpq 3829 df-mpq 3830 df-enq 3831 df-nq 3832 df-plq 3833 df-mq 3834 df-rq 3835 df-ltq 3836 df-1q 3837 df-np 3880 df-1p 3881 df-plp 3882 df-mp 3883 df-ltp 3884 df-plpr 3958 df-mpr 3959 df-enr 3960 df-nr 3961 df-plr 3962 df-mr 3963 df-ltr 3964 df-0r 3965 df-1r 3966 df-m1r 3967 df-c 4034 df-0 4035 df-1 4036 df-r 4038 df-plus 4039 df-mul 4040 df-lt 4041 df-sub 4133 df-neg 4135 df-div 4216 df-le 4277 df-2 4462 |