Metamath Proof Explorer


Theorem leibpilem1

Description: Lemma for leibpi . (Contributed by Mario Carneiro, 7-Apr-2015) (Proof shortened by Steven Nguyen, 23-Mar-2023)

Ref Expression
Assertion leibpilem1 ⊢ N ∈ ℕ 0 ∧ ¬ N = 0 ∧ ¬ 2 ∥ N → N ∈ ℕ ∧ N − 1 2 ∈ ℕ 0

Proof

Step Hyp Ref Expression
1 nn0onn ⊢ N ∈ ℕ 0 ∧ ¬ 2 ∥ N → N ∈ ℕ
2 nn0oddm1d2 ⊢ N ∈ ℕ 0 → ¬ 2 ∥ N ↔ N − 1 2 ∈ ℕ 0
3 2 biimpa ⊢ N ∈ ℕ 0 ∧ ¬ 2 ∥ N → N − 1 2 ∈ ℕ 0
4 1 3 jca ⊢ N ∈ ℕ 0 ∧ ¬ 2 ∥ N → N ∈ ℕ ∧ N − 1 2 ∈ ℕ 0
5 4 adantrl ⊢ N ∈ ℕ 0 ∧ ¬ N = 0 ∧ ¬ 2 ∥ N → N ∈ ℕ ∧ N − 1 2 ∈ ℕ 0