MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  eln0zs Structured version   Visualization version   GIF version

Theorem eln0zs 28392
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.
StepHypRef Expression
1 n0zs 28381 . . 3 (𝑁 ∈ ℕ0s𝑁 ∈ ℤs)
2 n0sge0 28330 . . 3 (𝑁 ∈ ℕ0s → 0s ≤s 𝑁)
31, 2jca 511 . 2 (𝑁 ∈ ℕ0s → (𝑁 ∈ ℤs ∧ 0s ≤s 𝑁))
4 elzs 28376 . . . 4 (𝑁 ∈ ℤs ↔ ∃𝑥 ∈ ℕs𝑦 ∈ ℕs 𝑁 = (𝑥 -s 𝑦))
5 nnno 28316 . . . . . . . . . 10 (𝑥 ∈ ℕs𝑥 No )
65adantr 480 . . . . . . . . 9 ((𝑥 ∈ ℕs𝑦 ∈ ℕs) → 𝑥 No )
7 nnno 28316 . . . . . . . . . 10 (𝑦 ∈ ℕs𝑦 No )
87adantl 481 . . . . . . . . 9 ((𝑥 ∈ ℕs𝑦 ∈ ℕs) → 𝑦 No )
96, 8subsge0d 28092 . . . . . . . 8 ((𝑥 ∈ ℕs𝑦 ∈ ℕs) → ( 0s ≤s (𝑥 -s 𝑦) ↔ 𝑦 ≤s 𝑥))
10 nnn0s 28319 . . . . . . . . 9 (𝑦 ∈ ℕs𝑦 ∈ ℕ0s)
11 nnn0s 28319 . . . . . . . . 9 (𝑥 ∈ ℕs𝑥 ∈ ℕ0s)
12 n0subs 28355 . . . . . . . . 9 ((𝑦 ∈ ℕ0s𝑥 ∈ ℕ0s) → (𝑦 ≤s 𝑥 ↔ (𝑥 -s 𝑦) ∈ ℕ0s))
1310, 11, 12syl2anr 598 . . . . . . . 8 ((𝑥 ∈ ℕs𝑦 ∈ ℕs) → (𝑦 ≤s 𝑥 ↔ (𝑥 -s 𝑦) ∈ ℕ0s))
149, 13bitrd 279 . . . . . . 7 ((𝑥 ∈ ℕs𝑦 ∈ ℕs) → ( 0s ≤s (𝑥 -s 𝑦) ↔ (𝑥 -s 𝑦) ∈ ℕ0s))
1514biimpd 229 . . . . . 6 ((𝑥 ∈ ℕs𝑦 ∈ ℕs) → ( 0s ≤s (𝑥 -s 𝑦) → (𝑥 -s 𝑦) ∈ ℕ0s))
16 breq2 5089 . . . . . . 7 (𝑁 = (𝑥 -s 𝑦) → ( 0s ≤s 𝑁 ↔ 0s ≤s (𝑥 -s 𝑦)))
17 eleq1 2824 . . . . . . 7 (𝑁 = (𝑥 -s 𝑦) → (𝑁 ∈ ℕ0s ↔ (𝑥 -s 𝑦) ∈ ℕ0s))
1816, 17imbi12d 344 . . . . . 6 (𝑁 = (𝑥 -s 𝑦) → (( 0s ≤s 𝑁𝑁 ∈ ℕ0s) ↔ ( 0s ≤s (𝑥 -s 𝑦) → (𝑥 -s 𝑦) ∈ ℕ0s)))
1915, 18syl5ibrcom 247 . . . . 5 ((𝑥 ∈ ℕs𝑦 ∈ ℕs) → (𝑁 = (𝑥 -s 𝑦) → ( 0s ≤s 𝑁𝑁 ∈ ℕ0s)))
2019rexlimivv 3179 . . . 4 (∃𝑥 ∈ ℕs𝑦 ∈ ℕs 𝑁 = (𝑥 -s 𝑦) → ( 0s ≤s 𝑁𝑁 ∈ ℕ0s))
214, 20sylbi 217 . . 3 (𝑁 ∈ ℤs → ( 0s ≤s 𝑁𝑁 ∈ ℕ0s))
2221imp 406 . 2 ((𝑁 ∈ ℤs ∧ 0s ≤s 𝑁) → 𝑁 ∈ ℕ0s)
233, 22impbii 209 1 (𝑁 ∈ ℕ0s ↔ (𝑁 ∈ ℤs ∧ 0s ≤s 𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wrex 3061   class class class wbr 5085  (class class class)co 7367   No csur 27603   ≤s cles 27708   0s c0s 27797   -s csubs 28012  0scn0s 28304  scnns 28305  sczs 28370
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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-ot 4576  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-2o 8406  df-nadd 8602  df-no 27606  df-lts 27607  df-bday 27608  df-les 27709  df-slts 27750  df-cuts 27752  df-0s 27799  df-1s 27800  df-made 27819  df-old 27820  df-left 27822  df-right 27823  df-norec 27930  df-norec2 27941  df-adds 27952  df-negs 28013  df-subs 28014  df-n0s 28306  df-nns 28307  df-zs 28371
This theorem is referenced by:  zn0subs  28395  peano5uzs  28396  z12sge0  28475
  Copyright terms: Public domain W3C validator