Metamath Proof Explorer


Theorem fallrisefac

Description: A relationship between falling and rising factorials. (Contributed by Scott Fenton, 17-Jan-2018)

Ref Expression
Assertion fallrisefac ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → X N _ = − 1 N ⁢ − X N ‾

Proof

Step Hyp Ref Expression
1 nn0cn ⊢ N ∈ ℕ 0 → N ∈ ℂ
2 1 2timesd ⊢ N ∈ ℕ 0 → 2 ⋅ N = N + N
3 2 oveq2d ⊢ N ∈ ℕ 0 → − 1 2 ⋅ N = − 1 N + N
4 nn0z ⊢ N ∈ ℕ 0 → N ∈ ℤ
5 m1expeven ⊢ N ∈ ℤ → − 1 2 ⋅ N = 1
6 4 5 syl ⊢ N ∈ ℕ 0 → − 1 2 ⋅ N = 1
7 neg1cn ⊢ − 1 ∈ ℂ
8 expadd ⊢ − 1 ∈ ℂ ∧ N ∈ ℕ 0 ∧ N ∈ ℕ 0 → − 1 N + N = − 1 N ⁢ − 1 N
9 7 8 mp3an1 ⊢ N ∈ ℕ 0 ∧ N ∈ ℕ 0 → − 1 N + N = − 1 N ⁢ − 1 N
10 9 anidms ⊢ N ∈ ℕ 0 → − 1 N + N = − 1 N ⁢ − 1 N
11 3 6 10 3eqtr3rd ⊢ N ∈ ℕ 0 → − 1 N ⁢ − 1 N = 1
12 11 adantl ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → − 1 N ⁢ − 1 N = 1
13 negneg ⊢ X ∈ ℂ → − − X = X
14 13 adantr ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → − − X = X
15 14 oveq1d ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → − − X N _ = X N _
16 12 15 oveq12d ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → − 1 N ⁢ − 1 N ⁢ − − X N _ = 1 ⁢ X N _
17 expcl ⊢ − 1 ∈ ℂ ∧ N ∈ ℕ 0 → − 1 N ∈ ℂ
18 7 17 mpan ⊢ N ∈ ℕ 0 → − 1 N ∈ ℂ
19 18 adantl ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → − 1 N ∈ ℂ
20 negcl ⊢ X ∈ ℂ → − X ∈ ℂ
21 20 negcld ⊢ X ∈ ℂ → − − X ∈ ℂ
22 fallfaccl ⊢ − − X ∈ ℂ ∧ N ∈ ℕ 0 → − − X N _ ∈ ℂ
23 21 22 sylan ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → − − X N _ ∈ ℂ
24 19 19 23 mulassd ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → − 1 N ⁢ − 1 N ⁢ − − X N _ = − 1 N ⁢ − 1 N ⁢ − − X N _
25 fallfaccl ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → X N _ ∈ ℂ
26 25 mullidd ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → 1 ⁢ X N _ = X N _
27 16 24 26 3eqtr3rd ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → X N _ = − 1 N ⁢ − 1 N ⁢ − − X N _
28 risefallfac ⊢ − X ∈ ℂ ∧ N ∈ ℕ 0 → − X N ‾ = − 1 N ⁢ − − X N _
29 20 28 sylan ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → − X N ‾ = − 1 N ⁢ − − X N _
30 29 oveq2d ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → − 1 N ⁢ − X N ‾ = − 1 N ⁢ − 1 N ⁢ − − X N _
31 27 30 eqtr4d ⊢ X ∈ ℂ ∧ N ∈ ℕ 0 → X N _ = − 1 N ⁢ − X N ‾