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

Theorem muls01 28015
Description: Surreal multiplication by zero. (Contributed by Scott Fenton, 4-Feb-2025.)
Assertion
Ref Expression
muls01 (𝐴 No → (𝐴 ·s 0s ) = 0s )

Proof of Theorem muls01
Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑝 𝑞 𝑟 𝑠 𝑡 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0sno 27738 . . 3 0s No
2 mulsval 28012 . . 3 ((𝐴 No ∧ 0s No ) → (𝐴 ·s 0s ) = (({𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) |s ({𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))})))
31, 2mpan2 691 . 2 (𝐴 No → (𝐴 ·s 0s ) = (({𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) |s ({𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))})))
4 rex0 4323 . . . . . . . . . 10 ¬ ∃𝑞 ∈ ∅ 𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))
5 left0s 27804 . . . . . . . . . . 11 ( L ‘ 0s ) = ∅
65rexeqi 3298 . . . . . . . . . 10 (∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞)) ↔ ∃𝑞 ∈ ∅ 𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞)))
74, 6mtbir 323 . . . . . . . . 9 ¬ ∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))
87a1i 11 . . . . . . . 8 (𝑝 ∈ ( L ‘𝐴) → ¬ ∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞)))
98nrex 3057 . . . . . . 7 ¬ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))
109abf 4369 . . . . . 6 {𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} = ∅
11 rex0 4323 . . . . . . . . . 10 ¬ ∃𝑠 ∈ ∅ 𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))
12 right0s 27805 . . . . . . . . . . 11 ( R ‘ 0s ) = ∅
1312rexeqi 3298 . . . . . . . . . 10 (∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠)) ↔ ∃𝑠 ∈ ∅ 𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠)))
1411, 13mtbir 323 . . . . . . . . 9 ¬ ∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))
1514a1i 11 . . . . . . . 8 (𝑟 ∈ ( R ‘𝐴) → ¬ ∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠)))
1615nrex 3057 . . . . . . 7 ¬ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))
1716abf 4369 . . . . . 6 {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))} = ∅
1810, 17uneq12i 4129 . . . . 5 ({𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) = (∅ ∪ ∅)
19 un0 4357 . . . . 5 (∅ ∪ ∅) = ∅
2018, 19eqtri 2752 . . . 4 ({𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) = ∅
21 rex0 4323 . . . . . . . . . 10 ¬ ∃𝑢 ∈ ∅ 𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))
2212rexeqi 3298 . . . . . . . . . 10 (∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢)) ↔ ∃𝑢 ∈ ∅ 𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢)))
2321, 22mtbir 323 . . . . . . . . 9 ¬ ∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))
2423a1i 11 . . . . . . . 8 (𝑡 ∈ ( L ‘𝐴) → ¬ ∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢)))
2524nrex 3057 . . . . . . 7 ¬ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))
2625abf 4369 . . . . . 6 {𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} = ∅
27 rex0 4323 . . . . . . . . . 10 ¬ ∃𝑤 ∈ ∅ 𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))
285rexeqi 3298 . . . . . . . . . 10 (∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤)) ↔ ∃𝑤 ∈ ∅ 𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤)))
2927, 28mtbir 323 . . . . . . . . 9 ¬ ∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))
3029a1i 11 . . . . . . . 8 (𝑣 ∈ ( R ‘𝐴) → ¬ ∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤)))
3130nrex 3057 . . . . . . 7 ¬ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))
3231abf 4369 . . . . . 6 {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))} = ∅
3326, 32uneq12i 4129 . . . . 5 ({𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))}) = (∅ ∪ ∅)
3433, 19eqtri 2752 . . . 4 ({𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))}) = ∅
3520, 34oveq12i 7399 . . 3 (({𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) |s ({𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))})) = (∅ |s ∅)
36 df-0s 27736 . . 3 0s = (∅ |s ∅)
3735, 36eqtr4i 2755 . 2 (({𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) |s ({𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))})) = 0s
383, 37eqtrdi 2780 1 (𝐴 No → (𝐴 ·s 0s ) = 0s )
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1540  wcel 2109  {cab 2707  wrex 3053  cun 3912  c0 4296  cfv 6511  (class class class)co 7387   No csur 27551   |s cscut 27694   0s c0s 27734   L cleft 27753   R cright 27754   +s cadds 27866   -s csubs 27926   ·s cmuls 28009
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-se 5592  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-1o 8434  df-2o 8435  df-no 27554  df-slt 27555  df-bday 27556  df-sslt 27693  df-scut 27695  df-0s 27736  df-made 27755  df-old 27756  df-left 27758  df-right 27759  df-norec2 27856  df-muls 28010
This theorem is referenced by:  mulsrid  28016  muls02  28044  mulsgt0  28047  mulsge0d  28049  slemul1ad  28085  muls0ord  28088  precsexlem9  28117  precsexlem11  28119  n0mulscl  28237  eucliddivs  28265  n0seo  28307  pw2gt0divsd  28328  pw2ge0divsd  28329  pw2divsnegd  28332
  Copyright terms: Public domain W3C validator