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

Theorem n0mulscl 28503
Description: The non-negative surreal integers are closed under multiplication. (Contributed by Scott Fenton, 15-Apr-2025.)
Assertion
Ref Expression
n0mulscl ((𝐴 ∈ ℕ0s𝐵 ∈ ℕ0s) → (𝐴 ·s 𝐵) ∈ ℕ0s)

Proof of Theorem n0mulscl
Dummy variables 𝑛 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 7419 . . . . 5 (𝑛 = 0s → (𝐴 ·s 𝑛) = (𝐴 ·s 0s ))
21eleq1d 2854 . . . 4 (𝑛 = 0s → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 0s ) ∈ ℕ0s))
32imbi2d 343 . . 3 (𝑛 = 0s → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) ∈ ℕ0s)))
4 oveq2 7419 . . . . 5 (𝑛 = 𝑚 → (𝐴 ·s 𝑛) = (𝐴 ·s 𝑚))
54eleq1d 2854 . . . 4 (𝑛 = 𝑚 → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 𝑚) ∈ ℕ0s))
65imbi2d 343 . . 3 (𝑛 = 𝑚 → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 𝑚) ∈ ℕ0s)))
7 oveq2 7419 . . . . 5 (𝑛 = (𝑚 +s 1s ) → (𝐴 ·s 𝑛) = (𝐴 ·s (𝑚 +s 1s )))
87eleq1d 2854 . . . 4 (𝑛 = (𝑚 +s 1s ) → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s))
98imbi2d 343 . . 3 (𝑛 = (𝑚 +s 1s ) → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)))
10 oveq2 7419 . . . . 5 (𝑛 = 𝐵 → (𝐴 ·s 𝑛) = (𝐴 ·s 𝐵))
1110eleq1d 2854 . . . 4 (𝑛 = 𝐵 → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 𝐵) ∈ ℕ0s))
1211imbi2d 343 . . 3 (𝑛 = 𝐵 → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 𝐵) ∈ ℕ0s)))
13 n0no 28481 . . . . 5 (𝐴 ∈ ℕ0s𝐴 No )
14 muls01 28270 . . . . 5 (𝐴 No → (𝐴 ·s 0s ) = 0s )
1513, 14syl 18 . . . 4 (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) = 0s )
16 0n0s 28487 . . . 4 0s ∈ ℕ0s
1715, 16eqeltrdi 2877 . . 3 (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) ∈ ℕ0s)
1813ad2antrr 738 . . . . . . . . 9 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 𝐴 No )
19 n0no 28481 . . . . . . . . . 10 (𝑚 ∈ ℕ0s𝑚 No )
2019ad2antlr 739 . . . . . . . . 9 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 𝑚 No )
21 1no 27968 . . . . . . . . . 10 1s No
2221a1i 11 . . . . . . . . 9 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 1s No )
2318, 20, 22addsdid 28314 . . . . . . . 8 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) = ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )))
2413mulsridd 28272 . . . . . . . . . 10 (𝐴 ∈ ℕ0s → (𝐴 ·s 1s ) = 𝐴)
2524oveq2d 7427 . . . . . . . . 9 (𝐴 ∈ ℕ0s → ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
2625ad2antrr 738 . . . . . . . 8 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
2723, 26eqtrd 2804 . . . . . . 7 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
28 n0addscl 28502 . . . . . . . . 9 (((𝐴 ·s 𝑚) ∈ ℕ0s𝐴 ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
2928ancoms 463 . . . . . . . 8 ((𝐴 ∈ ℕ0s ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
3029adantlr 727 . . . . . . 7 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
3127, 30eqeltrd 2869 . . . . . 6 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)
3231ex 417 . . . . 5 ((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) → ((𝐴 ·s 𝑚) ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s))
3332expcom 418 . . . 4 (𝑚 ∈ ℕ0s → (𝐴 ∈ ℕ0s → ((𝐴 ·s 𝑚) ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)))
3433a2d 30 . . 3 (𝑚 ∈ ℕ0s → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)))
353, 6, 9, 12, 17, 34n0sind 28491 . 2 (𝐵 ∈ ℕ0s → (𝐴 ∈ ℕ0s → (𝐴 ·s 𝐵) ∈ ℕ0s))
3635impcom 412 1 ((𝐴 ∈ ℕ0s𝐵 ∈ ℕ0s) → (𝐴 ·s 𝐵) ∈ ℕ0s)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1567  wcel 2149  (class class class)co 7411   No csur 27769   0s c0s 27963   1s c1s 27964   +s cadds 28117   ·s cmuls 28264  0scn0s 28470
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-ot 4603  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-se 5616  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  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 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7862  df-1st 7985  df-2nd 7986  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8452  df-2o 8453  df-nadd 8651  df-no 27772  df-lts 27773  df-bday 27774  df-les 27874  df-slts 27916  df-cuts 27918  df-0s 27965  df-1s 27966  df-made 27985  df-old 27986  df-left 27988  df-right 27989  df-norec 28096  df-norec2 28107  df-adds 28118  df-negs 28179  df-subs 28180  df-muls 28265  df-n0s 28472
This theorem is referenced by:  nnmulscl  28505  eucliddivs  28534  n0expscl  28590  addhalfcut  28617  bdaypw2n0bndlem  28621  bdayfinbndlem1  28625  z12bdaylem2  28629  z12sge0  28641
  Copyright terms: Public domain W3C validator