| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nnrecl | GIF version | ||
| Description: There exists a positive integer whose reciprocal is less than a given positive real. Exercise 3 of [Apostol] p. 28. (Contributed by NM, 8-Nov-2004.) |
| Ref | Expression |
|---|---|
| nnrecl | ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ∃𝑛 ∈ ℕ (1 / 𝑛) < 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 109 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 ∈ ℝ) | |
| 2 | gt0ap0 8784 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 # 0) | |
| 3 | 1, 2 | rerecclapd 8992 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (1 / 𝐴) ∈ ℝ) |
| 4 | arch 9377 | . . 3 ⊢ ((1 / 𝐴) ∈ ℝ → ∃𝑛 ∈ ℕ (1 / 𝐴) < 𝑛) | |
| 5 | 3, 4 | syl 14 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ∃𝑛 ∈ ℕ (1 / 𝐴) < 𝑛) |
| 6 | recgt0 9008 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 0 < (1 / 𝐴)) | |
| 7 | 3, 6 | jca 306 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ((1 / 𝐴) ∈ ℝ ∧ 0 < (1 / 𝐴))) |
| 8 | nnre 9128 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ) | |
| 9 | nngt0 9146 | . . . . . 6 ⊢ (𝑛 ∈ ℕ → 0 < 𝑛) | |
| 10 | 8, 9 | jca 306 | . . . . 5 ⊢ (𝑛 ∈ ℕ → (𝑛 ∈ ℝ ∧ 0 < 𝑛)) |
| 11 | ltrec 9041 | . . . . 5 ⊢ ((((1 / 𝐴) ∈ ℝ ∧ 0 < (1 / 𝐴)) ∧ (𝑛 ∈ ℝ ∧ 0 < 𝑛)) → ((1 / 𝐴) < 𝑛 ↔ (1 / 𝑛) < (1 / (1 / 𝐴)))) | |
| 12 | 7, 10, 11 | syl2an 289 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 0 < 𝐴) ∧ 𝑛 ∈ ℕ) → ((1 / 𝐴) < 𝑛 ↔ (1 / 𝑛) < (1 / (1 / 𝐴)))) |
| 13 | recn 8143 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 14 | 13 | adantr 276 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 ∈ ℂ) |
| 15 | 14, 2 | recrecapd 8943 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (1 / (1 / 𝐴)) = 𝐴) |
| 16 | 15 | breq2d 4095 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ((1 / 𝑛) < (1 / (1 / 𝐴)) ↔ (1 / 𝑛) < 𝐴)) |
| 17 | 16 | adantr 276 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 0 < 𝐴) ∧ 𝑛 ∈ ℕ) → ((1 / 𝑛) < (1 / (1 / 𝐴)) ↔ (1 / 𝑛) < 𝐴)) |
| 18 | 12, 17 | bitrd 188 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 < 𝐴) ∧ 𝑛 ∈ ℕ) → ((1 / 𝐴) < 𝑛 ↔ (1 / 𝑛) < 𝐴)) |
| 19 | 18 | rexbidva 2527 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (∃𝑛 ∈ ℕ (1 / 𝐴) < 𝑛 ↔ ∃𝑛 ∈ ℕ (1 / 𝑛) < 𝐴)) |
| 20 | 5, 19 | mpbid 147 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ∃𝑛 ∈ ℕ (1 / 𝑛) < 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2200 ∃wrex 2509 class class class wbr 4083 (class class class)co 6007 ℂcc 8008 ℝcr 8009 0cc0 8010 1c1 8011 < clt 8192 / cdiv 8830 ℕcn 9121 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-mulrcl 8109 ax-addcom 8110 ax-mulcom 8111 ax-addass 8112 ax-mulass 8113 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-1rid 8117 ax-0id 8118 ax-rnegex 8119 ax-precex 8120 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-apti 8125 ax-pre-ltadd 8126 ax-pre-mulgt0 8127 ax-pre-mulext 8128 ax-arch 8129 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-br 4084 df-opab 4146 df-id 4384 df-po 4387 df-iso 4388 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-iota 5278 df-fun 5320 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-reap 8733 df-ap 8740 df-div 8831 df-inn 9122 |
| This theorem is referenced by: qbtwnre 10488 trilpolemlt1 16473 |
| Copyright terms: Public domain | W3C validator |