| 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 12524 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 2 | peano2nn 12263 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
| 3 | facnn 14331 | . . . . 5 ⊢ ((𝑁 + 1) ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) | |
| 4 | 2, 3 | syl 18 | . . . 4 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) |
| 5 | ovex 7456 | . . . . . . 7 ⊢ (𝑁 + 1) ∈ V | |
| 6 | fvi 6964 | . . . . . . 7 ⊢ ((𝑁 + 1) ∈ V → ( I ‘(𝑁 + 1)) = (𝑁 + 1)) | |
| 7 | 5, 6 | ax-mp 5 | . . . . . 6 ⊢ ( I ‘(𝑁 + 1)) = (𝑁 + 1) |
| 8 | 7 | oveq2i 7434 | . . . . 5 ⊢ ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1))) = ((seq1( · , I )‘𝑁) · (𝑁 + 1)) |
| 9 | seqp1 14072 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘1) → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) | |
| 10 | nnuz 12919 | . . . . . 6 ⊢ ℕ = (ℤ≥‘1) | |
| 11 | 9, 10 | eleq2s 2884 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) |
| 12 | facnn 14331 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (!‘𝑁) = (seq1( · , I )‘𝑁)) | |
| 13 | 12 | oveq1d 7438 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((!‘𝑁) · (𝑁 + 1)) = ((seq1( · , I )‘𝑁) · (𝑁 + 1))) |
| 14 | 8, 11, 13 | 3eqtr4a 2827 | . . . 4 ⊢ (𝑁 ∈ ℕ → (seq1( · , I )‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 15 | 4, 14 | eqtrd 2801 | . . 3 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 16 | 0p1e1 12379 | . . . . . 6 ⊢ (0 + 1) = 1 | |
| 17 | 16 | fveq2i 6891 | . . . . 5 ⊢ (!‘(0 + 1)) = (!‘1) |
| 18 | fac1 14333 | . . . . 5 ⊢ (!‘1) = 1 | |
| 19 | 17, 18 | eqtri 2789 | . . . 4 ⊢ (!‘(0 + 1)) = 1 |
| 20 | fvoveq1 7446 | . . . 4 ⊢ (𝑁 = 0 → (!‘(𝑁 + 1)) = (!‘(0 + 1))) | |
| 21 | fveq2 6888 | . . . . . 6 ⊢ (𝑁 = 0 → (!‘𝑁) = (!‘0)) | |
| 22 | oveq1 7430 | . . . . . 6 ⊢ (𝑁 = 0 → (𝑁 + 1) = (0 + 1)) | |
| 23 | 21, 22 | oveq12d 7441 | . . . . 5 ⊢ (𝑁 = 0 → ((!‘𝑁) · (𝑁 + 1)) = ((!‘0) · (0 + 1))) |
| 24 | fac0 14332 | . . . . . . 7 ⊢ (!‘0) = 1 | |
| 25 | 24, 16 | oveq12i 7435 | . . . . . 6 ⊢ ((!‘0) · (0 + 1)) = (1 · 1) |
| 26 | 1t1e1 12420 | . . . . . 6 ⊢ (1 · 1) = 1 | |
| 27 | 25, 26 | eqtri 2789 | . . . . 5 ⊢ ((!‘0) · (0 + 1)) = 1 |
| 28 | 23, 27 | eqtrdi 2817 | . . . 4 ⊢ (𝑁 = 0 → ((!‘𝑁) · (𝑁 + 1)) = 1) |
| 29 | 19, 20, 28 | 3eqtr4a 2827 | . . 3 ⊢ (𝑁 = 0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 30 | 15, 29 | jaoi 871 | . 2 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 31 | 1, 30 | sylbi 220 | 1 ⊢ (𝑁 ∈ ℕ0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 861 = wceq 1570 ∈ wcel 2146 Vcvv 3458 I cid 5560 ‘cfv 6543 (class class class)co 7423 0cc0 11118 1c1 11119 + caddc 11121 · cmul 11123 ℕcn 12251 ℕ0cn0 12522 ℤ≥cuz 12880 seqcseq 14057 !cfa 14329 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-nn 12252 df-n0 12523 df-z 12610 df-uz 12881 df-seq 14058 df-fac 14330 |
| This theorem is used by: fac2 14335 fac3 14336 fac4 14337 facnn2 14338 faccl 14339 facdiv 14343 facwordi 14345 faclbnd 14346 faclbnd6 14355 facubnd 14356 bcm1k 14371 bcp1n 14372 4bc2eq6 14385 efcllem 16156 ef01bndlem 16265 eirrlem 16285 dvdsfac 16409 prmfac1 16804 pcfac 16984 2expltfac 17177 aaliou3lem2 26536 aaliou3lem8 26538 dvtaylp 26563 advlogexp 26850 facgam 27260 bcmono 27471 ex-fac 30832 subfacval2 35692 subfaclim 35693 faclim 36251 faclim2 36253 lcmineqlem18 42846 facp2 42943 bccp1k 45084 binomcxplemwb 45091 wallispi2lem2 46819 stirlinglem4 46824 etransclem24 47005 etransclem28 47009 etransclem38 47019 |
| Copyright terms: Public domain | W3C validator |