| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > facnn | Structured version Visualization version GIF version | ||
| Description: Value of the factorial function for positive integers. (Contributed by NM, 2-Dec-2004.) (Revised by Mario Carneiro, 13-Jul-2013.) |
| Ref | Expression |
|---|---|
| facnn | ⊢ (𝑁 ∈ ℕ → (!‘𝑁) = (seq1( · , I )‘𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | c0ex 11128 | . . . 4 ⊢ 0 ∈ V | |
| 2 | 1 | a1i 11 | . . 3 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → 0 ∈ V) |
| 3 | 1ex 11130 | . . . 4 ⊢ 1 ∈ V | |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → 1 ∈ V) |
| 5 | df-fac 14199 | . . . 4 ⊢ ! = ({〈0, 1〉} ∪ seq1( · , I )) | |
| 6 | nnuz 12796 | . . . . . . . 8 ⊢ ℕ = (ℤ≥‘1) | |
| 7 | dfn2 12415 | . . . . . . . 8 ⊢ ℕ = (ℕ0 ∖ {0}) | |
| 8 | 6, 7 | eqtr3i 2754 | . . . . . . 7 ⊢ (ℤ≥‘1) = (ℕ0 ∖ {0}) |
| 9 | 8 | reseq2i 5931 | . . . . . 6 ⊢ (seq1( · , I ) ↾ (ℤ≥‘1)) = (seq1( · , I ) ↾ (ℕ0 ∖ {0})) |
| 10 | 1z 12523 | . . . . . . 7 ⊢ 1 ∈ ℤ | |
| 11 | seqfn 13938 | . . . . . . 7 ⊢ (1 ∈ ℤ → seq1( · , I ) Fn (ℤ≥‘1)) | |
| 12 | fnresdm 6605 | . . . . . . 7 ⊢ (seq1( · , I ) Fn (ℤ≥‘1) → (seq1( · , I ) ↾ (ℤ≥‘1)) = seq1( · , I )) | |
| 13 | 10, 11, 12 | mp2b 10 | . . . . . 6 ⊢ (seq1( · , I ) ↾ (ℤ≥‘1)) = seq1( · , I ) |
| 14 | 9, 13 | eqtr3i 2754 | . . . . 5 ⊢ (seq1( · , I ) ↾ (ℕ0 ∖ {0})) = seq1( · , I ) |
| 15 | 14 | uneq2i 4118 | . . . 4 ⊢ ({〈0, 1〉} ∪ (seq1( · , I ) ↾ (ℕ0 ∖ {0}))) = ({〈0, 1〉} ∪ seq1( · , I )) |
| 16 | 5, 15 | eqtr4i 2755 | . . 3 ⊢ ! = ({〈0, 1〉} ∪ (seq1( · , I ) ↾ (ℕ0 ∖ {0}))) |
| 17 | id 22 | . . 3 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → 𝑁 ∈ (ℕ0 ∖ {0})) | |
| 18 | 2, 4, 16, 17 | fvsnun2 7123 | . 2 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → (!‘𝑁) = (seq1( · , I )‘𝑁)) |
| 19 | 18, 7 | eleq2s 2846 | 1 ⊢ (𝑁 ∈ ℕ → (!‘𝑁) = (seq1( · , I )‘𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 Vcvv 3438 ∖ cdif 3902 ∪ cun 3903 {csn 4579 〈cop 4585 I cid 5517 ↾ cres 5625 Fn wfn 6481 ‘cfv 6486 0cc0 11028 1c1 11029 · cmul 11033 ℕcn 12146 ℕ0cn0 12402 ℤcz 12489 ℤ≥cuz 12753 seqcseq 13926 !cfa 14198 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8632 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-nn 12147 df-n0 12403 df-z 12490 df-uz 12754 df-seq 13927 df-fac 14199 |
| This theorem is referenced by: fac1 14202 facp1 14203 bcval5 14243 fprodfac 15898 logfac 26526 wilthlem3 26996 |
| Copyright terms: Public domain | W3C validator |