| 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 12439 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 2 | peano2nn 12186 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
| 3 | facnn 14237 | . . . . 5 ⊢ ((𝑁 + 1) ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) | |
| 4 | 2, 3 | syl 17 | . . . 4 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) |
| 5 | ovex 7400 | . . . . . . 7 ⊢ (𝑁 + 1) ∈ V | |
| 6 | fvi 6916 | . . . . . . 7 ⊢ ((𝑁 + 1) ∈ V → ( I ‘(𝑁 + 1)) = (𝑁 + 1)) | |
| 7 | 5, 6 | ax-mp 5 | . . . . . 6 ⊢ ( I ‘(𝑁 + 1)) = (𝑁 + 1) |
| 8 | 7 | oveq2i 7378 | . . . . 5 ⊢ ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1))) = ((seq1( · , I )‘𝑁) · (𝑁 + 1)) |
| 9 | seqp1 13978 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘1) → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) | |
| 10 | nnuz 12827 | . . . . . 6 ⊢ ℕ = (ℤ≥‘1) | |
| 11 | 9, 10 | eleq2s 2854 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) |
| 12 | facnn 14237 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (!‘𝑁) = (seq1( · , I )‘𝑁)) | |
| 13 | 12 | oveq1d 7382 | . . . . 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 12298 | . . . . . 6 ⊢ (0 + 1) = 1 | |
| 17 | 16 | fveq2i 6843 | . . . . 5 ⊢ (!‘(0 + 1)) = (!‘1) |
| 18 | fac1 14239 | . . . . 5 ⊢ (!‘1) = 1 | |
| 19 | 17, 18 | eqtri 2759 | . . . 4 ⊢ (!‘(0 + 1)) = 1 |
| 20 | fvoveq1 7390 | . . . 4 ⊢ (𝑁 = 0 → (!‘(𝑁 + 1)) = (!‘(0 + 1))) | |
| 21 | fveq2 6840 | . . . . . 6 ⊢ (𝑁 = 0 → (!‘𝑁) = (!‘0)) | |
| 22 | oveq1 7374 | . . . . . 6 ⊢ (𝑁 = 0 → (𝑁 + 1) = (0 + 1)) | |
| 23 | 21, 22 | oveq12d 7385 | . . . . 5 ⊢ (𝑁 = 0 → ((!‘𝑁) · (𝑁 + 1)) = ((!‘0) · (0 + 1))) |
| 24 | fac0 14238 | . . . . . . 7 ⊢ (!‘0) = 1 | |
| 25 | 24, 16 | oveq12i 7379 | . . . . . 6 ⊢ ((!‘0) · (0 + 1)) = (1 · 1) |
| 26 | 1t1e1 12338 | . . . . . 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 858 | . 2 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 31 | 1, 30 | sylbi 217 | 1 ⊢ (𝑁 ∈ ℕ0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 848 = wceq 1542 ∈ wcel 2114 Vcvv 3429 I cid 5525 ‘cfv 6498 (class class class)co 7367 0cc0 11038 1c1 11039 + caddc 11041 · cmul 11043 ℕcn 12174 ℕ0cn0 12437 ℤ≥cuz 12788 seqcseq 13963 !cfa 14235 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-n0 12438 df-z 12525 df-uz 12789 df-seq 13964 df-fac 14236 |
| This theorem is referenced by: fac2 14241 fac3 14242 fac4 14243 facnn2 14244 faccl 14245 facdiv 14249 facwordi 14251 faclbnd 14252 faclbnd6 14261 facubnd 14262 bcm1k 14277 bcp1n 14278 4bc2eq6 14291 efcllem 16042 ef01bndlem 16151 eirrlem 16171 dvdsfac 16295 prmfac1 16690 pcfac 16870 2expltfac 17063 aaliou3lem2 26309 aaliou3lem8 26311 dvtaylp 26335 advlogexp 26619 facgam 27029 bcmono 27240 ex-fac 30521 subfacval2 35369 subfaclim 35370 faclim 35928 faclim2 35930 lcmineqlem18 42485 facp2 42582 bccp1k 44768 binomcxplemwb 44775 wallispi2lem2 46500 stirlinglem4 46505 etransclem24 46686 etransclem28 46690 etransclem38 46700 |
| Copyright terms: Public domain | W3C validator |