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 8727 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ) | |
2 | recnz 9144 | . . . 4 ⊢ ((𝑁 ∈ ℝ ∧ 1 < 𝑁) → ¬ (1 / 𝑁) ∈ ℤ) | |
3 | 1, 2 | sylan 281 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 1 < 𝑁) → ¬ (1 / 𝑁) ∈ ℤ) |
4 | 3 | ad2ant2lr 501 | . 2 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ¬ (1 / 𝑁) ∈ ℤ) |
5 | facdiv 10484 | . . . . . . 7 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ ∧ 𝑁 ≤ 𝑀) → ((!‘𝑀) / 𝑁) ∈ ℕ) | |
6 | 5 | 3expa 1181 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ 𝑁 ≤ 𝑀) → ((!‘𝑀) / 𝑁) ∈ ℕ) |
7 | 6 | nnzd 9172 | . . . . 5 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ 𝑁 ≤ 𝑀) → ((!‘𝑀) / 𝑁) ∈ ℤ) |
8 | 7 | adantrl 469 | . . . 4 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((!‘𝑀) / 𝑁) ∈ ℤ) |
9 | zsubcl 9095 | . . . . 5 ⊢ (((((!‘𝑀) + 1) / 𝑁) ∈ ℤ ∧ ((!‘𝑀) / 𝑁) ∈ ℤ) → ((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁)) ∈ ℤ) | |
10 | 9 | ex 114 | . . . 4 ⊢ ((((!‘𝑀) + 1) / 𝑁) ∈ ℤ → (((!‘𝑀) / 𝑁) ∈ ℤ → ((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁)) ∈ ℤ)) |
11 | 8, 10 | syl5com 29 | . . 3 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((((!‘𝑀) + 1) / 𝑁) ∈ ℤ → ((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁)) ∈ ℤ)) |
12 | faccl 10481 | . . . . . . . . 9 ⊢ (𝑀 ∈ ℕ0 → (!‘𝑀) ∈ ℕ) | |
13 | 12 | nncnd 8734 | . . . . . . . 8 ⊢ (𝑀 ∈ ℕ0 → (!‘𝑀) ∈ ℂ) |
14 | peano2cn 7897 | . . . . . . . 8 ⊢ ((!‘𝑀) ∈ ℂ → ((!‘𝑀) + 1) ∈ ℂ) | |
15 | 13, 14 | syl 14 | . . . . . . 7 ⊢ (𝑀 ∈ ℕ0 → ((!‘𝑀) + 1) ∈ ℂ) |
16 | 15 | ad2antrr 479 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((!‘𝑀) + 1) ∈ ℂ) |
17 | 13 | ad2antrr 479 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → (!‘𝑀) ∈ ℂ) |
18 | nncn 8728 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
19 | 18 | ad2antlr 480 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → 𝑁 ∈ ℂ) |
20 | simplr 519 | . . . . . . 7 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → 𝑁 ∈ ℕ) | |
21 | 20 | nnap0d 8766 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → 𝑁 # 0) |
22 | 16, 17, 19, 21 | divsubdirapd 8590 | . . . . 5 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((((!‘𝑀) + 1) − (!‘𝑀)) / 𝑁) = ((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁))) |
23 | ax-1cn 7713 | . . . . . . . 8 ⊢ 1 ∈ ℂ | |
24 | pncan2 7969 | . . . . . . . 8 ⊢ (((!‘𝑀) ∈ ℂ ∧ 1 ∈ ℂ) → (((!‘𝑀) + 1) − (!‘𝑀)) = 1) | |
25 | 13, 23, 24 | sylancl 409 | . . . . . . 7 ⊢ (𝑀 ∈ ℕ0 → (((!‘𝑀) + 1) − (!‘𝑀)) = 1) |
26 | 25 | oveq1d 5789 | . . . . . 6 ⊢ (𝑀 ∈ ℕ0 → ((((!‘𝑀) + 1) − (!‘𝑀)) / 𝑁) = (1 / 𝑁)) |
27 | 26 | ad2antrr 479 | . . . . 5 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((((!‘𝑀) + 1) − (!‘𝑀)) / 𝑁) = (1 / 𝑁)) |
28 | 22, 27 | eqtr3d 2174 | . . . 4 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁)) = (1 / 𝑁)) |
29 | 28 | eleq1d 2208 | . . 3 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → (((((!‘𝑀) + 1) / 𝑁) − ((!‘𝑀) / 𝑁)) ∈ ℤ ↔ (1 / 𝑁) ∈ ℤ)) |
30 | 11, 29 | sylibd 148 | . 2 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ((((!‘𝑀) + 1) / 𝑁) ∈ ℤ → (1 / 𝑁) ∈ ℤ)) |
31 | 4, 30 | mtod 652 | 1 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) ∧ (1 < 𝑁 ∧ 𝑁 ≤ 𝑀)) → ¬ (((!‘𝑀) + 1) / 𝑁) ∈ ℤ) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 = wceq 1331 ∈ wcel 1480 class class class wbr 3929 ‘cfv 5123 (class class class)co 5774 ℂcc 7618 ℝcr 7619 1c1 7621 + caddc 7623 < clt 7800 ≤ cle 7801 − cmin 7933 / cdiv 8432 ℕcn 8720 ℕ0cn0 8977 ℤcz 9054 !cfa 10471 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-mulrcl 7719 ax-addcom 7720 ax-mulcom 7721 ax-addass 7722 ax-mulass 7723 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-1rid 7727 ax-0id 7728 ax-rnegex 7729 ax-precex 7730 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-apti 7735 ax-pre-ltadd 7736 ax-pre-mulgt0 7737 ax-pre-mulext 7738 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rmo 2424 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-id 4215 df-po 4218 df-iso 4219 df-iord 4288 df-on 4290 df-ilim 4291 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-frec 6288 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-reap 8337 df-ap 8344 df-div 8433 df-inn 8721 df-n0 8978 df-z 9055 df-uz 9327 df-seqfrec 10219 df-fac 10472 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |