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 11171 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
2 | peano2nn 10909 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
3 | facnn 12924 | . . . . 5 ⊢ ((𝑁 + 1) ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) | |
4 | 2, 3 | syl 17 | . . . 4 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 + 1)) = (seq1( · , I )‘(𝑁 + 1))) |
5 | ovex 6577 | . . . . . . 7 ⊢ (𝑁 + 1) ∈ V | |
6 | fvi 6165 | . . . . . . 7 ⊢ ((𝑁 + 1) ∈ V → ( I ‘(𝑁 + 1)) = (𝑁 + 1)) | |
7 | 5, 6 | ax-mp 5 | . . . . . 6 ⊢ ( I ‘(𝑁 + 1)) = (𝑁 + 1) |
8 | 7 | oveq2i 6560 | . . . . 5 ⊢ ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1))) = ((seq1( · , I )‘𝑁) · (𝑁 + 1)) |
9 | seqp1 12678 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘1) → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) | |
10 | nnuz 11599 | . . . . . 6 ⊢ ℕ = (ℤ≥‘1) | |
11 | 9, 10 | eleq2s 2706 | . . . . 5 ⊢ (𝑁 ∈ ℕ → (seq1( · , I )‘(𝑁 + 1)) = ((seq1( · , I )‘𝑁) · ( I ‘(𝑁 + 1)))) |
12 | facnn 12924 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (!‘𝑁) = (seq1( · , I )‘𝑁)) | |
13 | 12 | oveq1d 6564 | . . . . 5 ⊢ (𝑁 ∈ ℕ → ((!‘𝑁) · (𝑁 + 1)) = ((seq1( · , I )‘𝑁) · (𝑁 + 1))) |
14 | 8, 11, 13 | 3eqtr4a 2670 | . . . 4 ⊢ (𝑁 ∈ ℕ → (seq1( · , I )‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
15 | 4, 14 | eqtrd 2644 | . . 3 ⊢ (𝑁 ∈ ℕ → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
16 | 0p1e1 11009 | . . . . . 6 ⊢ (0 + 1) = 1 | |
17 | 16 | fveq2i 6106 | . . . . 5 ⊢ (!‘(0 + 1)) = (!‘1) |
18 | fac1 12926 | . . . . 5 ⊢ (!‘1) = 1 | |
19 | 17, 18 | eqtri 2632 | . . . 4 ⊢ (!‘(0 + 1)) = 1 |
20 | oveq1 6556 | . . . . 5 ⊢ (𝑁 = 0 → (𝑁 + 1) = (0 + 1)) | |
21 | 20 | fveq2d 6107 | . . . 4 ⊢ (𝑁 = 0 → (!‘(𝑁 + 1)) = (!‘(0 + 1))) |
22 | fveq2 6103 | . . . . . 6 ⊢ (𝑁 = 0 → (!‘𝑁) = (!‘0)) | |
23 | 22, 20 | oveq12d 6567 | . . . . 5 ⊢ (𝑁 = 0 → ((!‘𝑁) · (𝑁 + 1)) = ((!‘0) · (0 + 1))) |
24 | fac0 12925 | . . . . . . 7 ⊢ (!‘0) = 1 | |
25 | 24, 16 | oveq12i 6561 | . . . . . 6 ⊢ ((!‘0) · (0 + 1)) = (1 · 1) |
26 | 1t1e1 11052 | . . . . . 6 ⊢ (1 · 1) = 1 | |
27 | 25, 26 | eqtri 2632 | . . . . 5 ⊢ ((!‘0) · (0 + 1)) = 1 |
28 | 23, 27 | syl6eq 2660 | . . . 4 ⊢ (𝑁 = 0 → ((!‘𝑁) · (𝑁 + 1)) = 1) |
29 | 19, 21, 28 | 3eqtr4a 2670 | . . 3 ⊢ (𝑁 = 0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
30 | 15, 29 | jaoi 393 | . 2 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
31 | 1, 30 | sylbi 206 | 1 ⊢ (𝑁 ∈ ℕ0 → (!‘(𝑁 + 1)) = ((!‘𝑁) · (𝑁 + 1))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 382 = wceq 1475 ∈ wcel 1977 Vcvv 3173 I cid 4948 ‘cfv 5804 (class class class)co 6549 0cc0 9815 1c1 9816 + caddc 9818 · cmul 9820 ℕcn 10897 ℕ0cn0 11169 ℤ≥cuz 11563 seqcseq 12663 !cfa 12922 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-seq 12664 df-fac 12923 |
This theorem is referenced by: fac2 12928 fac3 12929 fac4 12930 facnn2 12931 faccl 12932 facdiv 12936 facwordi 12938 faclbnd 12939 faclbnd6 12948 facubnd 12949 bcm1k 12964 bcp1n 12965 4bc2eq6 12978 efcllem 14647 ef01bndlem 14753 eirrlem 14771 dvdsfac 14886 prmfac1 15269 pcfac 15441 2expltfac 15637 aaliou3lem2 23902 aaliou3lem8 23904 dvtaylp 23928 advlogexp 24201 facgam 24592 bcmono 24802 ex-fac 26700 subfacval2 30423 subfaclim 30424 faclim 30885 faclim2 30887 bccp1k 37562 binomcxplemwb 37569 wallispi2lem2 38965 stirlinglem4 38970 etransclem24 39151 etransclem28 39155 etransclem38 39165 |
Copyright terms: Public domain | W3C validator |