fac0 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > fac0		Structured version Visualization version GIF version

Theorem fac0 13632

Description: The factorial of 0. (Contributed by NM, 2-Dec-2004.) (Revised by Mario Carneiro, 13-Jul-2013.)

**Assertion**
Ref	Expression
fac0	⊢ (!‘0) = 1

**Proof of Theorem fac0**
Step	Hyp	Ref	Expression
1		c0ex 10624	. . . 4 ⊢ 0 ∈ V
2	1	a1i 11	. . 3 ⊢ (⊤ → 0 ∈ V)
3		1ex 10626	. . . 4 ⊢ 1 ∈ V
4	3	a1i 11	. . 3 ⊢ (⊤ → 1 ∈ V)
5		df-fac 13630	. . . 4 ⊢ ! = ({⟨0, 1⟩} ∪ seq1( · , I ))
6		nnuz 12269	. . . . . . . 8 ⊢ ℕ = (ℤ_≥‘1)
7		dfn2 11898	. . . . . . . 8 ⊢ ℕ = (ℕ₀ ∖ {0})
8	6, 7	eqtr3i 2823	. . . . . . 7 ⊢ (ℤ_≥‘1) = (ℕ₀ ∖ {0})
9	8	reseq2i 5815	. . . . . 6 ⊢ (seq1( · , I ) ↾ (ℤ_≥‘1)) = (seq1( · , I ) ↾ (ℕ₀ ∖ {0}))
10		1z 12000	. . . . . . 7 ⊢ 1 ∈ ℤ
11		seqfn 13376	. . . . . . 7 ⊢ (1 ∈ ℤ → seq1( · , I ) Fn (ℤ_≥‘1))
12		fnresdm 6438	. . . . . . 7 ⊢ (seq1( · , I ) Fn (ℤ_≥‘1) → (seq1( · , I ) ↾ (ℤ_≥‘1)) = seq1( · , I ))
13	10, 11, 12	mp2b 10	. . . . . 6 ⊢ (seq1( · , I ) ↾ (ℤ_≥‘1)) = seq1( · , I )
14	9, 13	eqtr3i 2823	. . . . 5 ⊢ (seq1( · , I ) ↾ (ℕ₀ ∖ {0})) = seq1( · , I )
15	14	uneq2i 4087	. . . 4 ⊢ ({⟨0, 1⟩} ∪ (seq1( · , I ) ↾ (ℕ₀ ∖ {0}))) = ({⟨0, 1⟩} ∪ seq1( · , I ))
16	5, 15	eqtr4i 2824	. . 3 ⊢ ! = ({⟨0, 1⟩} ∪ (seq1( · , I ) ↾ (ℕ₀ ∖ {0})))
17	2, 4, 16	fvsnun1 6921	. 2 ⊢ (⊤ → (!‘0) = 1)
18	17	mptru 1545	1 ⊢ (!‘0) = 1

Colors of variables: wff setvar class

Syntax hints: = wceq 1538 ⊤wtru 1539 ∈ wcel 2111 Vcvv 3441 ∖ cdif 3878 ∪ cun 3879 {csn 4525 ⟨cop 4531 I cid 5424 ↾ cres 5521 Fn wfn 6319 ‘cfv 6324 0cc0 10526 1c1 10527 · cmul 10531 ℕcn 11625 ℕ₀cn0 11885 ℤcz 11969 ℤ_≥cuz 12231 seqcseq 13364 !cfa 13629

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-seq 13365 df-fac 13630

This theorem is referenced by: facp1 13634 faccl 13639 facwordi 13645 faclbnd 13646 faclbnd4lem3 13651 facubnd 13656 bcn0 13666 bcval5 13674 hashf1 13811 fprodfac 15319 fallfacfac 15391 ef0lem 15424 ege2le3 15435 eft0val 15457 prmfac1 16053 pcfac 16225 tayl0 24957 logfac 25192 advlogexp 25246 facgam 25651 logexprlim 25809 subfacval2 32547 faclim 33091 bccn0 41047 mccl 42240 dvnxpaek 42584 dvnprodlem3 42590 etransclem14 42890 etransclem24 42900 etransclem25 42901 etransclem35 42911

W3C validator