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

Theorem mulsunif2 28435
Description: Alternate expression for surreal multiplication. Note from [Conway] p. 19. (Contributed by Scott Fenton, 16-Mar-2025.)
Hypotheses
Ref Expression
mulsunif2.1 (𝜑𝐿 <<s 𝑅)
mulsunif2.2 (𝜑𝑀 <<s 𝑆)
mulsunif2.3 (𝜑𝐴 = (𝐿 |s 𝑅))
mulsunif2.4 (𝜑𝐵 = (𝑀 |s 𝑆))
Assertion
Ref Expression
mulsunif2 (𝜑 → (𝐴 ·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 mulsunif2
Dummy variables 𝑒 𝑓 𝑔 𝑖 𝑗 𝑘 𝑙 𝑚 𝑛 𝑜 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mulsunif2.1 . . 3 (𝜑𝐿 <<s 𝑅)
2 mulsunif2.2 . . 3 (𝜑𝑀 <<s 𝑆)
3 mulsunif2.3 . . 3 (𝜑𝐴 = (𝐿 |s 𝑅))
4 mulsunif2.4 . . 3 (𝜑𝐵 = (𝑀 |s 𝑆))
51, 2, 3, 4mulsunif2lem 28434 . 2 (𝜑 → (𝐴 ·s 𝐵) = (({𝑒 ∣ ∃𝑖𝐿𝑗𝑀 𝑒 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗)))} ∪ {𝑓 ∣ ∃𝑘𝑅𝑙𝑆 𝑓 = ((𝐴 ·s 𝐵) -s ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵)))}) |s ({𝑔 ∣ ∃𝑚𝐿𝑛𝑆 𝑔 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵)))} ∪ { ∣ ∃𝑜𝑅𝑥𝑀 = ((𝐴 ·s 𝐵) +s ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥)))})))
6 eqeq1 2764 . . . . . . 7 (𝑒 = 𝑎 → (𝑒 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗))) ↔ 𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗)))))
762rexbidv 3227 . . . . . 6 (𝑒 = 𝑎 → (∃𝑖𝐿𝑗𝑀 𝑒 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗))) ↔ ∃𝑖𝐿𝑗𝑀 𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗)))))
8 oveq2 7421 . . . . . . . . . 10 (𝑖 = 𝑝 → (𝐴 -s 𝑖) = (𝐴 -s 𝑝))
98oveq1d 7428 . . . . . . . . 9 (𝑖 = 𝑝 → ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗)) = ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑗)))
109oveq2d 7429 . . . . . . . 8 (𝑖 = 𝑝 → ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗))) = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑗))))
1110eqeq2d 2771 . . . . . . 7 (𝑖 = 𝑝 → (𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗))) ↔ 𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑗)))))
12 oveq2 7421 . . . . . . . . . 10 (𝑗 = 𝑞 → (𝐵 -s 𝑗) = (𝐵 -s 𝑞))
1312oveq2d 7429 . . . . . . . . 9 (𝑗 = 𝑞 → ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑗)) = ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑞)))
1413oveq2d 7429 . . . . . . . 8 (𝑗 = 𝑞 → ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑗))) = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑞))))
1514eqeq2d 2771 . . . . . . 7 (𝑗 = 𝑞 → (𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑗))) ↔ 𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑞)))))
1611, 15cbvrex2vw 3245 . . . . . 6 (∃𝑖𝐿𝑗𝑀 𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗))) ↔ ∃𝑝𝐿𝑞𝑀 𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑞))))
177, 16bitrdi 290 . . . . 5 (𝑒 = 𝑎 → (∃𝑖𝐿𝑗𝑀 𝑒 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗))) ↔ ∃𝑝𝐿𝑞𝑀 𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑞)))))
1817cbvabv 2830 . . . 4 {𝑒 ∣ ∃𝑖𝐿𝑗𝑀 𝑒 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗)))} = {𝑎 ∣ ∃𝑝𝐿𝑞𝑀 𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑞)))}
19 eqeq1 2764 . . . . . . 7 (𝑓 = 𝑏 → (𝑓 = ((𝐴 ·s 𝐵) -s ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵))) ↔ 𝑏 = ((𝐴 ·s 𝐵) -s ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵)))))
20192rexbidv 3227 . . . . . 6 (𝑓 = 𝑏 → (∃𝑘𝑅𝑙𝑆 𝑓 = ((𝐴 ·s 𝐵) -s ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵))) ↔ ∃𝑘𝑅𝑙𝑆 𝑏 = ((𝐴 ·s 𝐵) -s ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵)))))
21 oveq1 7420 . . . . . . . . . 10 (𝑘 = 𝑟 → (𝑘 -s 𝐴) = (𝑟 -s 𝐴))
2221oveq1d 7428 . . . . . . . . 9 (𝑘 = 𝑟 → ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵)) = ((𝑟 -s 𝐴) ·s (𝑙 -s 𝐵)))
2322oveq2d 7429 . . . . . . . 8 (𝑘 = 𝑟 → ((𝐴 ·s 𝐵) -s ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵))) = ((𝐴 ·s 𝐵) -s ((𝑟 -s 𝐴) ·s (𝑙 -s 𝐵))))
2423eqeq2d 2771 . . . . . . 7 (𝑘 = 𝑟 → (𝑏 = ((𝐴 ·s 𝐵) -s ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵))) ↔ 𝑏 = ((𝐴 ·s 𝐵) -s ((𝑟 -s 𝐴) ·s (𝑙 -s 𝐵)))))
25 oveq1 7420 . . . . . . . . . 10 (𝑙 = 𝑠 → (𝑙 -s 𝐵) = (𝑠 -s 𝐵))
2625oveq2d 7429 . . . . . . . . 9 (𝑙 = 𝑠 → ((𝑟 -s 𝐴) ·s (𝑙 -s 𝐵)) = ((𝑟 -s 𝐴) ·s (𝑠 -s 𝐵)))
2726oveq2d 7429 . . . . . . . 8 (𝑙 = 𝑠 → ((𝐴 ·s 𝐵) -s ((𝑟 -s 𝐴) ·s (𝑙 -s 𝐵))) = ((𝐴 ·s 𝐵) -s ((𝑟 -s 𝐴) ·s (𝑠 -s 𝐵))))
2827eqeq2d 2771 . . . . . . 7 (𝑙 = 𝑠 → (𝑏 = ((𝐴 ·s 𝐵) -s ((𝑟 -s 𝐴) ·s (𝑙 -s 𝐵))) ↔ 𝑏 = ((𝐴 ·s 𝐵) -s ((𝑟 -s 𝐴) ·s (𝑠 -s 𝐵)))))
2924, 28cbvrex2vw 3245 . . . . . 6 (∃𝑘𝑅𝑙𝑆 𝑏 = ((𝐴 ·s 𝐵) -s ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵))) ↔ ∃𝑟𝑅𝑠𝑆 𝑏 = ((𝐴 ·s 𝐵) -s ((𝑟 -s 𝐴) ·s (𝑠 -s 𝐵))))
3020, 29bitrdi 290 . . . . 5 (𝑓 = 𝑏 → (∃𝑘𝑅𝑙𝑆 𝑓 = ((𝐴 ·s 𝐵) -s ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵))) ↔ ∃𝑟𝑅𝑠𝑆 𝑏 = ((𝐴 ·s 𝐵) -s ((𝑟 -s 𝐴) ·s (𝑠 -s 𝐵)))))
3130cbvabv 2830 . . . 4 {𝑓 ∣ ∃𝑘𝑅𝑙𝑆 𝑓 = ((𝐴 ·s 𝐵) -s ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵)))} = {𝑏 ∣ ∃𝑟𝑅𝑠𝑆 𝑏 = ((𝐴 ·s 𝐵) -s ((𝑟 -s 𝐴) ·s (𝑠 -s 𝐵)))}
3218, 31uneq12i 4113 . . 3 ({𝑒 ∣ ∃𝑖𝐿𝑗𝑀 𝑒 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑖) ·s (𝐵 -s 𝑗)))} ∪ {𝑓 ∣ ∃𝑘𝑅𝑙𝑆 𝑓 = ((𝐴 ·s 𝐵) -s ((𝑘 -s 𝐴) ·s (𝑙 -s 𝐵)))}) = ({𝑎 ∣ ∃𝑝𝐿𝑞𝑀 𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑞)))} ∪ {𝑏 ∣ ∃𝑟𝑅𝑠𝑆 𝑏 = ((𝐴 ·s 𝐵) -s ((𝑟 -s 𝐴) ·s (𝑠 -s 𝐵)))})
33 eqeq1 2764 . . . . . . 7 (𝑔 = 𝑐 → (𝑔 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵))) ↔ 𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵)))))
34332rexbidv 3227 . . . . . 6 (𝑔 = 𝑐 → (∃𝑚𝐿𝑛𝑆 𝑔 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵))) ↔ ∃𝑚𝐿𝑛𝑆 𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵)))))
35 oveq2 7421 . . . . . . . . . 10 (𝑚 = 𝑡 → (𝐴 -s 𝑚) = (𝐴 -s 𝑡))
3635oveq1d 7428 . . . . . . . . 9 (𝑚 = 𝑡 → ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵)) = ((𝐴 -s 𝑡) ·s (𝑛 -s 𝐵)))
3736oveq2d 7429 . . . . . . . 8 (𝑚 = 𝑡 → ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵))) = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑡) ·s (𝑛 -s 𝐵))))
3837eqeq2d 2771 . . . . . . 7 (𝑚 = 𝑡 → (𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵))) ↔ 𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑡) ·s (𝑛 -s 𝐵)))))
39 oveq1 7420 . . . . . . . . . 10 (𝑛 = 𝑢 → (𝑛 -s 𝐵) = (𝑢 -s 𝐵))
4039oveq2d 7429 . . . . . . . . 9 (𝑛 = 𝑢 → ((𝐴 -s 𝑡) ·s (𝑛 -s 𝐵)) = ((𝐴 -s 𝑡) ·s (𝑢 -s 𝐵)))
4140oveq2d 7429 . . . . . . . 8 (𝑛 = 𝑢 → ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑡) ·s (𝑛 -s 𝐵))) = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑡) ·s (𝑢 -s 𝐵))))
4241eqeq2d 2771 . . . . . . 7 (𝑛 = 𝑢 → (𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑡) ·s (𝑛 -s 𝐵))) ↔ 𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑡) ·s (𝑢 -s 𝐵)))))
4338, 42cbvrex2vw 3245 . . . . . 6 (∃𝑚𝐿𝑛𝑆 𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵))) ↔ ∃𝑡𝐿𝑢𝑆 𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑡) ·s (𝑢 -s 𝐵))))
4434, 43bitrdi 290 . . . . 5 (𝑔 = 𝑐 → (∃𝑚𝐿𝑛𝑆 𝑔 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵))) ↔ ∃𝑡𝐿𝑢𝑆 𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑡) ·s (𝑢 -s 𝐵)))))
4544cbvabv 2830 . . . 4 {𝑔 ∣ ∃𝑚𝐿𝑛𝑆 𝑔 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵)))} = {𝑐 ∣ ∃𝑡𝐿𝑢𝑆 𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑡) ·s (𝑢 -s 𝐵)))}
46 eqeq1 2764 . . . . . . 7 ( = 𝑑 → ( = ((𝐴 ·s 𝐵) +s ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥))) ↔ 𝑑 = ((𝐴 ·s 𝐵) +s ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥)))))
47462rexbidv 3227 . . . . . 6 ( = 𝑑 → (∃𝑜𝑅𝑥𝑀 = ((𝐴 ·s 𝐵) +s ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥))) ↔ ∃𝑜𝑅𝑥𝑀 𝑑 = ((𝐴 ·s 𝐵) +s ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥)))))
48 oveq1 7420 . . . . . . . . . 10 (𝑜 = 𝑣 → (𝑜 -s 𝐴) = (𝑣 -s 𝐴))
4948oveq1d 7428 . . . . . . . . 9 (𝑜 = 𝑣 → ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥)) = ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑥)))
5049oveq2d 7429 . . . . . . . 8 (𝑜 = 𝑣 → ((𝐴 ·s 𝐵) +s ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥))) = ((𝐴 ·s 𝐵) +s ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑥))))
5150eqeq2d 2771 . . . . . . 7 (𝑜 = 𝑣 → (𝑑 = ((𝐴 ·s 𝐵) +s ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥))) ↔ 𝑑 = ((𝐴 ·s 𝐵) +s ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑥)))))
52 oveq2 7421 . . . . . . . . . 10 (𝑥 = 𝑤 → (𝐵 -s 𝑥) = (𝐵 -s 𝑤))
5352oveq2d 7429 . . . . . . . . 9 (𝑥 = 𝑤 → ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑥)) = ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑤)))
5453oveq2d 7429 . . . . . . . 8 (𝑥 = 𝑤 → ((𝐴 ·s 𝐵) +s ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑥))) = ((𝐴 ·s 𝐵) +s ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑤))))
5554eqeq2d 2771 . . . . . . 7 (𝑥 = 𝑤 → (𝑑 = ((𝐴 ·s 𝐵) +s ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑥))) ↔ 𝑑 = ((𝐴 ·s 𝐵) +s ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑤)))))
5651, 55cbvrex2vw 3245 . . . . . 6 (∃𝑜𝑅𝑥𝑀 𝑑 = ((𝐴 ·s 𝐵) +s ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥))) ↔ ∃𝑣𝑅𝑤𝑀 𝑑 = ((𝐴 ·s 𝐵) +s ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑤))))
5747, 56bitrdi 290 . . . . 5 ( = 𝑑 → (∃𝑜𝑅𝑥𝑀 = ((𝐴 ·s 𝐵) +s ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥))) ↔ ∃𝑣𝑅𝑤𝑀 𝑑 = ((𝐴 ·s 𝐵) +s ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑤)))))
5857cbvabv 2830 . . . 4 { ∣ ∃𝑜𝑅𝑥𝑀 = ((𝐴 ·s 𝐵) +s ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥)))} = {𝑑 ∣ ∃𝑣𝑅𝑤𝑀 𝑑 = ((𝐴 ·s 𝐵) +s ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑤)))}
5945, 58uneq12i 4113 . . 3 ({𝑔 ∣ ∃𝑚𝐿𝑛𝑆 𝑔 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑚) ·s (𝑛 -s 𝐵)))} ∪ { ∣ ∃𝑜𝑅𝑥𝑀 = ((𝐴 ·s 𝐵) +s ((𝑜 -s 𝐴) ·s (𝐵 -s 𝑥)))}) = ({𝑐 ∣ ∃𝑡𝐿𝑢𝑆 𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑡) ·s (𝑢 -s 𝐵)))} ∪ {𝑑 ∣ ∃𝑣𝑅𝑤𝑀 𝑑 = ((𝐴 ·s 𝐵) +s ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑤)))})
6032, 59oveq12i 7425 . 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 𝑤)))}))
615, 60eqtrdi 2811 1 (𝜑 → (𝐴 ·s 𝐵) = (({𝑎 ∣ ∃𝑝𝐿𝑞𝑀 𝑎 = ((𝐴 ·s 𝐵) -s ((𝐴 -s 𝑝) ·s (𝐵 -s 𝑞)))} ∪ {𝑏 ∣ ∃𝑟𝑅𝑠𝑆 𝑏 = ((𝐴 ·s 𝐵) -s ((𝑟 -s 𝐴) ·s (𝑠 -s 𝐵)))}) |s ({𝑐 ∣ ∃𝑡𝐿𝑢𝑆 𝑐 = ((𝐴 ·s 𝐵) +s ((𝐴 -s 𝑡) ·s (𝑢 -s 𝐵)))} ∪ {𝑑 ∣ ∃𝑣𝑅𝑤𝑀 𝑑 = ((𝐴 ·s 𝐵) +s ((𝑣 -s 𝐴) ·s (𝐵 -s 𝑤)))})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  {cab 2738  wrex 3086  cun 3897   class class class wbr 5103  (class class class)co 7413   <<s cslts 28022   |s ccuts 28024   +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-ot 4593  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-nadd 8654  df-no 27879  df-lts 27880  df-bday 27881  df-les 27981  df-slts 28023  df-cuts 28025  df-0s 28072  df-made 28092  df-old 28093  df-left 28095  df-right 28096  df-norec 28203  df-norec2 28214  df-adds 28225  df-negs 28286  df-subs 28287  df-muls 28372
This theorem is used by:  remulscl  28767
  Copyright terms: Public domain W3C validator