Theorem elzn0s 28404

Description: A surreal integer is a surreal that is a non-negative integer or whose negative is a non-negative integer. (Contributed by Scott Fenton, 26-May-2025.)

Assertion

Ref	Expression
elzn0s	⊢ (𝐴 ∈ ℤs ↔ (𝐴 ∈ No ∧ (𝐴 ∈ ℕ0s ∨ ( -us ‘𝐴) ∈ ℕ0s)))

Proof of Theorem elzn0s

Dummy variables 𝑛 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elzs 28390	. 2 ⊢ (𝐴 ∈ ℤs ↔ ∃𝑛 ∈ ℕs ∃𝑚 ∈ ℕs 𝐴 = (𝑛 -s 𝑚))
2		nnno 28330	. . . . . . 7 ⊢ (𝑛 ∈ ℕs → 𝑛 ∈ No )
3		nnno 28330	. . . . . . 7 ⊢ (𝑚 ∈ ℕs → 𝑚 ∈ No )
4		subscl 28068	. . . . . . 7 ⊢ ((𝑛 ∈ No ∧ 𝑚 ∈ No ) → (𝑛 -s 𝑚) ∈ No )
5	2, 3, 4	syl2an 597	. . . . . 6 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → (𝑛 -s 𝑚) ∈ No )
6		lestric 27746	. . . . . . . 8 ⊢ ((𝑚 ∈ No ∧ 𝑛 ∈ No ) → (𝑚 ≤s 𝑛 ∨ 𝑛 ≤s 𝑚))
7	3, 2, 6	syl2anr 598	. . . . . . 7 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → (𝑚 ≤s 𝑛 ∨ 𝑛 ≤s 𝑚))
8		nnn0s 28333	. . . . . . . . 9 ⊢ (𝑚 ∈ ℕs → 𝑚 ∈ ℕ0s)
9		nnn0s 28333	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕs → 𝑛 ∈ ℕ0s)
10		n0subs 28369	. . . . . . . . 9 ⊢ ((𝑚 ∈ ℕ0s ∧ 𝑛 ∈ ℕ0s) → (𝑚 ≤s 𝑛 ↔ (𝑛 -s 𝑚) ∈ ℕ0s))
11	8, 9, 10	syl2anr 598	. . . . . . . 8 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → (𝑚 ≤s 𝑛 ↔ (𝑛 -s 𝑚) ∈ ℕ0s))
12		n0subs 28369	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ0s ∧ 𝑚 ∈ ℕ0s) → (𝑛 ≤s 𝑚 ↔ (𝑚 -s 𝑛) ∈ ℕ0s))
13	9, 8, 12	syl2an 597	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → (𝑛 ≤s 𝑚 ↔ (𝑚 -s 𝑛) ∈ ℕ0s))
14	2	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → 𝑛 ∈ No )
15	3	adantl 481	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → 𝑚 ∈ No )
16	14, 15	negsubsdi2d 28086	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → ( -us ‘(𝑛 -s 𝑚)) = (𝑚 -s 𝑛))
17	16	eleq1d 2822	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → (( -us ‘(𝑛 -s 𝑚)) ∈ ℕ0s ↔ (𝑚 -s 𝑛) ∈ ℕ0s))
18	13, 17	bitr4d 282	. . . . . . . 8 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → (𝑛 ≤s 𝑚 ↔ ( -us ‘(𝑛 -s 𝑚)) ∈ ℕ0s))
19	11, 18	orbi12d 919	. . . . . . 7 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → ((𝑚 ≤s 𝑛 ∨ 𝑛 ≤s 𝑚) ↔ ((𝑛 -s 𝑚) ∈ ℕ0s ∨ ( -us ‘(𝑛 -s 𝑚)) ∈ ℕ0s)))
20	7, 19	mpbid 232	. . . . . 6 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → ((𝑛 -s 𝑚) ∈ ℕ0s ∨ ( -us ‘(𝑛 -s 𝑚)) ∈ ℕ0s))
21	5, 20	jca 511	. . . . 5 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → ((𝑛 -s 𝑚) ∈ No ∧ ((𝑛 -s 𝑚) ∈ ℕ0s ∨ ( -us ‘(𝑛 -s 𝑚)) ∈ ℕ0s)))
22		eleq1 2825	. . . . . 6 ⊢ (𝐴 = (𝑛 -s 𝑚) → (𝐴 ∈ No ↔ (𝑛 -s 𝑚) ∈ No ))
23		eleq1 2825	. . . . . . 7 ⊢ (𝐴 = (𝑛 -s 𝑚) → (𝐴 ∈ ℕ0s ↔ (𝑛 -s 𝑚) ∈ ℕ0s))
24		fveq2 6834	. . . . . . . 8 ⊢ (𝐴 = (𝑛 -s 𝑚) → ( -us ‘𝐴) = ( -us ‘(𝑛 -s 𝑚)))
25	24	eleq1d 2822	. . . . . . 7 ⊢ (𝐴 = (𝑛 -s 𝑚) → (( -us ‘𝐴) ∈ ℕ0s ↔ ( -us ‘(𝑛 -s 𝑚)) ∈ ℕ0s))
26	23, 25	orbi12d 919	. . . . . 6 ⊢ (𝐴 = (𝑛 -s 𝑚) → ((𝐴 ∈ ℕ0s ∨ ( -us ‘𝐴) ∈ ℕ0s) ↔ ((𝑛 -s 𝑚) ∈ ℕ0s ∨ ( -us ‘(𝑛 -s 𝑚)) ∈ ℕ0s)))
27	22, 26	anbi12d 633	. . . . 5 ⊢ (𝐴 = (𝑛 -s 𝑚) → ((𝐴 ∈ No ∧ (𝐴 ∈ ℕ0s ∨ ( -us ‘𝐴) ∈ ℕ0s)) ↔ ((𝑛 -s 𝑚) ∈ No ∧ ((𝑛 -s 𝑚) ∈ ℕ0s ∨ ( -us ‘(𝑛 -s 𝑚)) ∈ ℕ0s))))
28	21, 27	syl5ibrcom 247	. . . 4 ⊢ ((𝑛 ∈ ℕs ∧ 𝑚 ∈ ℕs) → (𝐴 = (𝑛 -s 𝑚) → (𝐴 ∈ No ∧ (𝐴 ∈ ℕ0s ∨ ( -us ‘𝐴) ∈ ℕ0s))))
29	28	rexlimivv 3180	. . 3 ⊢ (∃𝑛 ∈ ℕs ∃𝑚 ∈ ℕs 𝐴 = (𝑛 -s 𝑚) → (𝐴 ∈ No ∧ (𝐴 ∈ ℕ0s ∨ ( -us ‘𝐴) ∈ ℕ0s)))
30		n0p1nns 28377	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → (𝐴 +s 1s ) ∈ ℕs)
31		1nns 28355	. . . . . . 7 ⊢ 1s ∈ ℕs
32	31	a1i 11	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → 1s ∈ ℕs)
33		n0no 28329	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ0s → 𝐴 ∈ No )
34		1no 27816	. . . . . . . 8 ⊢ 1s ∈ No
35		pncans 28078	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ 1s ∈ No ) → ((𝐴 +s 1s ) -s 1s ) = 𝐴)
36	33, 34, 35	sylancl 587	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → ((𝐴 +s 1s ) -s 1s ) = 𝐴)
37	36	eqcomd 2743	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → 𝐴 = ((𝐴 +s 1s ) -s 1s ))
38		rspceov 7409	. . . . . 6 ⊢ (((𝐴 +s 1s ) ∈ ℕs ∧ 1s ∈ ℕs ∧ 𝐴 = ((𝐴 +s 1s ) -s 1s )) → ∃𝑛 ∈ ℕs ∃𝑚 ∈ ℕs 𝐴 = (𝑛 -s 𝑚))
39	30, 32, 37, 38	syl3anc 1374	. . . . 5 ⊢ (𝐴 ∈ ℕ0s → ∃𝑛 ∈ ℕs ∃𝑚 ∈ ℕs 𝐴 = (𝑛 -s 𝑚))
40	39	adantl 481	. . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐴 ∈ ℕ0s) → ∃𝑛 ∈ ℕs ∃𝑚 ∈ ℕs 𝐴 = (𝑛 -s 𝑚))
41	31	a1i 11	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → 1s ∈ ℕs)
42	34	a1i 11	. . . . . . . . 9 ⊢ (𝐴 ∈ No → 1s ∈ No )
43		id 22	. . . . . . . . 9 ⊢ (𝐴 ∈ No → 𝐴 ∈ No )
44	42, 43	subsvald 28067	. . . . . . . 8 ⊢ (𝐴 ∈ No → ( 1s -s 𝐴) = ( 1s +s ( -us ‘𝐴)))
45		negscl 28042	. . . . . . . . 9 ⊢ (𝐴 ∈ No → ( -us ‘𝐴) ∈ No )
46	42, 45	addscomd 27973	. . . . . . . 8 ⊢ (𝐴 ∈ No → ( 1s +s ( -us ‘𝐴)) = (( -us ‘𝐴) +s 1s ))
47	44, 46	eqtrd 2772	. . . . . . 7 ⊢ (𝐴 ∈ No → ( 1s -s 𝐴) = (( -us ‘𝐴) +s 1s ))
48	47	adantr 480	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( 1s -s 𝐴) = (( -us ‘𝐴) +s 1s ))
49		n0p1nns 28377	. . . . . . 7 ⊢ (( -us ‘𝐴) ∈ ℕ0s → (( -us ‘𝐴) +s 1s ) ∈ ℕs)
50	49	adantl 481	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → (( -us ‘𝐴) +s 1s ) ∈ ℕs)
51	48, 50	eqeltrd 2837	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ( 1s -s 𝐴) ∈ ℕs)
52	42, 43	nncansd 28103	. . . . . . 7 ⊢ (𝐴 ∈ No → ( 1s -s ( 1s -s 𝐴)) = 𝐴)
53	52	eqcomd 2743	. . . . . 6 ⊢ (𝐴 ∈ No → 𝐴 = ( 1s -s ( 1s -s 𝐴)))
54	53	adantr 480	. . . . 5 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → 𝐴 = ( 1s -s ( 1s -s 𝐴)))
55		rspceov 7409	. . . . 5 ⊢ (( 1s ∈ ℕs ∧ ( 1s -s 𝐴) ∈ ℕs ∧ 𝐴 = ( 1s -s ( 1s -s 𝐴))) → ∃𝑛 ∈ ℕs ∃𝑚 ∈ ℕs 𝐴 = (𝑛 -s 𝑚))
56	41, 51, 54, 55	syl3anc 1374	. . . 4 ⊢ ((𝐴 ∈ No ∧ ( -us ‘𝐴) ∈ ℕ0s) → ∃𝑛 ∈ ℕs ∃𝑚 ∈ ℕs 𝐴 = (𝑛 -s 𝑚))
57	40, 56	jaodan 960	. . 3 ⊢ ((𝐴 ∈ No ∧ (𝐴 ∈ ℕ0s ∨ ( -us ‘𝐴) ∈ ℕ0s)) → ∃𝑛 ∈ ℕs ∃𝑚 ∈ ℕs 𝐴 = (𝑛 -s 𝑚))
58	29, 57	impbii 209	. 2 ⊢ (∃𝑛 ∈ ℕs ∃𝑚 ∈ ℕs 𝐴 = (𝑛 -s 𝑚) ↔ (𝐴 ∈ No ∧ (𝐴 ∈ ℕ0s ∨ ( -us ‘𝐴) ∈ ℕ0s)))
59	1, 58	bitri 275	1 ⊢ (𝐴 ∈ ℤs ↔ (𝐴 ∈ No ∧ (𝐴 ∈ ℕ0s ∨ ( -us ‘𝐴) ∈ ℕ0s)))

Syntax hints:   ↔ wb 206   ∧ wa 395   ∨ wo 848   = wceq 1542   ∈ wcel 2114  ∃wrex 3062   class class class wbr 5086  ‘cfv 6492  (class class class)co 7360   No csur 27617   ≤s cles 27722   1_s c1s 27812   +_s cadds 27965   -u_s cnegs 28025   -_s csubs 28026  ℕ_0scn0s 28318  ℕ_scnns 28319  ℤ_sczs 28384

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-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-ot 4577  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-2o 8399  df-nadd 8595  df-no 27620  df-lts 27621  df-bday 27622  df-les 27723  df-slts 27764  df-cuts 27766  df-0s 27813  df-1s 27814  df-made 27833  df-old 27834  df-left 27836  df-right 27837  df-norec 27944  df-norec2 27955  df-adds 27966  df-negs 28027  df-subs 28028  df-n0s 28320  df-nns 28321  df-zs 28385

This theorem is referenced by:  elzs2  28405  zsbday  28412  zcuts  28413  zcuts0  28414