| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0fallfac | Structured version Visualization version GIF version | ||
| Description: The value of the zero falling factorial at natural 𝑁. (Contributed by Scott Fenton, 17-Feb-2018.) |
| Ref | Expression |
|---|---|
| 0fallfac | ⊢ (𝑁 ∈ ℕ → (0 FallFac 𝑁) = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0cn 11226 | . . 3 ⊢ 0 ∈ ℂ | |
| 2 | nnnn0 12539 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
| 3 | fallfacval 16102 | . . 3 ⊢ ((0 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (0 FallFac 𝑁) = ∏𝑘 ∈ (0...(𝑁 − 1))(0 − 𝑘)) | |
| 4 | 1, 2, 3 | sylancr 599 | . 2 ⊢ (𝑁 ∈ ℕ → (0 FallFac 𝑁) = ∏𝑘 ∈ (0...(𝑁 − 1))(0 − 𝑘)) |
| 5 | nnm1nn0 12573 | . . . 4 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ0) | |
| 6 | nn0uz 12929 | . . . 4 ⊢ ℕ0 = (ℤ≥‘0) | |
| 7 | 5, 6 | eleqtrdi 2872 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ (ℤ≥‘0)) |
| 8 | elfzelz 13582 | . . . . . 6 ⊢ (𝑘 ∈ (0...(𝑁 − 1)) → 𝑘 ∈ ℤ) | |
| 9 | 8 | zcnd 12730 | . . . . 5 ⊢ (𝑘 ∈ (0...(𝑁 − 1)) → 𝑘 ∈ ℂ) |
| 10 | subcl 11484 | . . . . 5 ⊢ ((0 ∈ ℂ ∧ 𝑘 ∈ ℂ) → (0 − 𝑘) ∈ ℂ) | |
| 11 | 1, 9, 10 | sylancr 599 | . . . 4 ⊢ (𝑘 ∈ (0...(𝑁 − 1)) → (0 − 𝑘) ∈ ℂ) |
| 12 | 11 | adantl 487 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑘 ∈ (0...(𝑁 − 1))) → (0 − 𝑘) ∈ ℂ) |
| 13 | oveq2 7425 | . . . 4 ⊢ (𝑘 = 0 → (0 − 𝑘) = (0 − 0)) | |
| 14 | 0m0e0 12387 | . . . 4 ⊢ (0 − 0) = 0 | |
| 15 | 13, 14 | eqtrdi 2813 | . . 3 ⊢ (𝑘 = 0 → (0 − 𝑘) = 0) |
| 16 | 7, 12, 15 | fprod1p 16061 | . 2 ⊢ (𝑁 ∈ ℕ → ∏𝑘 ∈ (0...(𝑁 − 1))(0 − 𝑘) = (0 · ∏𝑘 ∈ ((0 + 1)...(𝑁 − 1))(0 − 𝑘))) |
| 17 | fzfid 14041 | . . . 4 ⊢ (𝑁 ∈ ℕ → ((0 + 1)...(𝑁 − 1)) ∈ Fin) | |
| 18 | elfzelz 13582 | . . . . . . 7 ⊢ (𝑘 ∈ ((0 + 1)...(𝑁 − 1)) → 𝑘 ∈ ℤ) | |
| 19 | 18 | zcnd 12730 | . . . . . 6 ⊢ (𝑘 ∈ ((0 + 1)...(𝑁 − 1)) → 𝑘 ∈ ℂ) |
| 20 | 1, 19, 10 | sylancr 599 | . . . . 5 ⊢ (𝑘 ∈ ((0 + 1)...(𝑁 − 1)) → (0 − 𝑘) ∈ ℂ) |
| 21 | 20 | adantl 487 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝑘 ∈ ((0 + 1)...(𝑁 − 1))) → (0 − 𝑘) ∈ ℂ) |
| 22 | 17, 21 | fprodcl 16045 | . . 3 ⊢ (𝑁 ∈ ℕ → ∏𝑘 ∈ ((0 + 1)...(𝑁 − 1))(0 − 𝑘) ∈ ℂ) |
| 23 | 22 | mul02d 11436 | . 2 ⊢ (𝑁 ∈ ℕ → (0 · ∏𝑘 ∈ ((0 + 1)...(𝑁 − 1))(0 − 𝑘)) = 0) |
| 24 | 4, 16, 23 | 3eqtrd 2801 | 1 ⊢ (𝑁 ∈ ℕ → (0 FallFac 𝑁) = 0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ‘cfv 6537 (class class class)co 7417 ℂcc 11126 0cc0 11128 1c1 11129 + caddc 11131 · cmul 11133 − cmin 11469 ℕcn 12261 ℕ0cn0 12532 ℤ≥cuz 12891 ...cfz 13565 ∏cprod 15996 FallFac cfallfac 16097 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-inf2 9624 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 ax-pre-sup 11206 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-sup 9416 df-oi 9486 df-card 9948 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-div 11900 df-nn 12262 df-2 12331 df-3 12332 df-n0 12533 df-z 12620 df-uz 12892 df-rp 13047 df-fz 13566 df-fzo 13714 df-seq 14070 df-exp 14130 df-hash 14399 df-cj 15190 df-re 15191 df-im 15192 df-sqrt 15326 df-abs 15327 df-clim 15579 df-prod 15997 df-fallfac 16100 |
| This theorem is used by: 0risefac 16130 |
| Copyright terms: Public domain | W3C validator |