Metamath Proof Explorer


Theorem nn0risefaccl

Description: Closure law for rising factorial. (Contributed by Scott Fenton, 5-Jan-2018)

Ref Expression
Assertion nn0risefaccl ⊢ A ∈ ℕ 0 ∧ N ∈ ℕ 0 → A N ‾ ∈ ℕ 0

Proof

Step Hyp Ref Expression
1 nn0sscn ⊢ ℕ 0 ⊆ ℂ
2 1nn0 ⊢ 1 ∈ ℕ 0
3 nn0mulcl ⊢ x ∈ ℕ 0 ∧ y ∈ ℕ 0 → x ⁢ y ∈ ℕ 0
4 nn0addcl ⊢ A ∈ ℕ 0 ∧ k ∈ ℕ 0 → A + k ∈ ℕ 0
5 1 2 3 4 risefaccllem ⊢ A ∈ ℕ 0 ∧ N ∈ ℕ 0 → A N ‾ ∈ ℕ 0