Theorem eln0zs 28791

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 28780	. . 3 ⊢ (𝑁 ∈ ℕ0s → 𝑁 ∈ ℤs)
2		n0sge0 28729	. . 3 ⊢ (𝑁 ∈ ℕ0s → 0s ≤s 𝑁)
3	1, 2	jca 521	. 2 ⊢ (𝑁 ∈ ℕ0s → (𝑁 ∈ ℤs ∧ 0s ≤s 𝑁))
4		elzs 28775	. . . 4 ⊢ (𝑁 ∈ ℤs ↔ ∃𝑥 ∈ ℕs ∃𝑦 ∈ ℕs 𝑁 = (𝑥 −s 𝑦))
5		nnno 28715	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℕs → 𝑥 ∈ No)
6	5	adantr 486	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → 𝑥 ∈ No)
7		nnno 28715	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ No)
8	7	adantl 487	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → 𝑦 ∈ No)
9	6, 8	subsge0d 28491	. . . . . . . 8 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → ( 0s ≤s (𝑥 −s 𝑦) ↔ 𝑦 ≤s 𝑥))
10		nnn0s 28718	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ ℕ0s)
11		nnn0s 28718	. . . . . . . . 9 ⊢ (𝑥 ∈ ℕs → 𝑥 ∈ ℕ0s)
12		n0subs 28754	. . . . . . . . 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 5106	. . . . . . 7 ⊢ (𝑁 = (𝑥 −s 𝑦) → ( 0s ≤s 𝑁 ↔ 0s ≤s (𝑥 −s 𝑦)))
17		eleq1 2848	. . . . . . 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 3204	. . . 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 1569   ∈ wcel 2144  ∃wrex 3086   class class class wbr 5102  (class class class)co 7420  Nocsur 28002   ≤s cles 28106   0_s c0s 28196   −_s csubs 28411  ℕ_0scn0s 28703  ℕ_scnns 28704  ℤ_sczs 28769

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-ot 4858  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-1o 8479  df-2o 8480  df-nadd 8678  df-no 28005  df-lts 28006  df-bday 28007  df-les 28107  df-slts 28149  df-cuts 28151  df-0s 28198  df-1s 28199  df-made 28218  df-old 28219  df-left 28221  df-right 28222  df-norec 28329  df-norec2 28340  df-adds 28351  df-negs 28412  df-subs 28413  df-n0s 28705  df-nns 28706  df-zs 28770

This theorem is used by:  zn0subs  28794  peano5uzs  28795  z12sge0  28874