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

Theorem elnnzs 28817
Description: Positive surreal integer property expressed in terms of integers. (Contributed by Scott Fenton, 25-Jul-2025.)
Assertion
Ref Expression
elnnzs (𝑁 ∈ ℕs ↔ (𝑁 ∈ ℤs ∧ 0s <s 𝑁))

Proof of Theorem elnnzs
StepHypRef Expression
1 nnno 28740 . . . 4 (𝑁 ∈ ℕs → 𝑁 ∈ No)
2 orc 881 . . . 4 (𝑁 ∈ ℕs → (𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s )))
3 nnsgt0 28755 . . . 4 (𝑁 ∈ ℕs → 0s <s 𝑁)
41, 2, 3jca31 524 . . 3 (𝑁 ∈ ℕs → ((𝑁 ∈ No ∧ (𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s ))) ∧ 0s <s 𝑁))
5 idd 25 . . . . . . 7 ((𝑁 ∈ No ∧ 0s <s 𝑁) → (𝑁 ∈ ℕs → 𝑁 ∈ ℕs))
6 negscl 28452 . . . . . . . . . . . 12 (𝑁 ∈ No → ( -s‘𝑁) ∈ No)
76adantr 486 . . . . . . . . . . 11 ((𝑁 ∈ No ∧ 0s <s 𝑁) → ( -s‘𝑁) ∈ No)
8 0no 28225 . . . . . . . . . . . . . 14 0s ∈ No
9 ltnegs 28461 . . . . . . . . . . . . . 14 (( 0s ∈ No ∧ 𝑁 ∈ No) → ( 0s <s 𝑁 ↔ ( -s‘𝑁) <s ( -s‘ 0s )))
108, 9mpan 703 . . . . . . . . . . . . 13 (𝑁 ∈ No → ( 0s <s 𝑁 ↔ ( -s‘𝑁) <s ( -s‘ 0s )))
11 neg0s 28442 . . . . . . . . . . . . . 14 ( -s‘ 0s ) = 0s
1211breq2i 5114 . . . . . . . . . . . . 13 (( -s‘𝑁) <s ( -s‘ 0s ) ↔ ( -s‘𝑁) <s 0s )
1310, 12bitrdi 290 . . . . . . . . . . . 12 (𝑁 ∈ No → ( 0s <s 𝑁 ↔ ( -s‘𝑁) <s 0s ))
1413biimpa 482 . . . . . . . . . . 11 ((𝑁 ∈ No ∧ 0s <s 𝑁) → ( -s‘𝑁) <s 0s )
15 ltsasym 28135 . . . . . . . . . . . 12 ((( -s‘𝑁) ∈ No ∧ 0s ∈ No) → (( -s‘𝑁) <s 0s → ¬ 0s <s ( -s‘𝑁)))
168, 15mpan2 704 . . . . . . . . . . 11 (( -s‘𝑁) ∈ No → (( -s‘𝑁) <s 0s → ¬ 0s <s ( -s‘𝑁)))
177, 14, 16sylc 66 . . . . . . . . . 10 ((𝑁 ∈ No ∧ 0s <s 𝑁) → ¬ 0s <s ( -s‘𝑁))
18 nnsgt0 28755 . . . . . . . . . 10 (( -s‘𝑁) ∈ ℕs → 0s <s ( -s‘𝑁))
1917, 18nsyl 141 . . . . . . . . 9 ((𝑁 ∈ No ∧ 0s <s 𝑁) → ¬ ( -s‘𝑁) ∈ ℕs)
20 gt0ne0s 28234 . . . . . . . . . . 11 ( 0s <s 𝑁 → 𝑁 ≠ 0s )
2120adantl 487 . . . . . . . . . 10 ((𝑁 ∈ No ∧ 0s <s 𝑁) → 𝑁 ≠ 0s )
2221neneqd 2964 . . . . . . . . 9 ((𝑁 ∈ No ∧ 0s <s 𝑁) → ¬ 𝑁 = 0s )
23 ioran 999 . . . . . . . . 9 (¬ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s ) ↔ (¬ ( -s‘𝑁) ∈ ℕs ∧ ¬ 𝑁 = 0s ))
2419, 22, 23sylanbrc 595 . . . . . . . 8 ((𝑁 ∈ No ∧ 0s <s 𝑁) → ¬ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s ))
2524pm2.21d 122 . . . . . . 7 ((𝑁 ∈ No ∧ 0s <s 𝑁) → ((( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s ) → 𝑁 ∈ ℕs))
265, 25jaod 873 . . . . . 6 ((𝑁 ∈ No ∧ 0s <s 𝑁) → ((𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s )) → 𝑁 ∈ ℕs))
2726ex 418 . . . . 5 (𝑁 ∈ No → ( 0s <s 𝑁 → ((𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s )) → 𝑁 ∈ ℕs)))
2827com23 87 . . . 4 (𝑁 ∈ No → ((𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s )) → ( 0s <s 𝑁 → 𝑁 ∈ ℕs)))
2928imp31 423 . . 3 (((𝑁 ∈ No ∧ (𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s ))) ∧ 0s <s 𝑁) → 𝑁 ∈ ℕs)
304, 29impbii 212 . 2 (𝑁 ∈ ℕs ↔ ((𝑁 ∈ No ∧ (𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s ))) ∧ 0s <s 𝑁))
31 elzs2 28815 . . . 4 (𝑁 ∈ ℤs ↔ (𝑁 ∈ No ∧ (𝑁 ∈ ℕs ∨ 𝑁 = 0s ∨ ( -s‘𝑁) ∈ ℕs)))
32 3orcomb 1110 . . . . . 6 ((𝑁 ∈ ℕs ∨ 𝑁 = 0s ∨ ( -s‘𝑁) ∈ ℕs) ↔ (𝑁 ∈ ℕs ∨ ( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s ))
33 3orass 1106 . . . . . 6 ((𝑁 ∈ ℕs ∨ ( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s ) ↔ (𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s )))
3432, 33bitri 278 . . . . 5 ((𝑁 ∈ ℕs ∨ 𝑁 = 0s ∨ ( -s‘𝑁) ∈ ℕs) ↔ (𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s )))
3534anbi2i 635 . . . 4 ((𝑁 ∈ No ∧ (𝑁 ∈ ℕs ∨ 𝑁 = 0s ∨ ( -s‘𝑁) ∈ ℕs)) ↔ (𝑁 ∈ No ∧ (𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s ))))
3631, 35bitri 278 . . 3 (𝑁 ∈ ℤs ↔ (𝑁 ∈ No ∧ (𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s ))))
3736anbi1i 636 . 2 ((𝑁 ∈ ℤs ∧ 0s <s 𝑁) ↔ ((𝑁 ∈ No ∧ (𝑁 ∈ ℕs ∨ (( -s‘𝑁) ∈ ℕs ∨ 𝑁 = 0s ))) ∧ 0s <s 𝑁))
3830, 37bitr4i 281 1 (𝑁 ∈ ℕs ↔ (𝑁 ∈ ℤs ∧ 0s <s 𝑁))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∨ w3o 1102   = wceq 1570   ∈ wcel 2147   ≠ wne 2959   class class class wbr 5106  ‘cfv 6558  Nocsur 28027   <s clts 28028   0s c0s 28221   -scnegs 28435  ℕscnns 28729  ℤsczs 28794
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-ot 4862  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-2o 8505  df-nadd 8703  df-no 28030  df-lts 28031  df-bday 28032  df-les 28132  df-slts 28174  df-cuts 28176  df-0s 28223  df-1s 28224  df-made 28243  df-old 28244  df-left 28246  df-right 28247  df-norec 28354  df-norec2 28365  df-adds 28376  df-negs 28437  df-subs 28438  df-n0s 28730  df-nns 28731  df-zs 28795
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator