Theorem eln0zs 28630

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 28619	. . 3 ⊢ (𝑁 ∈ ℕ0s → 𝑁 ∈ ℤs)
2		n0sge0 28568	. . 3 ⊢ (𝑁 ∈ ℕ0s → 0s ≤s 𝑁)
3	1, 2	jca 521	. 2 ⊢ (𝑁 ∈ ℕ0s → (𝑁 ∈ ℤs ∧ 0s ≤s 𝑁))
4		elzs 28614	. . . 4 ⊢ (𝑁 ∈ ℤs ↔ ∃𝑥 ∈ ℕs ∃𝑦 ∈ ℕs 𝑁 = (𝑥 -s 𝑦))
5		nnno 28554	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℕs → 𝑥 ∈ No )
6	5	adantr 486	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → 𝑥 ∈ No )
7		nnno 28554	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ No )
8	7	adantl 487	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → 𝑦 ∈ No )
9	6, 8	subsge0d 28330	. . . . . . . 8 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → ( 0s ≤s (𝑥 -s 𝑦) ↔ 𝑦 ≤s 𝑥))
10		nnn0s 28557	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ ℕ0s)
11		nnn0s 28557	. . . . . . . . 9 ⊢ (𝑥 ∈ ℕs → 𝑥 ∈ ℕ0s)
12		n0subs 28593	. . . . . . . . 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 5118	. . . . . . 7 ⊢ (𝑁 = (𝑥 -s 𝑦) → ( 0s ≤s 𝑁 ↔ 0s ≤s (𝑥 -s 𝑦)))
17		eleq1 2854	. . . . . . 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 3210	. . . 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 2146  ∃wrex 3092   class class class wbr 5114  (class class class)co 7423   No csur 27841   ≤s cles 27945   0_s c0s 28035   -_s csubs 28250  ℕ_0scn0s 28542  ℕ_scnns 28543  ℤ_sczs 28608

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-ot 4603  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-se 5620  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-1o 8462  df-2o 8463  df-nadd 8661  df-no 27844  df-lts 27845  df-bday 27846  df-les 27946  df-slts 27988  df-cuts 27990  df-0s 28037  df-1s 28038  df-made 28057  df-old 28058  df-left 28060  df-right 28061  df-norec 28168  df-norec2 28179  df-adds 28190  df-negs 28251  df-subs 28252  df-n0s 28544  df-nns 28545  df-zs 28609

This theorem is used by:  zn0subs  28633  peano5uzs  28634  z12sge0  28713