This is an inofficial mirror of http://metamath.tirix.org for personal testing of a visualizer extension only.

Metamath Proof Explorer

Theorem oddn2prm

Description: A prime not equal to 2 is odd. (Contributed by AV, 28-Jun-2021)

		Ref	Expression
	Assertion	oddn2prm	$⊢ N \in (ℙ ∖ \{2\}) \to \neg 2 ∥ N$

Step	Hyp	Ref	Expression
1		nnoddn2prm	$⊢ N \in (ℙ ∖ \{2\}) \to (N \in ℕ \land \neg 2 ∥ N)$
2	1	simprd	$⊢ N \in (ℙ ∖ \{2\}) \to \neg 2 ∥ N$