| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Archimedean property of real numbers. For any real number, there is an integer greater than it. Theorem I.29 of [Apostol] p. 26. |
| Ref | Expression |
|---|---|
| arch | ⊢ (A ∈ ℝ → ∃x ∈ ℕ A < x) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 2065 | . . 3 ⊢ (y = A → (y < x ↔ A < x)) | |
| 2 | 1 | birexdv 1220 | . 2 ⊢ (y = A → (∃x ∈ ℕ y < x ↔ ∃x ∈ ℕ A < x)) |
| 3 | nnunb 4520 | . . . 4 ⊢ ¬ ∃y ∈ ℝ ∀x ∈ ℕ (x < y ∨ x = y) | |
| 4 | ralnex 1209 | . . . 4 ⊢ (∀y ∈ ℝ ¬ ∀x ∈ ℕ (x < y ∨ x = y) ↔ ¬ ∃y ∈ ℝ ∀x ∈ ℕ (x < y ∨ x = y)) | |
| 5 | 3, 4 | mpbir 165 | . . 3 ⊢ ∀y ∈ ℝ ¬ ∀x ∈ ℕ (x < y ∨ x = y) |
| 6 | axlttri 4083 | . . . . . . . . 9 ⊢ ((y ∈ ℝ ∧ x ∈ ℝ) → (y < x ↔ ¬ (y = x ∨ x < y))) | |
| 7 | nnret 4427 | . . . . . . . . 9 ⊢ (x ∈ ℕ → x ∈ ℝ) | |
| 8 | 6, 7 | sylan2 346 | . . . . . . . 8 ⊢ ((y ∈ ℝ ∧ x ∈ ℕ) → (y < x ↔ ¬ (y = x ∨ x < y))) |
| 9 | cleqcom 1103 | . . . . . . . . . . 11 ⊢ (y = x ↔ x = y) | |
| 10 | 9 | orbi1i 215 | . . . . . . . . . 10 ⊢ ((y = x ∨ x < y) ↔ (x = y ∨ x < y)) |
| 11 | orcom 209 | . . . . . . . . . 10 ⊢ ((x = y ∨ x < y) ↔ (x < y ∨ x = y)) | |
| 12 | 10, 11 | bitr 151 | . . . . . . . . 9 ⊢ ((y = x ∨ x < y) ↔ (x < y ∨ x = y)) |
| 13 | 12 | negbii 162 | . . . . . . . 8 ⊢ (¬ (y = x ∨ x < y) ↔ ¬ (x < y ∨ x = y)) |
| 14 | 8, 13 | syl6bb 414 | . . . . . . 7 ⊢ ((y ∈ ℝ ∧ x ∈ ℕ) → (y < x ↔ ¬ (x < y ∨ x = y))) |
| 15 | 14 | biimprd 136 | . . . . . 6 ⊢ ((y ∈ ℝ ∧ x ∈ ℕ) → (¬ (x < y ∨ x = y) → y < x)) |
| 16 | 15 | r19.22dva 1280 | . . . . 5 ⊢ (y ∈ ℝ → (∃x ∈ ℕ ¬ (x < y ∨ x = y) → ∃x ∈ ℕ y < x)) |
| 17 | rexnal 1210 | . . . . 5 ⊢ (∃x ∈ ℕ ¬ (x < y ∨ x = y) ↔ ¬ ∀x ∈ ℕ (x < y ∨ x = y)) | |
| 18 | 16, 17 | syl5ibr 182 | . . . 4 ⊢ (y ∈ ℝ → (¬ ∀x ∈ ℕ (x < y ∨ x = y) → ∃x ∈ ℕ y < x)) |
| 19 | 18 | r19.20i 1253 | . . 3 ⊢ (∀y ∈ ℝ ¬ ∀x ∈ ℕ (x < y ∨ x = y) → ∀y ∈ ℝ ∃x ∈ ℕ y < x) |
| 20 | 5, 19 | ax-mp 6 | . 2 ⊢ ∀y ∈ ℝ ∃x ∈ ℕ y < x |
| 21 | 2, 20 | vtoclri 1393 | 1 ⊢ (A ∈ ℝ → ∃x ∈ ℕ A < x) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 1 → wi 2 ↔ wb 127 ∨ wo 195 ∧ wa 196 = weq 797 = wceq 1091 ∈ wcel 1092 ∀wral 1201 ∃wrex 1202 class class class wbr 2054 ℝcr 4027 < clt 4033 ℕcn 4093 |
| This theorem is referenced by: nnreclt 4522 btwnz 4613 projlem1 5193 projlem26 5218 |
| 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-n 4423 |