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

Theorem n0mulscl 28353
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 7376 . . . . 5 (𝑛 = 0s → (𝐴 ·s 𝑛) = (𝐴 ·s 0s ))
21eleq1d 2822 . . . 4 (𝑛 = 0s → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 0s ) ∈ ℕ0s))
32imbi2d 340 . . 3 (𝑛 = 0s → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) ∈ ℕ0s)))
4 oveq2 7376 . . . . 5 (𝑛 = 𝑚 → (𝐴 ·s 𝑛) = (𝐴 ·s 𝑚))
54eleq1d 2822 . . . 4 (𝑛 = 𝑚 → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 𝑚) ∈ ℕ0s))
65imbi2d 340 . . 3 (𝑛 = 𝑚 → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 𝑚) ∈ ℕ0s)))
7 oveq2 7376 . . . . 5 (𝑛 = (𝑚 +s 1s ) → (𝐴 ·s 𝑛) = (𝐴 ·s (𝑚 +s 1s )))
87eleq1d 2822 . . . 4 (𝑛 = (𝑚 +s 1s ) → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s))
98imbi2d 340 . . 3 (𝑛 = (𝑚 +s 1s ) → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)))
10 oveq2 7376 . . . . 5 (𝑛 = 𝐵 → (𝐴 ·s 𝑛) = (𝐴 ·s 𝐵))
1110eleq1d 2822 . . . 4 (𝑛 = 𝐵 → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 𝐵) ∈ ℕ0s))
1211imbi2d 340 . . 3 (𝑛 = 𝐵 → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 𝐵) ∈ ℕ0s)))
13 n0no 28331 . . . . 5 (𝐴 ∈ ℕ0s𝐴 No )
14 muls01 28120 . . . . 5 (𝐴 No → (𝐴 ·s 0s ) = 0s )
1513, 14syl 17 . . . 4 (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) = 0s )
16 0n0s 28337 . . . 4 0s ∈ ℕ0s
1715, 16eqeltrdi 2845 . . 3 (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) ∈ ℕ0s)
1813ad2antrr 727 . . . . . . . . 9 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 𝐴 No )
19 n0no 28331 . . . . . . . . . 10 (𝑚 ∈ ℕ0s𝑚 No )
2019ad2antlr 728 . . . . . . . . 9 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 𝑚 No )
21 1no 27818 . . . . . . . . . 10 1s No
2221a1i 11 . . . . . . . . 9 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 1s No )
2318, 20, 22addsdid 28164 . . . . . . . 8 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) = ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )))
2413mulsridd 28122 . . . . . . . . . 10 (𝐴 ∈ ℕ0s → (𝐴 ·s 1s ) = 𝐴)
2524oveq2d 7384 . . . . . . . . 9 (𝐴 ∈ ℕ0s → ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
2625ad2antrr 727 . . . . . . . 8 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
2723, 26eqtrd 2772 . . . . . . 7 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
28 n0addscl 28352 . . . . . . . . 9 (((𝐴 ·s 𝑚) ∈ ℕ0s𝐴 ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
2928ancoms 458 . . . . . . . 8 ((𝐴 ∈ ℕ0s ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
3029adantlr 716 . . . . . . 7 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
3127, 30eqeltrd 2837 . . . . . 6 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)
3231ex 412 . . . . 5 ((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) → ((𝐴 ·s 𝑚) ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s))
3332expcom 413 . . . 4 (𝑚 ∈ ℕ0s → (𝐴 ∈ ℕ0s → ((𝐴 ·s 𝑚) ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)))
3433a2d 29 . . 3 (𝑚 ∈ ℕ0s → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)))
353, 6, 9, 12, 17, 34n0sind 28341 . 2 (𝐵 ∈ ℕ0s → (𝐴 ∈ ℕ0s → (𝐴 ·s 𝐵) ∈ ℕ0s))
3635impcom 407 1 ((𝐴 ∈ ℕ0s𝐵 ∈ ℕ0s) → (𝐴 ·s 𝐵) ∈ ℕ0s)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  (class class class)co 7368   No csur 27619   0s c0s 27813   1s c1s 27814   +s cadds 27967   ·s cmuls 28114  0scn0s 28320
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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-ot 4591  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-2o 8408  df-nadd 8604  df-no 27622  df-lts 27623  df-bday 27624  df-les 27725  df-slts 27766  df-cuts 27768  df-0s 27815  df-1s 27816  df-made 27835  df-old 27836  df-left 27838  df-right 27839  df-norec 27946  df-norec2 27957  df-adds 27968  df-negs 28029  df-subs 28030  df-muls 28115  df-n0s 28322
This theorem is referenced by:  nnmulscl  28355  eucliddivs  28384  n0expscl  28440  addhalfcut  28467  bdaypw2n0bndlem  28471  bdayfinbndlem1  28475  z12bdaylem2  28479  z12sge0  28491
  Copyright terms: Public domain W3C validator