Theorem xnn0nn0d 32862

Description: Conditions for an extended nonnegative integer to be a nonnegative integer. (Contributed by Thierry Arnoux, 26-Oct-2025.)

Hypotheses

Ref	Expression
xnn0nnd.1	⊢ (𝜑 → 𝑁 ∈ ℕ0*)
xnn0nnd.2	⊢ (𝜑 → 𝑁 ∈ ℝ)

Assertion

Ref	Expression
xnn0nn0d	⊢ (𝜑 → 𝑁 ∈ ℕ0)

Proof of Theorem xnn0nn0d

Step	Hyp	Ref	Expression
1		xnn0nnd.1	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ0*)
2		elxnn0 12488	. . 3 ⊢ (𝑁 ∈ ℕ0* ↔ (𝑁 ∈ ℕ0 ∨ 𝑁 = +∞))
3	1, 2	sylib 218	. 2 ⊢ (𝜑 → (𝑁 ∈ ℕ0 ∨ 𝑁 = +∞))
4		xnn0nnd.2	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℝ)
5	4	renepnfd 11195	. . 3 ⊢ (𝜑 → 𝑁 ≠ +∞)
6	5	neneqd 2938	. 2 ⊢ (𝜑 → ¬ 𝑁 = +∞)
7	3, 6	olcnd 878	1 ⊢ (𝜑 → 𝑁 ∈ ℕ0)

Syntax hints:   → wi 4   ∨ wo 848   = wceq 1542   ∈ wcel 2114  ℝcr 11037  +∞cpnf 11175  ℕ₀cn0 12413  ℕ₀^*cxnn0 12486

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-nel 3038  df-rab 3402  df-v 3444  df-un 3908  df-in 3910  df-ss 3920  df-pw 4558  df-sn 4583  df-pr 4585  df-uni 4866  df-pnf 11180  df-xnn0 12487

This theorem is referenced by:  xnn0nnd  32863  constrext2chnlem  33927