| 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 12403 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 2 | peano2nn 12157 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
| 3 | facnn 14198 | . . . . 5 ⊢ ((𝑁 + 1) ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) | |
| 4 | 2, 3 | syl 17 | . . . 4 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) |
| 5 | ovex 7391 | . . . . . . 7 ⊢ (𝑁 + 1) ∈ V | |
| 6 | fvi 6910 | . . . . . . 7 ⊢ ((𝑁 + 1) ∈ V → ( I ‘(𝑁 + 1)) = (𝑁 + 1)) | |
| 7 | 5, 6 | ax-mp 5 | . . . . . 6 ⊢ ( I ‘(𝑁 + 1)) = (𝑁 + 1) |
| 8 | 7 | oveq2i 7369 | . . . . 5 ⊢ ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1))) = ((seq1( · , I )‘𝑁) · (𝑁 + 1)) |
| 9 | seqp1 13939 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘1) → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) | |
| 10 | nnuz 12790 | . . . . . 6 ⊢ ℕ = (ℤ≥‘1) | |
| 11 | 9, 10 | eleq2s 2854 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) |
| 12 | facnn 14198 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (!‘𝑁) = (seq1( · , I )‘𝑁)) | |
| 13 | 12 | oveq1d 7373 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((!‘𝑁) · (𝑁 + 1)) = ((seq1( · , I )‘𝑁) · (𝑁 + 1))) |
| 14 | 8, 11, 13 | 3eqtr4a 2797 | . . . 4 ⊢ (𝑁 ∈ ℕ → (seq1( · , I )‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 15 | 4, 14 | eqtrd 2771 | . . 3 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 16 | 0p1e1 12262 | . . . . . 6 ⊢ (0 + 1) = 1 | |
| 17 | 16 | fveq2i 6837 | . . . . 5 ⊢ (!‘(0 + 1)) = (!‘1) |
| 18 | fac1 14200 | . . . . 5 ⊢ (!‘1) = 1 | |
| 19 | 17, 18 | eqtri 2759 | . . . 4 ⊢ (!‘(0 + 1)) = 1 |
| 20 | fvoveq1 7381 | . . . 4 ⊢ (𝑁 = 0 → (!‘(𝑁 + 1)) = (!‘(0 + 1))) | |
| 21 | fveq2 6834 | . . . . . 6 ⊢ (𝑁 = 0 → (!‘𝑁) = (!‘0)) | |
| 22 | oveq1 7365 | . . . . . 6 ⊢ (𝑁 = 0 → (𝑁 + 1) = (0 + 1)) | |
| 23 | 21, 22 | oveq12d 7376 | . . . . 5 ⊢ (𝑁 = 0 → ((!‘𝑁) · (𝑁 + 1)) = ((!‘0) · (0 + 1))) |
| 24 | fac0 14199 | . . . . . . 7 ⊢ (!‘0) = 1 | |
| 25 | 24, 16 | oveq12i 7370 | . . . . . 6 ⊢ ((!‘0) · (0 + 1)) = (1 · 1) |
| 26 | 1t1e1 12302 | . . . . . 6 ⊢ (1 · 1) = 1 | |
| 27 | 25, 26 | eqtri 2759 | . . . . 5 ⊢ ((!‘0) · (0 + 1)) = 1 |
| 28 | 23, 27 | eqtrdi 2787 | . . . 4 ⊢ (𝑁 = 0 → ((!‘𝑁) · (𝑁 + 1)) = 1) |
| 29 | 19, 20, 28 | 3eqtr4a 2797 | . . 3 ⊢ (𝑁 = 0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 30 | 15, 29 | jaoi 857 | . 2 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 31 | 1, 30 | sylbi 217 | 1 ⊢ (𝑁 ∈ ℕ0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 847 = wceq 1541 ∈ wcel 2113 Vcvv 3440 I cid 5518 ‘cfv 6492 (class class class)co 7358 0cc0 11026 1c1 11027 + caddc 11029 · cmul 11031 ℕcn 12145 ℕ0cn0 12401 ℤ≥cuz 12751 seqcseq 13924 !cfa 14196 |
| 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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| 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 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-n0 12402 df-z 12489 df-uz 12752 df-seq 13925 df-fac 14197 |
| This theorem is referenced by: fac2 14202 fac3 14203 fac4 14204 facnn2 14205 faccl 14206 facdiv 14210 facwordi 14212 faclbnd 14213 faclbnd6 14222 facubnd 14223 bcm1k 14238 bcp1n 14239 4bc2eq6 14252 efcllem 16000 ef01bndlem 16109 eirrlem 16129 dvdsfac 16253 prmfac1 16647 pcfac 16827 2expltfac 17020 aaliou3lem2 26307 aaliou3lem8 26309 dvtaylp 26334 advlogexp 26620 facgam 27032 bcmono 27244 ex-fac 30526 subfacval2 35381 subfaclim 35382 faclim 35940 faclim2 35942 lcmineqlem18 42310 facp2 42407 bccp1k 44592 binomcxplemwb 44599 wallispi2lem2 46326 stirlinglem4 46331 etransclem24 46512 etransclem28 46516 etransclem38 46526 |
| Copyright terms: Public domain | W3C validator |