Theorem mulsunif 27954

Description: Surreal multiplication has the uniformity property. That is, any cuts that define 𝐴 and 𝐵 can be used in the definition of (𝐴 ·_s 𝐵). Theorem 3.5 of [Gonshor] p. 18. (Contributed by Scott Fenton, 7-Mar-2025.)

Hypotheses

Ref	Expression
mulsunif.1	⊢ (𝜑 → 𝐿 <<s 𝑅)
mulsunif.2	⊢ (𝜑 → 𝑀 <<s 𝑆)
mulsunif.3	⊢ (𝜑 → 𝐴 = (𝐿 |s 𝑅))
mulsunif.4	⊢ (𝜑 → 𝐵 = (𝑀 |s 𝑆))

Assertion

Ref	Expression
mulsunif	⊢ (𝜑 → (𝐴 ·s 𝐵) = (({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) |s ({𝑐 ∣ ∃𝑡 ∈ 𝐿 ∃𝑢 ∈ 𝑆 𝑐 = (((𝑡 ·s 𝐵) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ 𝑅 ∃𝑤 ∈ 𝑀 𝑑 = (((𝑣 ·s 𝐵) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))})))

Distinct variable groups:   𝐴,𝑎,𝑝,𝑞   𝐴,𝑏,𝑟,𝑠   𝐴,𝑐,𝑡,𝑢   𝐴,𝑑,𝑣,𝑤   𝐵,𝑎,𝑝,𝑞   𝐵,𝑏,𝑟,𝑠   𝐵,𝑐,𝑡,𝑢   𝐵,𝑑,𝑣,𝑤   𝐿,𝑎,𝑝   𝐿,𝑐,𝑡   𝑀,𝑎,𝑝,𝑞   𝑀,𝑑,𝑣,𝑤   𝑅,𝑏   𝑅,𝑑   𝑅,𝑟   𝑣,𝑅   𝑆,𝑏   𝑆,𝑐   𝑆,𝑟,𝑠   𝑡,𝑆,𝑢

Allowed substitution hints:   𝜑(𝑤,𝑣,𝑢,𝑡,𝑠,𝑟,𝑞,𝑝,𝑎,𝑏,𝑐,𝑑)   𝑅(𝑤,𝑢,𝑡,𝑠,𝑞,𝑝,𝑎,𝑐)   𝑆(𝑤,𝑣,𝑞,𝑝,𝑎,𝑑)   𝐿(𝑤,𝑣,𝑢,𝑠,𝑟,𝑞,𝑏,𝑑)   𝑀(𝑢,𝑡,𝑠,𝑟,𝑏,𝑐)

Proof of Theorem mulsunif

Dummy variables 𝑒 𝑓 𝑔 ℎ 𝑖 𝑗 𝑘 𝑙 𝑚 𝑛 𝑜 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mulsunif.1	. . 3 ⊢ (𝜑 → 𝐿 <<s 𝑅)
2		mulsunif.2	. . 3 ⊢ (𝜑 → 𝑀 <<s 𝑆)
3		mulsunif.3	. . 3 ⊢ (𝜑 → 𝐴 = (𝐿 |s 𝑅))
4		mulsunif.4	. . 3 ⊢ (𝜑 → 𝐵 = (𝑀 |s 𝑆))
5	1, 2, 3, 4	mulsuniflem 27953	. 2 ⊢ (𝜑 → (𝐴 ·s 𝐵) = (({𝑒 ∣ ∃𝑓 ∈ 𝐿 ∃𝑔 ∈ 𝑀 𝑒 = (((𝑓 ·s 𝐵) +s (𝐴 ·s 𝑔)) -s (𝑓 ·s 𝑔))} ∪ {ℎ ∣ ∃𝑖 ∈ 𝑅 ∃𝑗 ∈ 𝑆 ℎ = (((𝑖 ·s 𝐵) +s (𝐴 ·s 𝑗)) -s (𝑖 ·s 𝑗))}) |s ({𝑘 ∣ ∃𝑙 ∈ 𝐿 ∃𝑚 ∈ 𝑆 𝑘 = (((𝑙 ·s 𝐵) +s (𝐴 ·s 𝑚)) -s (𝑙 ·s 𝑚))} ∪ {𝑛 ∣ ∃𝑜 ∈ 𝑅 ∃𝑥 ∈ 𝑀 𝑛 = (((𝑜 ·s 𝐵) +s (𝐴 ·s 𝑥)) -s (𝑜 ·s 𝑥))})))
6		mulsval2lem 27914	. . . 4 ⊢ {𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} = {𝑒 ∣ ∃𝑓 ∈ 𝐿 ∃𝑔 ∈ 𝑀 𝑒 = (((𝑓 ·s 𝐵) +s (𝐴 ·s 𝑔)) -s (𝑓 ·s 𝑔))}
7		mulsval2lem 27914	. . . 4 ⊢ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))} = {ℎ ∣ ∃𝑖 ∈ 𝑅 ∃𝑗 ∈ 𝑆 ℎ = (((𝑖 ·s 𝐵) +s (𝐴 ·s 𝑗)) -s (𝑖 ·s 𝑗))}
8	6, 7	uneq12i 4153	. . 3 ⊢ ({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) = ({𝑒 ∣ ∃𝑓 ∈ 𝐿 ∃𝑔 ∈ 𝑀 𝑒 = (((𝑓 ·s 𝐵) +s (𝐴 ·s 𝑔)) -s (𝑓 ·s 𝑔))} ∪ {ℎ ∣ ∃𝑖 ∈ 𝑅 ∃𝑗 ∈ 𝑆 ℎ = (((𝑖 ·s 𝐵) +s (𝐴 ·s 𝑗)) -s (𝑖 ·s 𝑗))})
9		mulsval2lem 27914	. . . 4 ⊢ {𝑐 ∣ ∃𝑡 ∈ 𝐿 ∃𝑢 ∈ 𝑆 𝑐 = (((𝑡 ·s 𝐵) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} = {𝑘 ∣ ∃𝑙 ∈ 𝐿 ∃𝑚 ∈ 𝑆 𝑘 = (((𝑙 ·s 𝐵) +s (𝐴 ·s 𝑚)) -s (𝑙 ·s 𝑚))}
10		mulsval2lem 27914	. . . 4 ⊢ {𝑑 ∣ ∃𝑣 ∈ 𝑅 ∃𝑤 ∈ 𝑀 𝑑 = (((𝑣 ·s 𝐵) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))} = {𝑛 ∣ ∃𝑜 ∈ 𝑅 ∃𝑥 ∈ 𝑀 𝑛 = (((𝑜 ·s 𝐵) +s (𝐴 ·s 𝑥)) -s (𝑜 ·s 𝑥))}
11	9, 10	uneq12i 4153	. . 3 ⊢ ({𝑐 ∣ ∃𝑡 ∈ 𝐿 ∃𝑢 ∈ 𝑆 𝑐 = (((𝑡 ·s 𝐵) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ 𝑅 ∃𝑤 ∈ 𝑀 𝑑 = (((𝑣 ·s 𝐵) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))}) = ({𝑘 ∣ ∃𝑙 ∈ 𝐿 ∃𝑚 ∈ 𝑆 𝑘 = (((𝑙 ·s 𝐵) +s (𝐴 ·s 𝑚)) -s (𝑙 ·s 𝑚))} ∪ {𝑛 ∣ ∃𝑜 ∈ 𝑅 ∃𝑥 ∈ 𝑀 𝑛 = (((𝑜 ·s 𝐵) +s (𝐴 ·s 𝑥)) -s (𝑜 ·s 𝑥))})
12	8, 11	oveq12i 7413	. 2 ⊢ (({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) |s ({𝑐 ∣ ∃𝑡 ∈ 𝐿 ∃𝑢 ∈ 𝑆 𝑐 = (((𝑡 ·s 𝐵) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ 𝑅 ∃𝑤 ∈ 𝑀 𝑑 = (((𝑣 ·s 𝐵) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))})) = (({𝑒 ∣ ∃𝑓 ∈ 𝐿 ∃𝑔 ∈ 𝑀 𝑒 = (((𝑓 ·s 𝐵) +s (𝐴 ·s 𝑔)) -s (𝑓 ·s 𝑔))} ∪ {ℎ ∣ ∃𝑖 ∈ 𝑅 ∃𝑗 ∈ 𝑆 ℎ = (((𝑖 ·s 𝐵) +s (𝐴 ·s 𝑗)) -s (𝑖 ·s 𝑗))}) |s ({𝑘 ∣ ∃𝑙 ∈ 𝐿 ∃𝑚 ∈ 𝑆 𝑘 = (((𝑙 ·s 𝐵) +s (𝐴 ·s 𝑚)) -s (𝑙 ·s 𝑚))} ∪ {𝑛 ∣ ∃𝑜 ∈ 𝑅 ∃𝑥 ∈ 𝑀 𝑛 = (((𝑜 ·s 𝐵) +s (𝐴 ·s 𝑥)) -s (𝑜 ·s 𝑥))}))
13	5, 12	eqtr4di 2782	1 ⊢ (𝜑 → (𝐴 ·s 𝐵) = (({𝑎 ∣ ∃𝑝 ∈ 𝐿 ∃𝑞 ∈ 𝑀 𝑎 = (((𝑝 ·s 𝐵) +s (𝐴 ·s 𝑞)) -s (𝑝 ·s 𝑞))} ∪ {𝑏 ∣ ∃𝑟 ∈ 𝑅 ∃𝑠 ∈ 𝑆 𝑏 = (((𝑟 ·s 𝐵) +s (𝐴 ·s 𝑠)) -s (𝑟 ·s 𝑠))}) |s ({𝑐 ∣ ∃𝑡 ∈ 𝐿 ∃𝑢 ∈ 𝑆 𝑐 = (((𝑡 ·s 𝐵) +s (𝐴 ·s 𝑢)) -s (𝑡 ·s 𝑢))} ∪ {𝑑 ∣ ∃𝑣 ∈ 𝑅 ∃𝑤 ∈ 𝑀 𝑑 = (((𝑣 ·s 𝐵) +s (𝐴 ·s 𝑤)) -s (𝑣 ·s 𝑤))})))

Syntax hints:   → wi 4   = wceq 1533  {cab 2701  ∃wrex 3062   ∪ cun 3938   class class class wbr 5138  (class class class)co 7401   <<s csslt 27617   |s cscut 27619   +_s cadds 27780   -_s csubs 27837   ·_s cmuls 27910

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695  ax-rep 5275  ax-sep 5289  ax-nul 5296  ax-pow 5353  ax-pr 5417  ax-un 7718

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ne 2933  df-ral 3054  df-rex 3063  df-rmo 3368  df-reu 3369  df-rab 3425  df-v 3468  df-sbc 3770  df-csb 3886  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-pss 3959  df-nul 4315  df-if 4521  df-pw 4596  df-sn 4621  df-pr 4623  df-tp 4625  df-op 4627  df-ot 4629  df-uni 4900  df-int 4941  df-iun 4989  df-br 5139  df-opab 5201  df-mpt 5222  df-tr 5256  df-id 5564  df-eprel 5570  df-po 5578  df-so 5579  df-fr 5621  df-se 5622  df-we 5623  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6290  df-ord 6357  df-on 6358  df-suc 6360  df-iota 6485  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7357  df-ov 7404  df-oprab 7405  df-mpo 7406  df-1st 7968  df-2nd 7969  df-frecs 8261  df-wrecs 8292  df-recs 8366  df-1o 8461  df-2o 8462  df-nadd 8660  df-no 27480  df-slt 27481  df-bday 27482  df-sle 27582  df-sslt 27618  df-scut 27620  df-0s 27661  df-made 27678  df-old 27679  df-left 27681  df-right 27682  df-norec 27759  df-norec2 27770  df-adds 27781  df-negs 27838  df-subs 27839  df-muls 27911

This theorem is referenced by:  addsdilem1  27955  mulsasslem1  27967  mulsasslem2  27968  mulsunif2lem  27973  precsexlem11  28019