| 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 12447 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
| 2 | 1 | 2timesd 12420 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (2 · 𝑁) = (𝑁 + 𝑁)) |
| 3 | 2 | oveq2d 7383 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (-1↑(2 · 𝑁)) = (-1↑(𝑁 + 𝑁))) |
| 4 | nn0z 12548 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 5 | m1expeven 14071 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → (-1↑(2 · 𝑁)) = 1) | |
| 6 | 4, 5 | syl 17 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (-1↑(2 · 𝑁)) = 1) |
| 7 | neg1cn 12144 | . . . . . . . 8 ⊢ -1 ∈ ℂ | |
| 8 | expadd 14066 | . . . . . . . 8 ⊢ ((-1 ∈ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (-1↑(𝑁 + 𝑁)) = ((-1↑𝑁) · (-1↑𝑁))) | |
| 9 | 7, 8 | mp3an1 1451 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (-1↑(𝑁 + 𝑁)) = ((-1↑𝑁) · (-1↑𝑁))) |
| 10 | 9 | anidms 566 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (-1↑(𝑁 + 𝑁)) = ((-1↑𝑁) · (-1↑𝑁))) |
| 11 | 3, 6, 10 | 3eqtr3rd 2780 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → ((-1↑𝑁) · (-1↑𝑁)) = 1) |
| 12 | 11 | adantl 481 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((-1↑𝑁) · (-1↑𝑁)) = 1) |
| 13 | negneg 11444 | . . . . . 6 ⊢ (𝑋 ∈ ℂ → --𝑋 = 𝑋) | |
| 14 | 13 | adantr 480 | . . . . 5 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → --𝑋 = 𝑋) |
| 15 | 14 | oveq1d 7382 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (--𝑋 FallFac 𝑁) = (𝑋 FallFac 𝑁)) |
| 16 | 12, 15 | oveq12d 7385 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (((-1↑𝑁) · (-1↑𝑁)) · (--𝑋 FallFac 𝑁)) = (1 · (𝑋 FallFac 𝑁))) |
| 17 | expcl 14041 | . . . . . 6 ⊢ ((-1 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (-1↑𝑁) ∈ ℂ) | |
| 18 | 7, 17 | mpan 691 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (-1↑𝑁) ∈ ℂ) |
| 19 | 18 | adantl 481 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (-1↑𝑁) ∈ ℂ) |
| 20 | negcl 11393 | . . . . . 6 ⊢ (𝑋 ∈ ℂ → -𝑋 ∈ ℂ) | |
| 21 | 20 | negcld 11492 | . . . . 5 ⊢ (𝑋 ∈ ℂ → --𝑋 ∈ ℂ) |
| 22 | fallfaccl 15981 | . . . . 5 ⊢ ((--𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (--𝑋 FallFac 𝑁) ∈ ℂ) | |
| 23 | 21, 22 | sylan 581 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (--𝑋 FallFac 𝑁) ∈ ℂ) |
| 24 | 19, 19, 23 | mulassd 11168 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (((-1↑𝑁) · (-1↑𝑁)) · (--𝑋 FallFac 𝑁)) = ((-1↑𝑁) · ((-1↑𝑁) · (--𝑋 FallFac 𝑁)))) |
| 25 | fallfaccl 15981 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) ∈ ℂ) | |
| 26 | 25 | mullidd 11163 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (1 · (𝑋 FallFac 𝑁)) = (𝑋 FallFac 𝑁)) |
| 27 | 16, 24, 26 | 3eqtr3rd 2780 | . 2 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) = ((-1↑𝑁) · ((-1↑𝑁) · (--𝑋 FallFac 𝑁)))) |
| 28 | risefallfac 15989 | . . . 4 ⊢ ((-𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (-𝑋 RiseFac 𝑁) = ((-1↑𝑁) · (--𝑋 FallFac 𝑁))) | |
| 29 | 20, 28 | sylan 581 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (-𝑋 RiseFac 𝑁) = ((-1↑𝑁) · (--𝑋 FallFac 𝑁))) |
| 30 | 29 | oveq2d 7383 | . 2 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((-1↑𝑁) · (-𝑋 RiseFac 𝑁)) = ((-1↑𝑁) · ((-1↑𝑁) · (--𝑋 FallFac 𝑁)))) |
| 31 | 27, 30 | eqtr4d 2774 | 1 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) = ((-1↑𝑁) · (-𝑋 RiseFac 𝑁))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 (class class class)co 7367 ℂcc 11036 1c1 11039 + caddc 11041 · cmul 11043 -cneg 11378 2c2 12236 ℕ0cn0 12437 ℤcz 12524 ↑cexp 14023 FallFac cfallfac 15969 RiseFac crisefac 15970 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-inf2 9562 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-isom 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-sup 9355 df-oi 9425 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-fz 13462 df-fzo 13609 df-seq 13964 df-exp 14024 df-hash 14293 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-clim 15450 df-prod 15869 df-risefac 15971 df-fallfac 15972 |
| This theorem is referenced by: fallfac0 15993 |
| Copyright terms: Public domain | W3C validator |