Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fallrisefac | Structured version Visualization version GIF version |
Description: A relationship between falling and rising factorials. (Contributed by Scott Fenton, 17-Jan-2018.) |
Ref | Expression |
---|---|
fallrisefac | ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) = ((-1↑𝑁) · (-𝑋 RiseFac 𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0cn 12243 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
2 | 1 | 2timesd 12216 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (2 · 𝑁) = (𝑁 + 𝑁)) |
3 | 2 | oveq2d 7291 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (-1↑(2 · 𝑁)) = (-1↑(𝑁 + 𝑁))) |
4 | nn0z 12343 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
5 | m1expeven 13830 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → (-1↑(2 · 𝑁)) = 1) | |
6 | 4, 5 | syl 17 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (-1↑(2 · 𝑁)) = 1) |
7 | neg1cn 12087 | . . . . . . . 8 ⊢ -1 ∈ ℂ | |
8 | expadd 13825 | . . . . . . . 8 ⊢ ((-1 ∈ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (-1↑(𝑁 + 𝑁)) = ((-1↑𝑁) · (-1↑𝑁))) | |
9 | 7, 8 | mp3an1 1447 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (-1↑(𝑁 + 𝑁)) = ((-1↑𝑁) · (-1↑𝑁))) |
10 | 9 | anidms 567 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (-1↑(𝑁 + 𝑁)) = ((-1↑𝑁) · (-1↑𝑁))) |
11 | 3, 6, 10 | 3eqtr3rd 2787 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → ((-1↑𝑁) · (-1↑𝑁)) = 1) |
12 | 11 | adantl 482 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((-1↑𝑁) · (-1↑𝑁)) = 1) |
13 | negneg 11271 | . . . . . 6 ⊢ (𝑋 ∈ ℂ → --𝑋 = 𝑋) | |
14 | 13 | adantr 481 | . . . . 5 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → --𝑋 = 𝑋) |
15 | 14 | oveq1d 7290 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (--𝑋 FallFac 𝑁) = (𝑋 FallFac 𝑁)) |
16 | 12, 15 | oveq12d 7293 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (((-1↑𝑁) · (-1↑𝑁)) · (--𝑋 FallFac 𝑁)) = (1 · (𝑋 FallFac 𝑁))) |
17 | expcl 13800 | . . . . . 6 ⊢ ((-1 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (-1↑𝑁) ∈ ℂ) | |
18 | 7, 17 | mpan 687 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (-1↑𝑁) ∈ ℂ) |
19 | 18 | adantl 482 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (-1↑𝑁) ∈ ℂ) |
20 | negcl 11221 | . . . . . 6 ⊢ (𝑋 ∈ ℂ → -𝑋 ∈ ℂ) | |
21 | 20 | negcld 11319 | . . . . 5 ⊢ (𝑋 ∈ ℂ → --𝑋 ∈ ℂ) |
22 | fallfaccl 15726 | . . . . 5 ⊢ ((--𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (--𝑋 FallFac 𝑁) ∈ ℂ) | |
23 | 21, 22 | sylan 580 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (--𝑋 FallFac 𝑁) ∈ ℂ) |
24 | 19, 19, 23 | mulassd 10998 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (((-1↑𝑁) · (-1↑𝑁)) · (--𝑋 FallFac 𝑁)) = ((-1↑𝑁) · ((-1↑𝑁) · (--𝑋 FallFac 𝑁)))) |
25 | fallfaccl 15726 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) ∈ ℂ) | |
26 | 25 | mulid2d 10993 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (1 · (𝑋 FallFac 𝑁)) = (𝑋 FallFac 𝑁)) |
27 | 16, 24, 26 | 3eqtr3rd 2787 | . 2 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) = ((-1↑𝑁) · ((-1↑𝑁) · (--𝑋 FallFac 𝑁)))) |
28 | risefallfac 15734 | . . . 4 ⊢ ((-𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (-𝑋 RiseFac 𝑁) = ((-1↑𝑁) · (--𝑋 FallFac 𝑁))) | |
29 | 20, 28 | sylan 580 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (-𝑋 RiseFac 𝑁) = ((-1↑𝑁) · (--𝑋 FallFac 𝑁))) |
30 | 29 | oveq2d 7291 | . 2 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((-1↑𝑁) · (-𝑋 RiseFac 𝑁)) = ((-1↑𝑁) · ((-1↑𝑁) · (--𝑋 FallFac 𝑁)))) |
31 | 27, 30 | eqtr4d 2781 | 1 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) = ((-1↑𝑁) · (-𝑋 RiseFac 𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 (class class class)co 7275 ℂcc 10869 1c1 10872 + caddc 10874 · cmul 10876 -cneg 11206 2c2 12028 ℕ0cn0 12233 ℤcz 12319 ↑cexp 13782 FallFac cfallfac 15714 RiseFac crisefac 15715 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-inf2 9399 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-se 5545 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-isom 6442 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-sup 9201 df-oi 9269 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-n0 12234 df-z 12320 df-uz 12583 df-rp 12731 df-fz 13240 df-fzo 13383 df-seq 13722 df-exp 13783 df-hash 14045 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 df-clim 15197 df-prod 15616 df-risefac 15716 df-fallfac 15717 |
This theorem is referenced by: fallfac0 15738 |
Copyright terms: Public domain | W3C validator |