| 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 12430 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 2 | peano2nn 12177 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
| 3 | facnn 14228 | . . . . 5 ⊢ ((𝑁 + 1) ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) | |
| 4 | 2, 3 | syl 17 | . . . 4 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) |
| 5 | ovex 7389 | . . . . . . 7 ⊢ (𝑁 + 1) ∈ V | |
| 6 | fvi 6903 | . . . . . . 7 ⊢ ((𝑁 + 1) ∈ V → ( I ‘(𝑁 + 1)) = (𝑁 + 1)) | |
| 7 | 5, 6 | ax-mp 5 | . . . . . 6 ⊢ ( I ‘(𝑁 + 1)) = (𝑁 + 1) |
| 8 | 7 | oveq2i 7367 | . . . . 5 ⊢ ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1))) = ((seq1( · , I )‘𝑁) · (𝑁 + 1)) |
| 9 | seqp1 13969 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘1) → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) | |
| 10 | nnuz 12818 | . . . . . 6 ⊢ ℕ = (ℤ≥‘1) | |
| 11 | 9, 10 | eleq2s 2857 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) |
| 12 | facnn 14228 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (!‘𝑁) = (seq1( · , I )‘𝑁)) | |
| 13 | 12 | oveq1d 7371 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((!‘𝑁) · (𝑁 + 1)) = ((seq1( · , I )‘𝑁) · (𝑁 + 1))) |
| 14 | 8, 11, 13 | 3eqtr4a 2800 | . . . 4 ⊢ (𝑁 ∈ ℕ → (seq1( · , I )‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 15 | 4, 14 | eqtrd 2774 | . . 3 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 16 | 0p1e1 12289 | . . . . . 6 ⊢ (0 + 1) = 1 | |
| 17 | 16 | fveq2i 6830 | . . . . 5 ⊢ (!‘(0 + 1)) = (!‘1) |
| 18 | fac1 14230 | . . . . 5 ⊢ (!‘1) = 1 | |
| 19 | 17, 18 | eqtri 2762 | . . . 4 ⊢ (!‘(0 + 1)) = 1 |
| 20 | fvoveq1 7379 | . . . 4 ⊢ (𝑁 = 0 → (!‘(𝑁 + 1)) = (!‘(0 + 1))) | |
| 21 | fveq2 6827 | . . . . . 6 ⊢ (𝑁 = 0 → (!‘𝑁) = (!‘0)) | |
| 22 | oveq1 7363 | . . . . . 6 ⊢ (𝑁 = 0 → (𝑁 + 1) = (0 + 1)) | |
| 23 | 21, 22 | oveq12d 7374 | . . . . 5 ⊢ (𝑁 = 0 → ((!‘𝑁) · (𝑁 + 1)) = ((!‘0) · (0 + 1))) |
| 24 | fac0 14229 | . . . . . . 7 ⊢ (!‘0) = 1 | |
| 25 | 24, 16 | oveq12i 7368 | . . . . . 6 ⊢ ((!‘0) · (0 + 1)) = (1 · 1) |
| 26 | 1t1e1 12329 | . . . . . 6 ⊢ (1 · 1) = 1 | |
| 27 | 25, 26 | eqtri 2762 | . . . . 5 ⊢ ((!‘0) · (0 + 1)) = 1 |
| 28 | 23, 27 | eqtrdi 2790 | . . . 4 ⊢ (𝑁 = 0 → ((!‘𝑁) · (𝑁 + 1)) = 1) |
| 29 | 19, 20, 28 | 3eqtr4a 2800 | . . 3 ⊢ (𝑁 = 0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 30 | 15, 29 | jaoi 863 | . 2 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| 31 | 1, 30 | sylbi 218 | 1 ⊢ (𝑁 ∈ ℕ0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 853 = wceq 1547 ∈ wcel 2119 Vcvv 3431 I cid 5512 ‘cfv 6485 (class class class)co 7356 0cc0 11029 1c1 11030 + caddc 11032 · cmul 11034 ℕcn 12165 ℕ0cn0 12428 ℤ≥cuz 12779 seqcseq 13954 !cfa 14226 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-n0 12429 df-z 12516 df-uz 12780 df-seq 13955 df-fac 14227 |
| This theorem is referenced by: fac2 14232 fac3 14233 fac4 14234 facnn2 14235 faccl 14236 facdiv 14240 facwordi 14242 faclbnd 14243 faclbnd6 14252 facubnd 14253 bcm1k 14268 bcp1n 14269 4bc2eq6 14282 efcllem 16033 ef01bndlem 16142 eirrlem 16162 dvdsfac 16286 prmfac1 16681 pcfac 16861 2expltfac 17054 aaliou3lem2 26327 aaliou3lem8 26329 dvtaylp 26353 advlogexp 26637 facgam 27047 bcmono 27258 ex-fac 30539 subfacval2 35415 subfaclim 35416 faclim 35974 faclim2 35976 lcmineqlem18 42531 facp2 42628 bccp1k 44785 binomcxplemwb 44792 wallispi2lem2 46515 stirlinglem4 46520 etransclem24 46701 etransclem28 46705 etransclem38 46715 |
| Copyright terms: Public domain | W3C validator |