| 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 12621 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
| 2 | 1 | 2timesd 12594 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (2 · 𝑁) = (𝑁 + 𝑁)) |
| 3 | 2 | oveq2d 7438 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → ( -1↑(2 · 𝑁)) = ( -1↑(𝑁 + 𝑁))) |
| 4 | nn0z 12722 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | |
| 5 | m1expeven 14257 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → ( -1↑(2 · 𝑁)) = 1) | |
| 6 | 4, 5 | syl 18 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → ( -1↑(2 · 𝑁)) = 1) |
| 7 | neg1cn 12310 | . . . . . . . 8 ⊢ -1 ∈ ℂ | |
| 8 | expadd 14252 | . . . . . . . 8 ⊢ (( -1 ∈ ℂ ∧ 𝑁 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → ( -1↑(𝑁 + 𝑁)) = (( -1↑𝑁) · ( -1↑𝑁))) | |
| 9 | 7, 8 | mp3an1 1477 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → ( -1↑(𝑁 + 𝑁)) = (( -1↑𝑁) · ( -1↑𝑁))) |
| 10 | 9 | anidms 577 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → ( -1↑(𝑁 + 𝑁)) = (( -1↑𝑁) · ( -1↑𝑁))) |
| 11 | 3, 6, 10 | 3eqtr3rd 2804 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (( -1↑𝑁) · ( -1↑𝑁)) = 1) |
| 12 | 11 | adantl 487 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (( -1↑𝑁) · ( -1↑𝑁)) = 1) |
| 13 | negneg 11613 | . . . . . 6 ⊢ (𝑋 ∈ ℂ → - -𝑋 = 𝑋) | |
| 14 | 13 | adantr 486 | . . . . 5 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → - -𝑋 = 𝑋) |
| 15 | 14 | oveq1d 7437 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ( - -𝑋 FallFac 𝑁) = (𝑋 FallFac 𝑁)) |
| 16 | 12, 15 | oveq12d 7440 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((( -1↑𝑁) · ( -1↑𝑁)) · ( - -𝑋 FallFac 𝑁)) = (1 · (𝑋 FallFac 𝑁))) |
| 17 | expcl 14227 | . . . . . 6 ⊢ (( -1 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ( -1↑𝑁) ∈ ℂ) | |
| 18 | 7, 17 | mpan 703 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → ( -1↑𝑁) ∈ ℂ) |
| 19 | 18 | adantl 487 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ( -1↑𝑁) ∈ ℂ) |
| 20 | negcl 11562 | . . . . . 6 ⊢ (𝑋 ∈ ℂ → -𝑋 ∈ ℂ) | |
| 21 | 20 | negcld 11661 | . . . . 5 ⊢ (𝑋 ∈ ℂ → - -𝑋 ∈ ℂ) |
| 22 | fallfaccl 16190 | . . . . 5 ⊢ (( - -𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ( - -𝑋 FallFac 𝑁) ∈ ℂ) | |
| 23 | 21, 22 | sylan 592 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ( - -𝑋 FallFac 𝑁) ∈ ℂ) |
| 24 | 19, 19, 23 | mulassd 11337 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((( -1↑𝑁) · ( -1↑𝑁)) · ( - -𝑋 FallFac 𝑁)) = (( -1↑𝑁) · (( -1↑𝑁) · ( - -𝑋 FallFac 𝑁)))) |
| 25 | fallfaccl 16190 | . . . 4 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) ∈ ℂ) | |
| 26 | 25 | mullidd 11332 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (1 · (𝑋 FallFac 𝑁)) = (𝑋 FallFac 𝑁)) |
| 27 | 16, 24, 26 | 3eqtr3rd 2804 | . 2 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) = (( -1↑𝑁) · (( -1↑𝑁) · ( - -𝑋 FallFac 𝑁)))) |
| 28 | risefallfac 16198 | . . . 4 ⊢ (( -𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ( -𝑋 RiseFac 𝑁) = (( -1↑𝑁) · ( - -𝑋 FallFac 𝑁))) | |
| 29 | 20, 28 | sylan 592 | . . 3 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ( -𝑋 RiseFac 𝑁) = (( -1↑𝑁) · ( - -𝑋 FallFac 𝑁))) |
| 30 | 29 | oveq2d 7438 | . 2 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (( -1↑𝑁) · ( -𝑋 RiseFac 𝑁)) = (( -1↑𝑁) · (( -1↑𝑁) · ( - -𝑋 FallFac 𝑁)))) |
| 31 | 27, 30 | eqtr4d 2798 | 1 ⊢ ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑋 FallFac 𝑁) = (( -1↑𝑁) · ( -𝑋 RiseFac 𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 (class class class)co 7422 ℂcc 11203 1c1 11206 + caddc 11208 · cmul 11210 -cneg 11547 2c2 12402 ℕ0cn0 12611 ℤcz 12698 ↑cexp 14209 FallFac cfallfac 16178 RiseFac crisefac 16179 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7753 ax-inf2 9647 ax-cnex 11261 ax-resscn 11262 ax-1cn 11263 ax-icn 11264 ax-addcl 11265 ax-addrcl 11266 ax-mulcl 11267 ax-mulrcl 11268 ax-mulcom 11269 ax-addass 11270 ax-mulass 11271 ax-distr 11272 ax-i2m1 11273 ax-1ne0 11274 ax-1rid 11275 ax-rnegex 11276 ax-rrecex 11277 ax-cnre 11278 ax-pre-lttri 11279 ax-pre-lttrn 11280 ax-pre-ltadd 11281 ax-pre-mulgt0 11282 ax-pre-sup 11283 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-isom 6550 df-riota 7379 df-ov 7425 df-oprab 7426 df-mpo 7427 df-om 7880 df-1st 8003 df-2nd 8004 df-frecs 8304 df-wrecs 8335 df-recs 8384 df-rdg 8423 df-1o 8481 df-er 8722 df-en 8979 df-dom 8980 df-sdom 8981 df-fin 8982 df-sup 9439 df-oi 9509 df-card 10025 df-pnf 11350 df-mnf 11351 df-xr 11352 df-ltxr 11353 df-le 11354 df-sub 11548 df-neg 11549 df-div 11979 df-nn 12341 df-2 12410 df-3 12411 df-n0 12612 df-z 12699 df-uz 12971 df-rp 13126 df-fz 13645 df-fzo 13794 df-seq 14150 df-exp 14210 df-hash 14480 df-cj 15273 df-re 15274 df-im 15275 df-sqrt 15409 df-abs 15410 df-clim 15662 df-prod 16080 df-risefac 16180 df-fallfac 16181 |
| This theorem is used by: fallfac0 16201 |
| Copyright terms: Public domain | W3C validator |