| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > facndiv | GIF version | ||
| Description: No positive integer (greater than one) divides the factorial plus one of an equal or larger number. (Contributed by NM, 3-May-2005.) |
| Ref | Expression |
|---|---|
| facndiv | ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ¬ (((!‘𝑀) + 1) / 𝑁) ∈ ℤ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnre 9261 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ) | |
| 2 | recnz 9689 | . . . 4 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → ¬ (1 / 𝑁) ∈ ℤ) | |
| 3 | 1, 2 | sylan 283 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 1 < 𝑁) → ¬ (1 / 𝑁) ∈ ℤ) |
| 4 | 3 | ad2ant2lr 510 | . 2 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ¬ (1 / 𝑁) ∈ ℤ) |
| 5 | facdiv 11125 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ ∧ 𝑁 ≤ 𝑀) → ((!‘𝑀) / 𝑁) ∈ ℕ) | |
| 6 | 5 | 3expa 1230 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ 𝑁 ≤ 𝑀) → ((!‘𝑀) / 𝑁) ∈ ℕ) |
| 7 | 6 | nnzd 9717 | . . . . 5 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ 𝑁 ≤ 𝑀) → ((!‘𝑀) / 𝑁) ∈ ℤ) |
| 8 | 7 | adantrl 478 | . . . 4 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((!‘𝑀) / 𝑁) ∈ ℤ) |
| 9 | zsubcl 9635 | . . . . 5 ⊢ (((((!‘𝑀) + 1) / 𝑁) ∈ ℤ ∧ ((!‘𝑀) / 𝑁) ∈ ℤ) → ((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁)) ∈ ℤ) | |
| 10 | 9 | ex 115 | . . . 4 ⊢ ((((!‘𝑀) + 1) / 𝑁) ∈ ℤ → (((!‘𝑀) / 𝑁) ∈ ℤ → ((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁)) ∈ ℤ)) |
| 11 | 8, 10 | syl5com 29 | . . 3 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((((!‘𝑀) + 1) / 𝑁) ∈ ℤ → ((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁)) ∈ ℤ)) |
| 12 | faccl 11122 | . . . . . . . . 9 ⊢ (𝑀 ∈ ℕ0 → (!‘𝑀) ∈ ℕ) | |
| 13 | 12 | nncnd 9268 | . . . . . . . 8 ⊢ (𝑀 ∈ ℕ0 → (!‘𝑀) ∈ ℂ) |
| 14 | peano2cn 8424 | . . . . . . . 8 ⊢ ((!‘𝑀) ∈ ℂ → ((!‘𝑀) + 1) ∈ ℂ) | |
| 15 | 13, 14 | syl 14 | . . . . . . 7 ⊢ (𝑀 ∈ ℕ0 → ((!‘𝑀) + 1) ∈ ℂ) |
| 16 | 15 | ad2antrr 488 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((!‘𝑀) + 1) ∈ ℂ) |
| 17 | 13 | ad2antrr 488 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → (!‘𝑀) ∈ ℂ) |
| 18 | nncn 9262 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
| 19 | 18 | ad2antlr 489 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → 𝑁 ∈ ℂ) |
| 20 | simplr 529 | . . . . . . 7 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → 𝑁 ∈ ℕ) | |
| 21 | 20 | nnap0d 9300 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → 𝑁 # 0) |
| 22 | 16, 17, 19, 21 | divsubdirapd 9121 | . . . . 5 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((((!‘𝑀) + 1) − (!‘𝑀)) / 𝑁) = ((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁))) |
| 23 | ax-1cn 8236 | . . . . . . . 8 ⊢ 1 ∈ ℂ | |
| 24 | pncan2 8496 | . . . . . . . 8 ⊢ (((!‘𝑀) ∈ ℂ ∧ 1 ∈ ℂ) → (((!‘𝑀) + 1) − (!‘𝑀)) = 1) | |
| 25 | 13, 23, 24 | sylancl 413 | . . . . . . 7 ⊢ (𝑀 ∈ ℕ0 → (((!‘𝑀) + 1) − (!‘𝑀)) = 1) |
| 26 | 25 | oveq1d 6073 | . . . . . 6 ⊢ (𝑀 ∈ ℕ0 → ((((!‘𝑀) + 1) − (!‘𝑀)) / 𝑁) = (1 / 𝑁)) |
| 27 | 26 | ad2antrr 488 | . . . . 5 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((((!‘𝑀) + 1) − (!‘𝑀)) / 𝑁) = (1 / 𝑁)) |
| 28 | 22, 27 | eqtr3d 2269 | . . . 4 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁)) = (1 / 𝑁)) |
| 29 | 28 | eleq1d 2303 | . . 3 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → (((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁)) ∈ ℤ ↔ (1 / 𝑁) ∈ ℤ)) |
| 30 | 11, 29 | sylibd 149 | . 2 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((((!‘𝑀) + 1) / 𝑁) ∈ ℤ → (1 / 𝑁) ∈ ℤ)) |
| 31 | 4, 30 | mtod 669 | 1 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ¬ (((!‘𝑀) + 1) / 𝑁) ∈ ℤ) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 class class class wbr 4114 ‘cfv 5357 (class class class)co 6058 ℂcc 8141 ℝcr 8142 1c1 8144 + caddc 8146 < clt 8324 ≤ cle 8325 − cmin 8460 / cdiv 8963 ℕcn 9254 ℕ0cn0 9513 ℤcz 9594 !cfa 11112 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-mulrcl 8242 ax-addcom 8243 ax-mulcom 8244 ax-addass 8245 ax-mulass 8246 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-1rid 8250 ax-0id 8251 ax-rnegex 8252 ax-precex 8253 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259 ax-pre-mulgt0 8260 ax-pre-mulext 8261 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-po 4422 df-iso 4423 df-iord 4492 df-on 4494 df-ilim 4495 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-frec 6635 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-reap 8866 df-ap 8873 df-div 8964 df-inn 9255 df-n0 9514 df-z 9595 df-uz 9872 df-seqfrec 10834 df-fac 11113 |
| This theorem is referenced by: infpnlem1 13082 |
| Copyright terms: Public domain | W3C validator |