| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > faccl | GIF version | ||
| Description: Closure of the factorial function. (Contributed by NM, 2-Dec-2004.) |
| Ref | Expression |
|---|---|
| faccl | ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) ∈ ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 5698 | . . 3 ⊢ (𝑗 = 0 → (!‘𝑗) = (!‘0)) | |
| 2 | 1 | eleq1d 2307 | . 2 ⊢ (𝑗 = 0 → ((!‘𝑗) ∈ ℕ ↔ (!‘0) ∈ ℕ)) |
| 3 | fveq2 5698 | . . 3 ⊢ (𝑗 = 𝑘 → (!‘𝑗) = (!‘𝑘)) | |
| 4 | 3 | eleq1d 2307 | . 2 ⊢ (𝑗 = 𝑘 → ((!‘𝑗) ∈ ℕ ↔ (!‘𝑘) ∈ ℕ)) |
| 5 | fveq2 5698 | . . 3 ⊢ (𝑗 = (𝑘 + 1) → (!‘𝑗) = (!‘(𝑘 + 1))) | |
| 6 | 5 | eleq1d 2307 | . 2 ⊢ (𝑗 = (𝑘 + 1) → ((!‘𝑗) ∈ ℕ ↔ (!‘(𝑘 + 1)) ∈ ℕ)) |
| 7 | fveq2 5698 | . . 3 ⊢ (𝑗 = 𝑁 → (!‘𝑗) = (!‘𝑁)) | |
| 8 | 7 | eleq1d 2307 | . 2 ⊢ (𝑗 = 𝑁 → ((!‘𝑗) ∈ ℕ ↔ (!‘𝑁) ∈ ℕ)) |
| 9 | fac0 11188 | . . 3 ⊢ (!‘0) = 1 | |
| 10 | 1nn 9324 | . . 3 ⊢ 1 ∈ ℕ | |
| 11 | 9, 10 | eqeltri 2311 | . 2 ⊢ (!‘0) ∈ ℕ |
| 12 | facp1 11190 | . . . . 5 ⊢ (𝑘 ∈ ℕ0 → (!‘(𝑘 + 1)) = ((!‘𝑘) · (𝑘 + 1))) | |
| 13 | 12 | adantl 277 | . . . 4 ⊢ (((!‘𝑘) ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (!‘(𝑘 + 1)) = ((!‘𝑘) · (𝑘 + 1))) |
| 14 | nn0p1nn 9613 | . . . . 5 ⊢ (𝑘 ∈ ℕ0 → (𝑘 + 1) ∈ ℕ) | |
| 15 | nnmulcl 9334 | . . . . 5 ⊢ (((!‘𝑘) ∈ ℕ ∧ (𝑘 + 1) ∈ ℕ) → ((!‘𝑘) · (𝑘 + 1)) ∈ ℕ) | |
| 16 | 14, 15 | sylan2 286 | . . . 4 ⊢ (((!‘𝑘) ∈ ℕ ∧ 𝑘 ∈ ℕ0) → ((!‘𝑘) · (𝑘 + 1)) ∈ ℕ) |
| 17 | 13, 16 | eqeltrd 2315 | . . 3 ⊢ (((!‘𝑘) ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (!‘(𝑘 + 1)) ∈ ℕ) |
| 18 | 17 | expcom 116 | . 2 ⊢ (𝑘 ∈ ℕ0 → ((!‘𝑘) ∈ ℕ → (!‘(𝑘 + 1)) ∈ ℕ)) |
| 19 | 2, 4, 6, 8, 11, 18 | nn0ind 9771 | 1 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) ∈ ℕ) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ‘cfv 5380 (class class class)co 6088 0cc0 8185 1c1 8186 + caddc 8188 · cmul 8190 ℕcn 9313 ℕ0cn0 9574 !cfa 11185 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-ltadd 8301 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-frec 6666 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-inn 9314 df-n0 9575 df-z 9656 df-uz 9938 df-seqfrec 10906 df-fac 11186 |
| This theorem is used by: faccld 11196 facne0 11197 facdiv 11198 facndiv 11199 facwordi 11200 faclbnd 11201 faclbnd2 11202 faclbnd3 11203 faclbnd6 11204 facubnd 11205 facavg 11206 bcrpcl 11213 bcn0 11215 bcm1k 11220 permnn 11232 4bc2eq6 11235 eftcl 12446 reeftcl 12447 eftabs 12448 ef0lem 12452 ege2le3 12463 efcj 12465 efaddlem 12466 effsumlt 12484 eflegeo 12493 ef01bndlem 12548 eirraplem 12569 dvdsfac 12652 prmfac1 12956 pcfac 13158 prmunb 13170 bcmono 16304 |
| Copyright terms: Public domain | W3C validator |