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

Theorem muls01 28052
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 27771 . . 3 0s No
2 mulsval 28049 . . 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 4310 . . . . . . . . . 10 ¬ ∃𝑞 ∈ ∅ 𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))
5 left0s 27839 . . . . . . . . . . 11 ( L ‘ 0s ) = ∅
65rexeqi 3291 . . . . . . . . . 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 3060 . . . . . . 7 ¬ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))
109abf 4356 . . . . . 6 {𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} = ∅
11 rex0 4310 . . . . . . . . . 10 ¬ ∃𝑠 ∈ ∅ 𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))
12 right0s 27840 . . . . . . . . . . 11 ( R ‘ 0s ) = ∅
1312rexeqi 3291 . . . . . . . . . 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 3060 . . . . . . 7 ¬ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))
1716abf 4356 . . . . . 6 {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))} = ∅
1810, 17uneq12i 4116 . . . . 5 ({𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) = (∅ ∪ ∅)
19 un0 4344 . . . . 5 (∅ ∪ ∅) = ∅
2018, 19eqtri 2754 . . . 4 ({𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) = ∅
21 rex0 4310 . . . . . . . . . 10 ¬ ∃𝑢 ∈ ∅ 𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))
2212rexeqi 3291 . . . . . . . . . 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 3060 . . . . . . 7 ¬ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))
2625abf 4356 . . . . . 6 {𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} = ∅
27 rex0 4310 . . . . . . . . . 10 ¬ ∃𝑤 ∈ ∅ 𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))
285rexeqi 3291 . . . . . . . . . 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 3060 . . . . . . 7 ¬ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))
3231abf 4356 . . . . . 6 {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))} = ∅
3326, 32uneq12i 4116 . . . . 5 ({𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))}) = (∅ ∪ ∅)
3433, 19eqtri 2754 . . . 4 ({𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))}) = ∅
3520, 34oveq12i 7358 . . 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 27769 . . 3 0s = (∅ |s ∅)
3735, 36eqtr4i 2757 . 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 2782 1 (𝐴 No → (𝐴 ·s 0s ) = 0s )
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1541  wcel 2111  {cab 2709  wrex 3056  cun 3900  c0 4283  cfv 6481  (class class class)co 7346   No csur 27579   |s cscut 27723   0s c0s 27767   L cleft 27787   R cright 27788   +s cadds 27903   -s csubs 27963   ·s cmuls 28046
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-tp 4581  df-op 4583  df-uni 4860  df-int 4898  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-se 5570  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-1st 7921  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-1o 8385  df-2o 8386  df-no 27582  df-slt 27583  df-bday 27584  df-sslt 27722  df-scut 27724  df-0s 27769  df-made 27789  df-old 27790  df-left 27792  df-right 27793  df-norec2 27893  df-muls 28047
This theorem is referenced by:  mulsrid  28053  muls02  28081  mulsgt0  28084  mulsge0d  28086  slemul1ad  28122  muls0ord  28125  precsexlem9  28154  precsexlem11  28156  n0mulscl  28274  eucliddivs  28302  n0seo  28345  pw2gt0divsd  28369  pw2ge0divsd  28370  pw2divsnegd  28373
  Copyright terms: Public domain W3C validator