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

Theorem n0mulscl 28435
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 7404 . . . . 5 (𝑛 = 0s → (𝐴 ·s 𝑛) = (𝐴 ·s 0s ))
21eleq1d 2847 . . . 4 (𝑛 = 0s → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 0s ) ∈ ℕ0s))
32imbi2d 342 . . 3 (𝑛 = 0s → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) ∈ ℕ0s)))
4 oveq2 7404 . . . . 5 (𝑛 = 𝑚 → (𝐴 ·s 𝑛) = (𝐴 ·s 𝑚))
54eleq1d 2847 . . . 4 (𝑛 = 𝑚 → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 𝑚) ∈ ℕ0s))
65imbi2d 342 . . 3 (𝑛 = 𝑚 → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 𝑚) ∈ ℕ0s)))
7 oveq2 7404 . . . . 5 (𝑛 = (𝑚 +s 1s ) → (𝐴 ·s 𝑛) = (𝐴 ·s (𝑚 +s 1s )))
87eleq1d 2847 . . . 4 (𝑛 = (𝑚 +s 1s ) → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s))
98imbi2d 342 . . 3 (𝑛 = (𝑚 +s 1s ) → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)))
10 oveq2 7404 . . . . 5 (𝑛 = 𝐵 → (𝐴 ·s 𝑛) = (𝐴 ·s 𝐵))
1110eleq1d 2847 . . . 4 (𝑛 = 𝐵 → ((𝐴 ·s 𝑛) ∈ ℕ0s ↔ (𝐴 ·s 𝐵) ∈ ℕ0s))
1211imbi2d 342 . . 3 (𝑛 = 𝐵 → ((𝐴 ∈ ℕ0s → (𝐴 ·s 𝑛) ∈ ℕ0s) ↔ (𝐴 ∈ ℕ0s → (𝐴 ·s 𝐵) ∈ ℕ0s)))
13 n0no 28413 . . . . 5 (𝐴 ∈ ℕ0s𝐴 No )
14 muls01 28202 . . . . 5 (𝐴 No → (𝐴 ·s 0s ) = 0s )
1513, 14syl 17 . . . 4 (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) = 0s )
16 0n0s 28419 . . . 4 0s ∈ ℕ0s
1715, 16eqeltrdi 2870 . . 3 (𝐴 ∈ ℕ0s → (𝐴 ·s 0s ) ∈ ℕ0s)
1813ad2antrr 736 . . . . . . . . 9 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 𝐴 No )
19 n0no 28413 . . . . . . . . . 10 (𝑚 ∈ ℕ0s𝑚 No )
2019ad2antlr 737 . . . . . . . . 9 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 𝑚 No )
21 1no 27900 . . . . . . . . . 10 1s No
2221a1i 11 . . . . . . . . 9 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → 1s No )
2318, 20, 22addsdid 28246 . . . . . . . 8 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) = ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )))
2413mulsridd 28204 . . . . . . . . . 10 (𝐴 ∈ ℕ0s → (𝐴 ·s 1s ) = 𝐴)
2524oveq2d 7412 . . . . . . . . 9 (𝐴 ∈ ℕ0s → ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
2625ad2antrr 736 . . . . . . . 8 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s (𝐴 ·s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
2723, 26eqtrd 2797 . . . . . . 7 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) = ((𝐴 ·s 𝑚) +s 𝐴))
28 n0addscl 28434 . . . . . . . . 9 (((𝐴 ·s 𝑚) ∈ ℕ0s𝐴 ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
2928ancoms 462 . . . . . . . 8 ((𝐴 ∈ ℕ0s ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
3029adantlr 725 . . . . . . 7 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → ((𝐴 ·s 𝑚) +s 𝐴) ∈ ℕ0s)
3127, 30eqeltrd 2862 . . . . . 6 (((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) ∧ (𝐴 ·s 𝑚) ∈ ℕ0s) → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s)
3231ex 416 . . . . 5 ((𝐴 ∈ ℕ0s𝑚 ∈ ℕ0s) → ((𝐴 ·s 𝑚) ∈ ℕ0s → (𝐴 ·s (𝑚 +s 1s )) ∈ ℕ0s))
3332expcom 417 . . . 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 28423 . 2 (𝐵 ∈ ℕ0s → (𝐴 ∈ ℕ0s → (𝐴 ·s 𝐵) ∈ ℕ0s))
3635impcom 411 1 ((𝐴 ∈ ℕ0s𝐵 ∈ ℕ0s) → (𝐴 ·s 𝐵) ∈ ℕ0s)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1560  wcel 2142  (class class class)co 7396   No csur 27701   0s c0s 27895   1s c1s 27896   +s cadds 28049   ·s cmuls 28196  0scn0s 28402
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-ot 4591  df-uni 4866  df-int 4906  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-se 5601  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-1o 8437  df-2o 8438  df-nadd 8636  df-no 27704  df-lts 27705  df-bday 27706  df-les 27806  df-slts 27848  df-cuts 27850  df-0s 27897  df-1s 27898  df-made 27917  df-old 27918  df-left 27920  df-right 27921  df-norec 28028  df-norec2 28039  df-adds 28050  df-negs 28111  df-subs 28112  df-muls 28197  df-n0s 28404
This theorem is referenced by:  nnmulscl  28437  eucliddivs  28466  n0expscl  28522  addhalfcut  28549  bdaypw2n0bndlem  28553  bdayfinbndlem1  28557  z12bdaylem2  28561  z12sge0  28573
  Copyright terms: Public domain W3C validator