Theorem muls01 28377

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.

Step	Hyp	Ref	Expression
1		0no 28074	. . 3 ⊢ 0s ∈ No
2		mulsval 28374	. . 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 𝑤))})))
3	1, 2	mpan2 704	. 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 4308	. . . . . . . . . 10 ⊢ ¬ ∃𝑞 ∈ ∅ 𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))
5		left0s 28158	. . . . . . . . . . 11 ⊢ ( L ‘ 0s ) = ∅
6	5	rexeqi 3318	. . . . . . . . . 10 ⊢ (∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞)) ↔ ∃𝑞 ∈ ∅ 𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞)))
7	4, 6	mtbir 326	. . . . . . . . 9 ⊢ ¬ ∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))
8	7	a1i 11	. . . . . . . 8 ⊢ (𝑝 ∈ ( L ‘𝐴) → ¬ ∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞)))
9	8	nrex 3090	. . . . . . 7 ⊢ ¬ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))
10	9	abf 4364	. . . . . 6 ⊢ {𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} = ∅
11		rex0 4308	. . . . . . . . . 10 ⊢ ¬ ∃𝑠 ∈ ∅ 𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))
12		right0s 28159	. . . . . . . . . . 11 ⊢ ( R ‘ 0s ) = ∅
13	12	rexeqi 3318	. . . . . . . . . 10 ⊢ (∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠)) ↔ ∃𝑠 ∈ ∅ 𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠)))
14	11, 13	mtbir 326	. . . . . . . . 9 ⊢ ¬ ∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))
15	14	a1i 11	. . . . . . . 8 ⊢ (𝑟 ∈ ( R ‘𝐴) → ¬ ∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠)))
16	15	nrex 3090	. . . . . . 7 ⊢ ¬ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))
17	16	abf 4364	. . . . . 6 ⊢ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))} = ∅
18	10, 17	uneq12i 4113	. . . . 5 ⊢ ({𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) = (∅ ∪ ∅)
19		un0 4344	. . . . 5 ⊢ (∅ ∪ ∅) = ∅
20	18, 19	eqtri 2783	. . . 4 ⊢ ({𝑎 ∣ ∃𝑝 ∈ ( L ‘𝐴)∃𝑞 ∈ ( L ‘ 0s )𝑎 = (((𝑝 ·s 0s ) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ ( R ‘𝐴)∃𝑠 ∈ ( R ‘ 0s )𝑏 = (((𝑟 ·s 0s ) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) = ∅
21		rex0 4308	. . . . . . . . . 10 ⊢ ¬ ∃𝑢 ∈ ∅ 𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))
22	12	rexeqi 3318	. . . . . . . . . 10 ⊢ (∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢)) ↔ ∃𝑢 ∈ ∅ 𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢)))
23	21, 22	mtbir 326	. . . . . . . . 9 ⊢ ¬ ∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))
24	23	a1i 11	. . . . . . . 8 ⊢ (𝑡 ∈ ( L ‘𝐴) → ¬ ∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢)))
25	24	nrex 3090	. . . . . . 7 ⊢ ¬ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))
26	25	abf 4364	. . . . . 6 ⊢ {𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} = ∅
27		rex0 4308	. . . . . . . . . 10 ⊢ ¬ ∃𝑤 ∈ ∅ 𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))
28	5	rexeqi 3318	. . . . . . . . . 10 ⊢ (∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤)) ↔ ∃𝑤 ∈ ∅ 𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤)))
29	27, 28	mtbir 326	. . . . . . . . 9 ⊢ ¬ ∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))
30	29	a1i 11	. . . . . . . 8 ⊢ (𝑣 ∈ ( R ‘𝐴) → ¬ ∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤)))
31	30	nrex 3090	. . . . . . 7 ⊢ ¬ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))
32	31	abf 4364	. . . . . 6 ⊢ {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))} = ∅
33	26, 32	uneq12i 4113	. . . . 5 ⊢ ({𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))}) = (∅ ∪ ∅)
34	33, 19	eqtri 2783	. . . 4 ⊢ ({𝑐 ∣ ∃𝑡 ∈ ( L ‘𝐴)∃𝑢 ∈ ( R ‘ 0s )𝑐 = (((𝑡 ·s 0s ) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ ( R ‘𝐴)∃𝑤 ∈ ( L ‘ 0s )𝑑 = (((𝑣 ·s 0s ) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))}) = ∅
35	20, 34	oveq12i 7425	. . 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 28072	. . 3 ⊢ 0s = (∅ |s ∅)
37	35, 36	eqtr4i 2786	. 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
38	3, 37	eqtrdi 2811	1 ⊢ (𝐴 ∈ No → (𝐴 ·s 0s ) = 0s )

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2145  {cab 2738  ∃wrex 3086   ∪ cun 3897  ∅c0 4279  ‘cfv 6533  (class class class)co 7413   No csur 27876   |s ccuts 28024   0_s c0s 28070   L cleft 28090   R cright 28091   +_s cadds 28224   -_s csubs 28285   ·_s cmuls 28371

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-1o 8455  df-2o 8456  df-no 27879  df-lts 27880  df-bday 27881  df-slts 28023  df-cuts 28025  df-0s 28072  df-made 28092  df-old 28093  df-left 28095  df-right 28096  df-norec2 28214  df-muls 28372

This theorem is used by:  mulsrid  28378  muls02  28406  mulsgt0  28409  mulsge0d  28411  lemuls1ad  28447  muls0ord  28450  precsexlem9  28480  precsexlem11  28482  n0mulscl  28610  eucliddivs  28641  n0seo  28686  pw2gt0divsd  28710  pw2ge0divsd  28711  pw2divsnegd  28714  pw2divs0d  28720  z12bdaylem1  28735