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

Theorem onmulscl 28284
Description: The surreal ordinals are closed under multiplication. (Contributed by Scott Fenton, 22-Aug-2025.)
Assertion
Ref Expression
onmulscl ((𝐴 ∈ Ons𝐵 ∈ Ons) → (𝐴 ·s 𝐵) ∈ Ons)

Proof of Theorem onmulscl
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6847 . . . 4 ( L ‘𝐴) ∈ V
2 fvex 6847 . . . 4 ( L ‘𝐵) ∈ V
31, 2ab2rexex 7925 . . 3 {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∈ V
43a1i 11 . 2 ((𝐴 ∈ Ons𝐵 ∈ Ons) → {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∈ V)
5 leftno 27883 . . . . . . . . . 10 (𝑦 ∈ ( L ‘𝐴) → 𝑦 No )
65adantr 480 . . . . . . . . 9 ((𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵)) → 𝑦 No )
76adantl 481 . . . . . . . 8 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ (𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵))) → 𝑦 No )
8 onno 28261 . . . . . . . . . 10 (𝐵 ∈ Ons𝐵 No )
98adantl 481 . . . . . . . . 9 ((𝐴 ∈ Ons𝐵 ∈ Ons) → 𝐵 No )
109adantr 480 . . . . . . . 8 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ (𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵))) → 𝐵 No )
117, 10mulscld 28141 . . . . . . 7 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ (𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵))) → (𝑦 ·s 𝐵) ∈ No )
12 onno 28261 . . . . . . . . . 10 (𝐴 ∈ Ons𝐴 No )
1312adantr 480 . . . . . . . . 9 ((𝐴 ∈ Ons𝐵 ∈ Ons) → 𝐴 No )
1413adantr 480 . . . . . . . 8 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ (𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵))) → 𝐴 No )
15 leftno 27883 . . . . . . . . . 10 (𝑧 ∈ ( L ‘𝐵) → 𝑧 No )
1615adantl 481 . . . . . . . . 9 ((𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵)) → 𝑧 No )
1716adantl 481 . . . . . . . 8 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ (𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵))) → 𝑧 No )
1814, 17mulscld 28141 . . . . . . 7 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ (𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵))) → (𝐴 ·s 𝑧) ∈ No )
1911, 18addscld 27986 . . . . . 6 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ (𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵))) → ((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) ∈ No )
207, 17mulscld 28141 . . . . . 6 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ (𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵))) → (𝑦 ·s 𝑧) ∈ No )
2119, 20subscld 28069 . . . . 5 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ (𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵))) → (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧)) ∈ No )
22 eleq1 2825 . . . . 5 (𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧)) → (𝑥 No ↔ (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧)) ∈ No ))
2321, 22syl5ibrcom 247 . . . 4 (((𝐴 ∈ Ons𝐵 ∈ Ons) ∧ (𝑦 ∈ ( L ‘𝐴) ∧ 𝑧 ∈ ( L ‘𝐵))) → (𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧)) → 𝑥 No ))
2423rexlimdvva 3195 . . 3 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧)) → 𝑥 No ))
2524abssdv 4008 . 2 ((𝐴 ∈ Ons𝐵 ∈ Ons) → {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ⊆ No )
26 leftssno 27879 . . . . . 6 ( L ‘𝐴) ⊆ No
271elpw 4546 . . . . . 6 (( L ‘𝐴) ∈ 𝒫 No ↔ ( L ‘𝐴) ⊆ No )
2826, 27mpbir 231 . . . . 5 ( L ‘𝐴) ∈ 𝒫 No
29 nulsgts 27782 . . . . 5 (( L ‘𝐴) ∈ 𝒫 No → ( L ‘𝐴) <<s ∅)
3028, 29mp1i 13 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → ( L ‘𝐴) <<s ∅)
31 leftssno 27879 . . . . . 6 ( L ‘𝐵) ⊆ No
322elpw 4546 . . . . . 6 (( L ‘𝐵) ∈ 𝒫 No ↔ ( L ‘𝐵) ⊆ No )
3331, 32mpbir 231 . . . . 5 ( L ‘𝐵) ∈ 𝒫 No
34 nulsgts 27782 . . . . 5 (( L ‘𝐵) ∈ 𝒫 No → ( L ‘𝐵) <<s ∅)
3533, 34mp1i 13 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → ( L ‘𝐵) <<s ∅)
36 oncutleft 28269 . . . . 5 (𝐴 ∈ Ons𝐴 = (( L ‘𝐴) |s ∅))
3736adantr 480 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → 𝐴 = (( L ‘𝐴) |s ∅))
38 oncutleft 28269 . . . . 5 (𝐵 ∈ Ons𝐵 = (( L ‘𝐵) |s ∅))
3938adantl 481 . . . 4 ((𝐴 ∈ Ons𝐵 ∈ Ons) → 𝐵 = (( L ‘𝐵) |s ∅))
4030, 35, 37, 39mulsunif 28156 . . 3 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (𝐴 ·s 𝐵) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))}) |s ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))})))
41 rex0 4301 . . . . . . 7 ¬ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))
4241abf 4347 . . . . . 6 {𝑥 ∣ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} = ∅
4342uneq2i 4106 . . . . 5 ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))}) = ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∪ ∅)
44 un0 4335 . . . . 5 ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∪ ∅) = {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))}
4543, 44eqtri 2760 . . . 4 ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))}) = {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))}
46 rex0 4301 . . . . . . . . 9 ¬ ∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))
4746a1i 11 . . . . . . . 8 (𝑦 ∈ ( L ‘𝐴) → ¬ ∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧)))
4847nrex 3066 . . . . . . 7 ¬ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))
4948abf 4347 . . . . . 6 {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} = ∅
50 rex0 4301 . . . . . . 7 ¬ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))
5150abf 4347 . . . . . 6 {𝑥 ∣ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} = ∅
5249, 51uneq12i 4107 . . . . 5 ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))}) = (∅ ∪ ∅)
53 un0 4335 . . . . 5 (∅ ∪ ∅) = ∅
5452, 53eqtri 2760 . . . 4 ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))}) = ∅
5545, 54oveq12i 7372 . . 3 (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))}) |s ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ∅ 𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} ∪ {𝑥 ∣ ∃𝑦 ∈ ∅ ∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))})) = ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} |s ∅)
5640, 55eqtrdi 2788 . 2 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (𝐴 ·s 𝐵) = ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝐴)∃𝑧 ∈ ( L ‘𝐵)𝑥 = (((𝑦 ·s 𝐵) +s (𝐴 ·s 𝑧)) -s (𝑦 ·s 𝑧))} |s ∅))
574, 25, 56elons2d 28265 1 ((𝐴 ∈ Ons𝐵 ∈ Ons) → (𝐴 ·s 𝐵) ∈ Ons)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1542  wcel 2114  {cab 2715  wrex 3062  Vcvv 3430  cun 3888  wss 3890  c0 4274  𝒫 cpw 4542   class class class wbr 5086  cfv 6492  (class class class)co 7360   No csur 27617   <<s cslts 27763   |s ccuts 27765   L cleft 27831   +s cadds 27965   -s csubs 28026   ·s cmuls 28112  Onscons 28257
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 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
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 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-ot 4577  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-1o 8398  df-2o 8399  df-nadd 8595  df-no 27620  df-lts 27621  df-bday 27622  df-les 27723  df-slts 27764  df-cuts 27766  df-0s 27813  df-made 27833  df-old 27834  df-left 27836  df-right 27837  df-norec 27944  df-norec2 27955  df-adds 27966  df-negs 28027  df-subs 28028  df-muls 28113  df-ons 28258
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator