| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > recnz | GIF version | ||
| Description: The reciprocal of a number greater than 1 is not an integer. (Contributed by NM, 3-May-2005.) |
| Ref | Expression |
|---|---|
| recnz | ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → ¬ (1 / 𝐴) ∈ ℤ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | recgt1i 9013 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → (0 < (1 / 𝐴) ∧ (1 / 𝐴) < 1)) | |
| 2 | 1 | simprd 114 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → (1 / 𝐴) < 1) |
| 3 | 1 | simpld 112 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → 0 < (1 / 𝐴)) |
| 4 | zgt0ge1 9473 | . . . 4 ⊢ ((1 / 𝐴) ∈ ℤ → (0 < (1 / 𝐴) ↔ 1 ≤ (1 / 𝐴))) | |
| 5 | 3, 4 | syl5ibcom 155 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → ((1 / 𝐴) ∈ ℤ → 1 ≤ (1 / 𝐴))) |
| 6 | 1re 8113 | . . . 4 ⊢ 1 ∈ ℝ | |
| 7 | 0lt1 8241 | . . . . . . . 8 ⊢ 0 < 1 | |
| 8 | 0re 8114 | . . . . . . . . 9 ⊢ 0 ∈ ℝ | |
| 9 | lttr 8188 | . . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((0 < 1 ∧ 1 < 𝐴) → 0 < 𝐴)) | |
| 10 | 8, 6, 9 | mp3an12 1342 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → ((0 < 1 ∧ 1 < 𝐴) → 0 < 𝐴)) |
| 11 | 7, 10 | mpani 430 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (1 < 𝐴 → 0 < 𝐴)) |
| 12 | 11 | imdistani 445 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → (𝐴 ∈ ℝ ∧ 0 < 𝐴)) |
| 13 | gt0ap0 8741 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 # 0) | |
| 14 | 12, 13 | syl 14 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → 𝐴 # 0) |
| 15 | rerecclap 8845 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 # 0) → (1 / 𝐴) ∈ ℝ) | |
| 16 | 14, 15 | syldan 282 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → (1 / 𝐴) ∈ ℝ) |
| 17 | lenlt 8190 | . . . 4 ⊢ ((1 ∈ ℝ ∧ (1 / 𝐴) ∈ ℝ) → (1 ≤ (1 / 𝐴) ↔ ¬ (1 / 𝐴) < 1)) | |
| 18 | 6, 16, 17 | sylancr 414 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → (1 ≤ (1 / 𝐴) ↔ ¬ (1 / 𝐴) < 1)) |
| 19 | 5, 18 | sylibd 149 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → ((1 / 𝐴) ∈ ℤ → ¬ (1 / 𝐴) < 1)) |
| 20 | 2, 19 | mt2d 628 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → ¬ (1 / 𝐴) ∈ ℤ) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2180 class class class wbr 4062 (class class class)co 5974 ℝcr 7966 0cc0 7967 1c1 7968 < clt 8149 ≤ cle 8150 # cap 8696 / cdiv 8787 ℤcz 9414 |
| 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 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-sep 4181 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-setind 4606 ax-cnex 8058 ax-resscn 8059 ax-1cn 8060 ax-1re 8061 ax-icn 8062 ax-addcl 8063 ax-addrcl 8064 ax-mulcl 8065 ax-mulrcl 8066 ax-addcom 8067 ax-mulcom 8068 ax-addass 8069 ax-mulass 8070 ax-distr 8071 ax-i2m1 8072 ax-0lt1 8073 ax-1rid 8074 ax-0id 8075 ax-rnegex 8076 ax-precex 8077 ax-cnre 8078 ax-pre-ltirr 8079 ax-pre-ltwlin 8080 ax-pre-lttrn 8081 ax-pre-apti 8082 ax-pre-ltadd 8083 ax-pre-mulgt0 8084 ax-pre-mulext 8085 |
| This theorem depends on definitions: df-bi 117 df-3or 984 df-3an 985 df-tru 1378 df-fal 1381 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ne 2381 df-nel 2476 df-ral 2493 df-rex 2494 df-reu 2495 df-rmo 2496 df-rab 2497 df-v 2781 df-sbc 3009 df-dif 3179 df-un 3181 df-in 3183 df-ss 3190 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-uni 3868 df-int 3903 df-br 4063 df-opab 4125 df-id 4361 df-po 4364 df-iso 4365 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-iota 5254 df-fun 5296 df-fv 5302 df-riota 5927 df-ov 5977 df-oprab 5978 df-mpo 5979 df-pnf 8151 df-mnf 8152 df-xr 8153 df-ltxr 8154 df-le 8155 df-sub 8287 df-neg 8288 df-reap 8690 df-ap 8697 df-div 8788 df-inn 9079 df-n0 9338 df-z 9415 |
| This theorem is referenced by: halfnz 9511 facndiv 10928 dvdsprmpweqle 12826 |
| Copyright terms: Public domain | W3C validator |