Theorem eln0zs 28673

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 28662	. . 3 ⊢ (𝑁 ∈ ℕ0s → 𝑁 ∈ ℤs)
2		n0sge0 28611	. . 3 ⊢ (𝑁 ∈ ℕ0s → 0s ≤s 𝑁)
3	1, 2	jca 521	. 2 ⊢ (𝑁 ∈ ℕ0s → (𝑁 ∈ ℤs ∧ 0s ≤s 𝑁))
4		elzs 28657	. . . 4 ⊢ (𝑁 ∈ ℤs ↔ ∃𝑥 ∈ ℕs ∃𝑦 ∈ ℕs 𝑁 = (𝑥 -s 𝑦))
5		nnno 28597	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℕs → 𝑥 ∈ No )
6	5	adantr 486	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → 𝑥 ∈ No )
7		nnno 28597	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ No )
8	7	adantl 487	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → 𝑦 ∈ No )
9	6, 8	subsge0d 28373	. . . . . . . 8 ⊢ ((𝑥 ∈ ℕs ∧ 𝑦 ∈ ℕs) → ( 0s ≤s (𝑥 -s 𝑦) ↔ 𝑦 ≤s 𝑥))
10		nnn0s 28600	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ ℕ0s)
11		nnn0s 28600	. . . . . . . . 9 ⊢ (𝑥 ∈ ℕs → 𝑥 ∈ ℕ0s)
12		n0subs 28636	. . . . . . . . 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 5111	. . . . . . 7 ⊢ (𝑁 = (𝑥 -s 𝑦) → ( 0s ≤s 𝑁 ↔ 0s ≤s (𝑥 -s 𝑦)))
17		eleq1 2850	. . . . . . 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 3206	. . . 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 3088   class class class wbr 5107  (class class class)co 7417   No csur 27884   ≤s cles 27988   0_s c0s 28078   -_s csubs 28293  ℕ_0scn0s 28585  ℕ_scnns 28586  ℤ_sczs 28651

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-ot 4596  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-nadd 8658  df-no 27887  df-lts 27888  df-bday 27889  df-les 27989  df-slts 28031  df-cuts 28033  df-0s 28080  df-1s 28081  df-made 28100  df-old 28101  df-left 28103  df-right 28104  df-norec 28211  df-norec2 28222  df-adds 28233  df-negs 28294  df-subs 28295  df-n0s 28587  df-nns 28588  df-zs 28652

This theorem is used by:  zn0subs  28676  peano5uzs  28677  z12sge0  28756