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

Theorem elnnzs 28402
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 nnsno 28344 . . . 4 (𝑁 ∈ ℕs𝑁 No )
2 orc 867 . . . 4 (𝑁 ∈ ℕs → (𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s )))
3 nnsgt0 28357 . . . 4 (𝑁 ∈ ℕs → 0s <s 𝑁)
41, 2, 3jca31 514 . . 3 (𝑁 ∈ ℕs → ((𝑁 No ∧ (𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s ))) ∧ 0s <s 𝑁))
5 idd 24 . . . . . . 7 ((𝑁 No ∧ 0s <s 𝑁) → (𝑁 ∈ ℕs𝑁 ∈ ℕs))
6 negscl 28083 . . . . . . . . . . . 12 (𝑁 No → ( -us𝑁) ∈ No )
76adantr 480 . . . . . . . . . . 11 ((𝑁 No ∧ 0s <s 𝑁) → ( -us𝑁) ∈ No )
8 0sno 27886 . . . . . . . . . . . . . 14 0s No
9 sltneg 28092 . . . . . . . . . . . . . 14 (( 0s No 𝑁 No ) → ( 0s <s 𝑁 ↔ ( -us𝑁) <s ( -us ‘ 0s )))
108, 9mpan 690 . . . . . . . . . . . . 13 (𝑁 No → ( 0s <s 𝑁 ↔ ( -us𝑁) <s ( -us ‘ 0s )))
11 negs0s 28073 . . . . . . . . . . . . . 14 ( -us ‘ 0s ) = 0s
1211breq2i 5156 . . . . . . . . . . . . 13 (( -us𝑁) <s ( -us ‘ 0s ) ↔ ( -us𝑁) <s 0s )
1310, 12bitrdi 287 . . . . . . . . . . . 12 (𝑁 No → ( 0s <s 𝑁 ↔ ( -us𝑁) <s 0s ))
1413biimpa 476 . . . . . . . . . . 11 ((𝑁 No ∧ 0s <s 𝑁) → ( -us𝑁) <s 0s )
15 sltasym 27808 . . . . . . . . . . . 12 ((( -us𝑁) ∈ No ∧ 0s No ) → (( -us𝑁) <s 0s → ¬ 0s <s ( -us𝑁)))
168, 15mpan2 691 . . . . . . . . . . 11 (( -us𝑁) ∈ No → (( -us𝑁) <s 0s → ¬ 0s <s ( -us𝑁)))
177, 14, 16sylc 65 . . . . . . . . . 10 ((𝑁 No ∧ 0s <s 𝑁) → ¬ 0s <s ( -us𝑁))
18 nnsgt0 28357 . . . . . . . . . 10 (( -us𝑁) ∈ ℕs → 0s <s ( -us𝑁))
1917, 18nsyl 140 . . . . . . . . 9 ((𝑁 No ∧ 0s <s 𝑁) → ¬ ( -us𝑁) ∈ ℕs)
20 sgt0ne0 27894 . . . . . . . . . . 11 ( 0s <s 𝑁𝑁 ≠ 0s )
2120adantl 481 . . . . . . . . . 10 ((𝑁 No ∧ 0s <s 𝑁) → 𝑁 ≠ 0s )
2221neneqd 2943 . . . . . . . . 9 ((𝑁 No ∧ 0s <s 𝑁) → ¬ 𝑁 = 0s )
23 ioran 985 . . . . . . . . 9 (¬ (( -us𝑁) ∈ ℕs𝑁 = 0s ) ↔ (¬ ( -us𝑁) ∈ ℕs ∧ ¬ 𝑁 = 0s ))
2419, 22, 23sylanbrc 583 . . . . . . . 8 ((𝑁 No ∧ 0s <s 𝑁) → ¬ (( -us𝑁) ∈ ℕs𝑁 = 0s ))
2524pm2.21d 121 . . . . . . 7 ((𝑁 No ∧ 0s <s 𝑁) → ((( -us𝑁) ∈ ℕs𝑁 = 0s ) → 𝑁 ∈ ℕs))
265, 25jaod 859 . . . . . 6 ((𝑁 No ∧ 0s <s 𝑁) → ((𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s )) → 𝑁 ∈ ℕs))
2726ex 412 . . . . 5 (𝑁 No → ( 0s <s 𝑁 → ((𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s )) → 𝑁 ∈ ℕs)))
2827com23 86 . . . 4 (𝑁 No → ((𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s )) → ( 0s <s 𝑁𝑁 ∈ ℕs)))
2928imp31 417 . . 3 (((𝑁 No ∧ (𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s ))) ∧ 0s <s 𝑁) → 𝑁 ∈ ℕs)
304, 29impbii 209 . 2 (𝑁 ∈ ℕs ↔ ((𝑁 No ∧ (𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s ))) ∧ 0s <s 𝑁))
31 elzs2 28400 . . . 4 (𝑁 ∈ ℤs ↔ (𝑁 No ∧ (𝑁 ∈ ℕs𝑁 = 0s ∨ ( -us𝑁) ∈ ℕs)))
32 3orcomb 1093 . . . . . 6 ((𝑁 ∈ ℕs𝑁 = 0s ∨ ( -us𝑁) ∈ ℕs) ↔ (𝑁 ∈ ℕs ∨ ( -us𝑁) ∈ ℕs𝑁 = 0s ))
33 3orass 1089 . . . . . 6 ((𝑁 ∈ ℕs ∨ ( -us𝑁) ∈ ℕs𝑁 = 0s ) ↔ (𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s )))
3432, 33bitri 275 . . . . 5 ((𝑁 ∈ ℕs𝑁 = 0s ∨ ( -us𝑁) ∈ ℕs) ↔ (𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s )))
3534anbi2i 623 . . . 4 ((𝑁 No ∧ (𝑁 ∈ ℕs𝑁 = 0s ∨ ( -us𝑁) ∈ ℕs)) ↔ (𝑁 No ∧ (𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s ))))
3631, 35bitri 275 . . 3 (𝑁 ∈ ℤs ↔ (𝑁 No ∧ (𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s ))))
3736anbi1i 624 . 2 ((𝑁 ∈ ℤs ∧ 0s <s 𝑁) ↔ ((𝑁 No ∧ (𝑁 ∈ ℕs ∨ (( -us𝑁) ∈ ℕs𝑁 = 0s ))) ∧ 0s <s 𝑁))
3830, 37bitr4i 278 1 (𝑁 ∈ ℕs ↔ (𝑁 ∈ ℤs ∧ 0s <s 𝑁))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 847  w3o 1085   = wceq 1537  wcel 2106  wne 2938   class class class wbr 5148  cfv 6563   No csur 27699   <s cslt 27700   0s c0s 27882   -us cnegs 28066  scnns 28334  sczs 28379
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-tp 4636  df-op 4638  df-ot 4640  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-se 5642  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-2o 8506  df-nadd 8703  df-no 27702  df-slt 27703  df-bday 27704  df-sle 27805  df-sslt 27841  df-scut 27843  df-0s 27884  df-1s 27885  df-made 27901  df-old 27902  df-left 27904  df-right 27905  df-norec 27986  df-norec2 27997  df-adds 28008  df-negs 28068  df-subs 28069  df-n0s 28335  df-nns 28336  df-zs 28380
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator