| 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 11098 | . . . 4 ⊢ 0 ∈ V | |
| 2 | 1 | a1i 11 | . . 3 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → 0 ∈ V) |
| 3 | 1ex 11100 | . . . 4 ⊢ 1 ∈ V | |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → 1 ∈ V) |
| 5 | df-fac 14173 | . . . 4 ⊢ ! = ({〈0, 1〉} ∪ seq1( · , I )) | |
| 6 | nnuz 12767 | . . . . . . . 8 ⊢ ℕ = (ℤ≥‘1) | |
| 7 | dfn2 12386 | . . . . . . . 8 ⊢ ℕ = (ℕ0 ∖ {0}) | |
| 8 | 6, 7 | eqtr3i 2755 | . . . . . . 7 ⊢ (ℤ≥‘1) = (ℕ0 ∖ {0}) |
| 9 | 8 | reseq2i 5922 | . . . . . 6 ⊢ (seq1( · , I ) ↾ (ℤ≥‘1)) = (seq1( · , I ) ↾ (ℕ0 ∖ {0})) |
| 10 | 1z 12494 | . . . . . . 7 ⊢ 1 ∈ ℤ | |
| 11 | seqfn 13912 | . . . . . . 7 ⊢ (1 ∈ ℤ → seq1( · , I ) Fn (ℤ≥‘1)) | |
| 12 | fnresdm 6596 | . . . . . . 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 2755 | . . . . 5 ⊢ (seq1( · , I ) ↾ (ℕ0 ∖ {0})) = seq1( · , I ) |
| 15 | 14 | uneq2i 4113 | . . . 4 ⊢ ({〈0, 1〉} ∪ (seq1( · , I ) ↾ (ℕ0 ∖ {0}))) = ({〈0, 1〉} ∪ seq1( · , I )) |
| 16 | 5, 15 | eqtr4i 2756 | . . 3 ⊢ ! = ({〈0, 1〉} ∪ (seq1( · , I ) ↾ (ℕ0 ∖ {0}))) |
| 17 | id 22 | . . 3 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → 𝑁 ∈ (ℕ0 ∖ {0})) | |
| 18 | 2, 4, 16, 17 | fvsnun2 7112 | . 2 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → (!‘𝑁) = (seq1( · , I )‘𝑁)) |
| 19 | 18, 7 | eleq2s 2847 | 1 ⊢ (𝑁 ∈ ℕ → (!‘𝑁) = (seq1( · , I )‘𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2110 Vcvv 3434 ∖ cdif 3897 ∪ cun 3898 {csn 4574 〈cop 4580 I cid 5508 ↾ cres 5616 Fn wfn 6472 ‘cfv 6477 0cc0 10998 1c1 10999 · cmul 11003 ℕcn 12117 ℕ0cn0 12373 ℤcz 12460 ℤ≥cuz 12724 seqcseq 13900 !cfa 14172 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 ax-cnex 11054 ax-resscn 11055 ax-1cn 11056 ax-icn 11057 ax-addcl 11058 ax-addrcl 11059 ax-mulcl 11060 ax-mulrcl 11061 ax-mulcom 11062 ax-addass 11063 ax-mulass 11064 ax-distr 11065 ax-i2m1 11066 ax-1ne0 11067 ax-1rid 11068 ax-rnegex 11069 ax-rrecex 11070 ax-cnre 11071 ax-pre-lttri 11072 ax-pre-lttrn 11073 ax-pre-ltadd 11074 ax-pre-mulgt0 11075 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3345 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6244 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-riota 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-er 8617 df-en 8865 df-dom 8866 df-sdom 8867 df-pnf 11140 df-mnf 11141 df-xr 11142 df-ltxr 11143 df-le 11144 df-sub 11338 df-neg 11339 df-nn 12118 df-n0 12374 df-z 12461 df-uz 12725 df-seq 13901 df-fac 14173 |
| This theorem is referenced by: fac1 14176 facp1 14177 bcval5 14217 fprodfac 15872 logfac 26530 wilthlem3 27000 |
| Copyright terms: Public domain | W3C validator |