| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fac0 | GIF version | ||
| Description: The factorial of 0. (Contributed by NM, 2-Dec-2004.) (Revised by Mario Carneiro, 13-Jul-2013.) |
| Ref | Expression |
|---|---|
| fac0 | ⊢ (!‘0) = 1 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | c0ex 8310 | . 2 ⊢ 0 ∈ V | |
| 2 | 1ex 8311 | . 2 ⊢ 1 ∈ V | |
| 3 | df-fac 11142 | . . 3 ⊢ ! = ({〈0, 1〉} ∪ seq1( · , I )) | |
| 4 | nnuz 9937 | . . . . . . 7 ⊢ ℕ = (ℤ≥‘1) | |
| 5 | dfn2 9555 | . . . . . . 7 ⊢ ℕ = (ℕ0 ∖ {0}) | |
| 6 | 4, 5 | eqtr3i 2261 | . . . . . 6 ⊢ (ℤ≥‘1) = (ℕ0 ∖ {0}) |
| 7 | 6 | reseq2i 5055 | . . . . 5 ⊢ (seq1( · , I ) ↾ (ℤ≥‘1)) = (seq1( · , I ) ↾ (ℕ0 ∖ {0})) |
| 8 | eqid 2238 | . . . . . . . . 9 ⊢ (ℤ≥‘1) = (ℤ≥‘1) | |
| 9 | 1zzd 9650 | . . . . . . . . 9 ⊢ (⊤ → 1 ∈ ℤ) | |
| 10 | fvi 5754 | . . . . . . . . . . . . 13 ⊢ (𝑓 ∈ (ℤ≥‘1) → ( I ‘𝑓) = 𝑓) | |
| 11 | 10 | eleq1d 2307 | . . . . . . . . . . . 12 ⊢ (𝑓 ∈ (ℤ≥‘1) → (( I ‘𝑓) ∈ (ℤ≥‘1) ↔ 𝑓 ∈ (ℤ≥‘1))) |
| 12 | 11 | ibir 177 | . . . . . . . . . . 11 ⊢ (𝑓 ∈ (ℤ≥‘1) → ( I ‘𝑓) ∈ (ℤ≥‘1)) |
| 13 | eluzelcn 9912 | . . . . . . . . . . 11 ⊢ (( I ‘𝑓) ∈ (ℤ≥‘1) → ( I ‘𝑓) ∈ ℂ) | |
| 14 | 12, 13 | syl 14 | . . . . . . . . . 10 ⊢ (𝑓 ∈ (ℤ≥‘1) → ( I ‘𝑓) ∈ ℂ) |
| 15 | 14 | adantl 277 | . . . . . . . . 9 ⊢ ((⊤ ∧ 𝑓 ∈ (ℤ≥‘1)) → ( I ‘𝑓) ∈ ℂ) |
| 16 | mulcl 8296 | . . . . . . . . . 10 ⊢ ((𝑓 ∈ ℂ ∧ 𝑔 ∈ ℂ) → (𝑓 · 𝑔) ∈ ℂ) | |
| 17 | 16 | adantl 277 | . . . . . . . . 9 ⊢ ((⊤ ∧ (𝑓 ∈ ℂ ∧ 𝑔 ∈ ℂ)) → (𝑓 · 𝑔) ∈ ℂ) |
| 18 | 8, 9, 15, 17 | seqf 10879 | . . . . . . . 8 ⊢ (⊤ → seq1( · , I ):(ℤ≥‘1)⟶ℂ) |
| 19 | 18 | ffnd 5529 | . . . . . . 7 ⊢ (⊤ → seq1( · , I ) Fn (ℤ≥‘1)) |
| 20 | 19 | mptru 1411 | . . . . . 6 ⊢ seq1( · , I ) Fn (ℤ≥‘1) |
| 21 | fnresdm 5487 | . . . . . 6 ⊢ (seq1( · , I ) Fn (ℤ≥‘1) → (seq1( · , I ) ↾ (ℤ≥‘1)) = seq1( · , I )) | |
| 22 | 20, 21 | ax-mp 5 | . . . . 5 ⊢ (seq1( · , I ) ↾ (ℤ≥‘1)) = seq1( · , I ) |
| 23 | 7, 22 | eqtr3i 2261 | . . . 4 ⊢ (seq1( · , I ) ↾ (ℕ0 ∖ {0})) = seq1( · , I ) |
| 24 | 23 | uneq2i 3380 | . . 3 ⊢ ({〈0, 1〉} ∪ (seq1( · , I ) ↾ (ℕ0 ∖ {0}))) = ({〈0, 1〉} ∪ seq1( · , I )) |
| 25 | 3, 24 | eqtr4i 2262 | . 2 ⊢ ! = ({〈0, 1〉} ∪ (seq1( · , I ) ↾ (ℕ0 ∖ {0}))) |
| 26 | 1, 2, 25 | fvsnun1 5903 | 1 ⊢ (!‘0) = 1 |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 = wceq 1402 ⊤wtru 1403 ∈ wcel 2209 ∖ cdif 3217 ∪ cun 3218 {csn 3705 〈cop 3708 I cid 4428 ↾ cres 4771 Fn wfn 5367 ‘cfv 5372 (class class class)co 6075 ℂcc 8167 0cc0 8169 1c1 8170 · cmul 8174 ℕcn 9283 ℕ0cn0 9542 ℤ≥cuz 9900 seqcseq 10862 !cfa 11141 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-addcom 8269 ax-addass 8271 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-0id 8277 ax-rnegex 8278 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-ltadd 8285 |
| This theorem depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-iord 4506 df-on 4508 df-ilim 4509 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-frec 6652 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-inn 9284 df-n0 9543 df-z 9624 df-uz 9901 df-seqfrec 10863 df-fac 11142 |
| This theorem is referenced by: facp1 11146 faccl 11151 facwordi 11156 faclbnd 11157 facubnd 11161 bcn0 11171 bcval5 11179 hashf1 11265 fprodfac 12360 ef0lem 12405 ege2le3 12416 eft0val 12438 prmfac1 12908 pcfac 13107 logfac 15918 |
| Copyright terms: Public domain | W3C validator |