| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > facp1 | Structured version Visualization version GIF version | ||
| Description: The factorial of a successor. (Contributed by NM, 2-Dec-2004.) (Revised by Mario Carneiro, 13-Jul-2013.) |
| Ref | Expression |
|---|---|
| facp1 | ⊢ (𝑁 ∈ ℕ0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elnn0 12501 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 2 | peano2nn 12240 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
| 3 | facnn 14307 | . . . . 5 ⊢ ((𝑁 + 1) ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) | |
| 4 | 2, 3 | syl 18 | . . . 4 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) |
| 5 | ovex 7443 | . . . . . . 7 ⊢ (𝑁 + 1) ∈ V | |
| 6 | fvi 6957 | . . . . . . 7 ⊢ ((𝑁 + 1) ∈ V → ( I ‘(𝑁 + 1)) = (𝑁 + 1)) | |
| 7 | 5, 6 | ax-mp 5 | . . . . . 6 ⊢ ( I ‘(𝑁 + 1)) = (𝑁 + 1) |
| 8 | 7 | oveq2i 7421 | . . . . 5 ⊢ ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1))) = ((seq1( · , I )‘𝑁) · (𝑁 + 1)) |
| 9 | seqp1 14048 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘1) → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) | |
| 10 | nnuz 12896 | . . . . . 6 ⊢ ℕ = (ℤ≥‘1) | |
| 11 | 9, 10 | eleq2s 2881 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) |
| 12 | facnn 14307 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (!‘𝑁) = (seq1( · , I )‘𝑁)) | |
| 13 | 12 | oveq1d 7425 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((!‘𝑁) · (𝑁 + 1)) = ((seq1( · , I )‘𝑁) · (𝑁 + 1))) |
| 14 | 8, 11, 13 | 3eqtr4a 2824 | . . . 4 ⊢ (𝑁 ∈ ℕ → (seq1( · , I )‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 15 | 4, 14 | eqtrd 2798 | . . 3 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 16 | 0p1e1 12356 | . . . . . 6 ⊢ (0 + 1) = 1 | |
| 17 | 16 | fveq2i 6884 | . . . . 5 ⊢ (!‘(0 + 1)) = (!‘1) |
| 18 | fac1 14309 | . . . . 5 ⊢ (!‘1) = 1 | |
| 19 | 17, 18 | eqtri 2786 | . . . 4 ⊢ (!‘(0 + 1)) = 1 |
| 20 | fvoveq1 7433 | . . . 4 ⊢ (𝑁 = 0 → (!‘(𝑁 + 1)) = (!‘(0 + 1))) | |
| 21 | fveq2 6881 | . . . . . 6 ⊢ (𝑁 = 0 → (!‘𝑁) = (!‘0)) | |
| 22 | oveq1 7417 | . . . . . 6 ⊢ (𝑁 = 0 → (𝑁 + 1) = (0 + 1)) | |
| 23 | 21, 22 | oveq12d 7428 | . . . . 5 ⊢ (𝑁 = 0 → ((!‘𝑁) · (𝑁 + 1)) = ((!‘0) · (0 + 1))) |
| 24 | fac0 14308 | . . . . . . 7 ⊢ (!‘0) = 1 | |
| 25 | 24, 16 | oveq12i 7422 | . . . . . 6 ⊢ ((!‘0) · (0 + 1)) = (1 · 1) |
| 26 | 1t1e1 12397 | . . . . . 6 ⊢ (1 · 1) = 1 | |
| 27 | 25, 26 | eqtri 2786 | . . . . 5 ⊢ ((!‘0) · (0 + 1)) = 1 |
| 28 | 23, 27 | eqtrdi 2814 | . . . 4 ⊢ (𝑁 = 0 → ((!‘𝑁) · (𝑁 + 1)) = 1) |
| 29 | 19, 20, 28 | 3eqtr4a 2824 | . . 3 ⊢ (𝑁 = 0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 30 | 15, 29 | jaoi 870 | . 2 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 31 | 1, 30 | sylbi 220 | 1 ⊢ (𝑁 ∈ ℕ0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 860 = wceq 1570 ∈ wcel 2143 Vcvv 3455 I cid 5555 ‘cfv 6536 (class class class)co 7410 0cc0 11095 1c1 11096 + caddc 11098 · cmul 11100 ℕcn 12228 ℕ0cn0 12499 ℤ≥cuz 12857 seqcseq 14033 !cfa 14305 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 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 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-n0 12500 df-z 12587 df-uz 12858 df-seq 14034 df-fac 14306 |
| This theorem is referenced by: fac2 14311 fac3 14312 fac4 14313 facnn2 14314 faccl 14315 facdiv 14319 facwordi 14321 faclbnd 14322 faclbnd6 14331 facubnd 14332 bcm1k 14347 bcp1n 14348 4bc2eq6 14361 efcllem 16126 ef01bndlem 16235 eirrlem 16255 dvdsfac 16379 prmfac1 16774 pcfac 16954 2expltfac 17147 aaliou3lem2 26506 aaliou3lem8 26508 dvtaylp 26533 advlogexp 26820 facgam 27230 bcmono 27441 ex-fac 30802 subfacval2 35679 subfaclim 35680 faclim 36238 faclim2 36240 lcmineqlem18 42833 facp2 42930 bccp1k 45071 binomcxplemwb 45078 wallispi2lem2 46806 stirlinglem4 46811 etransclem24 46992 etransclem28 46996 etransclem38 47006 |
| Copyright terms: Public domain | W3C validator |