![]() |
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 11284 | . . . 4 ⊢ 0 ∈ V | |
2 | 1 | a1i 11 | . . 3 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → 0 ∈ V) |
3 | 1ex 11286 | . . . 4 ⊢ 1 ∈ V | |
4 | 3 | a1i 11 | . . 3 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → 1 ∈ V) |
5 | df-fac 14323 | . . . 4 ⊢ ! = ({〈0, 1〉} ∪ seq1( · , I )) | |
6 | nnuz 12946 | . . . . . . . 8 ⊢ ℕ = (ℤ≥‘1) | |
7 | dfn2 12566 | . . . . . . . 8 ⊢ ℕ = (ℕ0 ∖ {0}) | |
8 | 6, 7 | eqtr3i 2770 | . . . . . . 7 ⊢ (ℤ≥‘1) = (ℕ0 ∖ {0}) |
9 | 8 | reseq2i 6006 | . . . . . 6 ⊢ (seq1( · , I ) ↾ (ℤ≥‘1)) = (seq1( · , I ) ↾ (ℕ0 ∖ {0})) |
10 | 1z 12673 | . . . . . . 7 ⊢ 1 ∈ ℤ | |
11 | seqfn 14064 | . . . . . . 7 ⊢ (1 ∈ ℤ → seq1( · , I ) Fn (ℤ≥‘1)) | |
12 | fnresdm 6699 | . . . . . . 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 2770 | . . . . 5 ⊢ (seq1( · , I ) ↾ (ℕ0 ∖ {0})) = seq1( · , I ) |
15 | 14 | uneq2i 4188 | . . . 4 ⊢ ({〈0, 1〉} ∪ (seq1( · , I ) ↾ (ℕ0 ∖ {0}))) = ({〈0, 1〉} ∪ seq1( · , I )) |
16 | 5, 15 | eqtr4i 2771 | . . 3 ⊢ ! = ({〈0, 1〉} ∪ (seq1( · , I ) ↾ (ℕ0 ∖ {0}))) |
17 | id 22 | . . 3 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → 𝑁 ∈ (ℕ0 ∖ {0})) | |
18 | 2, 4, 16, 17 | fvsnun2 7217 | . 2 ⊢ (𝑁 ∈ (ℕ0 ∖ {0}) → (!‘𝑁) = (seq1( · , I )‘𝑁)) |
19 | 18, 7 | eleq2s 2862 | 1 ⊢ (𝑁 ∈ ℕ → (!‘𝑁) = (seq1( · , I )‘𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2108 Vcvv 3488 ∖ cdif 3973 ∪ cun 3974 {csn 4648 〈cop 4654 I cid 5592 ↾ cres 5702 Fn wfn 6568 ‘cfv 6573 0cc0 11184 1c1 11185 · cmul 11189 ℕcn 12293 ℕ0cn0 12553 ℤcz 12639 ℤ≥cuz 12903 seqcseq 14052 !cfa 14322 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-n0 12554 df-z 12640 df-uz 12904 df-seq 14053 df-fac 14323 |
This theorem is referenced by: fac1 14326 facp1 14327 bcval5 14367 fprodfac 16021 logfac 26661 wilthlem3 27131 |
Copyright terms: Public domain | W3C validator |