Theorem eln0zs 28768

Description: Non-negative surreal integer property expressed in terms of integers. (Contributed by Scott Fenton, 25-Jul-2025.)

Assertion

Ref	Expression
eln0zs	⊢ (𝑁 ∈ ℕ0s ↔ (𝑁 ∈ ℤs ∧ 0s ≤s 𝑁))

Proof of Theorem eln0zs

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		n0zs 28757	. . 3 ⊢ (𝑁 ∈ ℕ0s → 𝑁 ∈ ℤs)
2		n0sge0 28706	. . 3 ⊢ (𝑁 ∈ ℕ0s → 0s ≤s 𝑁)
3	1, 2	jca 521	. 2 ⊢ (𝑁 ∈ ℕ0s → (𝑁 ∈ ℤs ∧ 0s ≤s 𝑁))
4		elzs 28752	. . . 4 ⊢ (𝑁 ∈ ℤs ↔ ∃𝑥 ∈ ℕs ∃𝑦 ∈ ℕs 𝑁 = (𝑥 -s 𝑦))
5		nnno 28692	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℕs → 𝑥 ∈ No )
6	5	adantr 486	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → 𝑥 ∈ No )
7		nnno 28692	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ No )
8	7	adantl 487	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → 𝑦 ∈ No )
9	6, 8	subsge0d 28468	. . . . . . . 8 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → ( 0s ≤s (𝑥 -s 𝑦) ↔ 𝑦 ≤s 𝑥))
10		nnn0s 28695	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ ℕ0s)
11		nnn0s 28695	. . . . . . . . 9 ⊢ (𝑥 ∈ ℕs → 𝑥 ∈ ℕ0s)
12		n0subs 28731	. . . . . . . . 9 ⊢ ((𝑦 ∈ ℕ0s ∧ 𝑥 ∈ ℕ0s) → (𝑦 ≤s 𝑥 ↔ (𝑥 -s 𝑦) ∈ ℕ0s))
13	10, 11, 12	syl2anr 609	. . . . . . . 8 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → (𝑦 ≤s 𝑥 ↔ (𝑥 -s 𝑦) ∈ ℕ0s))
14	9, 13	bitrd 282	. . . . . . 7 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → ( 0s ≤s (𝑥 -s 𝑦) ↔ (𝑥 -s 𝑦) ∈ ℕ0s))
15	14	biimpd 232	. . . . . 6 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → ( 0s ≤s (𝑥 -s 𝑦) → (𝑥 -s 𝑦) ∈ ℕ0s))
16		breq2 5107	. . . . . . 7 ⊢ (𝑁 = (𝑥 -s 𝑦) → ( 0s ≤s 𝑁 ↔ 0s ≤s (𝑥 -s 𝑦)))
17		eleq1 2849	. . . . . . 7 ⊢ (𝑁 = (𝑥 -s 𝑦) → (𝑁 ∈ ℕ0s ↔ (𝑥 -s 𝑦) ∈ ℕ0s))
18	16, 17	imbi12d 347	. . . . . 6 ⊢ (𝑁 = (𝑥 -s 𝑦) → (( 0s ≤s 𝑁 → 𝑁 ∈ ℕ0s) ↔ ( 0s ≤s (𝑥 -s 𝑦) → (𝑥 -s 𝑦) ∈ ℕ0s)))
19	15, 18	syl5ibrcom 250	. . . . 5 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → (𝑁 = (𝑥 -s 𝑦) → ( 0s ≤s 𝑁 → 𝑁 ∈ ℕ0s)))
20	19	rexlimivv 3205	. . . 4 ⊢ (∃𝑥 ∈ ℕs ∃𝑦 ∈ ℕs 𝑁 = (𝑥 -s 𝑦) → ( 0s ≤s 𝑁 → 𝑁 ∈ ℕ0s))
21	4, 20	sylbi 220	. . 3 ⊢ (𝑁 ∈ ℤs → ( 0s ≤s 𝑁 → 𝑁 ∈ ℕ0s))
22	21	imp 412	. 2 ⊢ ((𝑁 ∈ ℤs ∧ 0s ≤s 𝑁) → 𝑁 ∈ ℕ0s)
23	3, 22	impbii 212	1 ⊢ (𝑁 ∈ ℕ0s ↔ (𝑁 ∈ ℤs ∧ 0s ≤s 𝑁))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087   class class class wbr 5103  (class class class)co 7412   No csur 27979   ≤s cles 28083   0_s c0s 28173   -_s csubs 28388  ℕ_0scn0s 28680  ℕ_scnns 28681  ℤ_sczs 28746

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8460  df-2o 8461  df-nadd 8659  df-no 27982  df-lts 27983  df-bday 27984  df-les 28084  df-slts 28126  df-cuts 28128  df-0s 28175  df-1s 28176  df-made 28195  df-old 28196  df-left 28198  df-right 28199  df-norec 28306  df-norec2 28317  df-adds 28328  df-negs 28389  df-subs 28390  df-n0s 28682  df-nns 28683  df-zs 28747

This theorem is used by:  zn0subs  28771  peano5uzs  28772  z12sge0  28851