Theorem mulsproplem2 28086

Description: Lemma for surreal multiplication. Under the inductive hypothesis, the product of a member of the old set of 𝐴 and 𝐵 itself is a surreal number. (Contributed by Scott Fenton, 4-Mar-2025.)

Hypotheses

Ref	Expression
mulsproplem.1	⊢ (𝜑 → ∀𝑎 ∈ No ∀𝑏 ∈ No ∀𝑐 ∈ No ∀𝑑 ∈ No ∀𝑒 ∈ No ∀𝑓 ∈ No (((( bday ‘𝑎) +no ( bday ‘𝑏)) ∪ (((( bday ‘𝑐) +no ( bday ‘𝑒)) ∪ (( bday ‘𝑑) +no ( bday ‘𝑓))) ∪ ((( bday ‘𝑐) +no ( bday ‘𝑓)) ∪ (( bday ‘𝑑) +no ( bday ‘𝑒))))) ∈ ((( bday ‘𝐴) +no ( bday ‘𝐵)) ∪ (((( bday ‘𝐶) +no ( bday ‘𝐸)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐹))) ∪ ((( bday ‘𝐶) +no ( bday ‘𝐹)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐸))))) → ((𝑎 ·s 𝑏) ∈ No ∧ ((𝑐 <s 𝑑 ∧ 𝑒 <s 𝑓) → ((𝑐 ·s 𝑓) -s (𝑐 ·s 𝑒)) <s ((𝑑 ·s 𝑓) -s (𝑑 ·s 𝑒))))))
mulsproplem2.1	⊢ (𝜑 → 𝑋 ∈ ( O ‘( bday ‘𝐴)))
mulsproplem2.2	⊢ (𝜑 → 𝐵 ∈ No )

Assertion

Ref	Expression
mulsproplem2	⊢ (𝜑 → (𝑋 ·s 𝐵) ∈ No )

Distinct variable groups:   𝐴,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐵,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐶,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐷,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐸,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐹,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝑋,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓

Allowed substitution hints:   𝜑(𝑒,𝑓,𝑎,𝑏,𝑐,𝑑)

Proof of Theorem mulsproplem2

Step	Hyp	Ref	Expression
1		mulsproplem.1	. . 3 ⊢ (𝜑 → ∀𝑎 ∈ No ∀𝑏 ∈ No ∀𝑐 ∈ No ∀𝑑 ∈ No ∀𝑒 ∈ No ∀𝑓 ∈ No (((( bday ‘𝑎) +no ( bday ‘𝑏)) ∪ (((( bday ‘𝑐) +no ( bday ‘𝑒)) ∪ (( bday ‘𝑑) +no ( bday ‘𝑓))) ∪ ((( bday ‘𝑐) +no ( bday ‘𝑓)) ∪ (( bday ‘𝑑) +no ( bday ‘𝑒))))) ∈ ((( bday ‘𝐴) +no ( bday ‘𝐵)) ∪ (((( bday ‘𝐶) +no ( bday ‘𝐸)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐹))) ∪ ((( bday ‘𝐶) +no ( bday ‘𝐹)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐸))))) → ((𝑎 ·s 𝑏) ∈ No ∧ ((𝑐 <s 𝑑 ∧ 𝑒 <s 𝑓) → ((𝑐 ·s 𝑓) -s (𝑐 ·s 𝑒)) <s ((𝑑 ·s 𝑓) -s (𝑑 ·s 𝑒))))))
2		oldssno 27829	. . . 4 ⊢ ( O ‘( bday ‘𝐴)) ⊆ No
3		mulsproplem2.1	. . . 4 ⊢ (𝜑 → 𝑋 ∈ ( O ‘( bday ‘𝐴)))
4	2, 3	sselid 3929	. . 3 ⊢ (𝜑 → 𝑋 ∈ No )
5		mulsproplem2.2	. . 3 ⊢ (𝜑 → 𝐵 ∈ No )
6		0sno 27797	. . . 4 ⊢ 0s ∈ No
7	6	a1i 11	. . 3 ⊢ (𝜑 → 0s ∈ No )
8		bday0s 27799	. . . . . . . . . . . 12 ⊢ ( bday ‘ 0s ) = ∅
9	8, 8	oveq12i 7368	. . . . . . . . . . 11 ⊢ (( bday ‘ 0s ) +no ( bday ‘ 0s )) = (∅ +no ∅)
10		0elon 6370	. . . . . . . . . . . 12 ⊢ ∅ ∈ On
11		naddrid 8609	. . . . . . . . . . . 12 ⊢ (∅ ∈ On → (∅ +no ∅) = ∅)
12	10, 11	ax-mp 5	. . . . . . . . . . 11 ⊢ (∅ +no ∅) = ∅
13	9, 12	eqtri 2757	. . . . . . . . . 10 ⊢ (( bday ‘ 0s ) +no ( bday ‘ 0s )) = ∅
14	13, 13	uneq12i 4116	. . . . . . . . 9 ⊢ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = (∅ ∪ ∅)
15		un0 4344	. . . . . . . . 9 ⊢ (∅ ∪ ∅) = ∅
16	14, 15	eqtri 2757	. . . . . . . 8 ⊢ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = ∅
17	16, 16	uneq12i 4116	. . . . . . 7 ⊢ (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = (∅ ∪ ∅)
18	17, 15	eqtri 2757	. . . . . 6 ⊢ (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = ∅
19	18	uneq2i 4115	. . . . 5 ⊢ ((( bday ‘𝑋) +no ( bday ‘𝐵)) ∪ (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))))) = ((( bday ‘𝑋) +no ( bday ‘𝐵)) ∪ ∅)
20		un0 4344	. . . . 5 ⊢ ((( bday ‘𝑋) +no ( bday ‘𝐵)) ∪ ∅) = (( bday ‘𝑋) +no ( bday ‘𝐵))
21	19, 20	eqtri 2757	. . . 4 ⊢ ((( bday ‘𝑋) +no ( bday ‘𝐵)) ∪ (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))))) = (( bday ‘𝑋) +no ( bday ‘𝐵))
22		oldbdayim 27861	. . . . . . 7 ⊢ (𝑋 ∈ ( O ‘( bday ‘𝐴)) → ( bday ‘𝑋) ∈ ( bday ‘𝐴))
23	3, 22	syl 17	. . . . . 6 ⊢ (𝜑 → ( bday ‘𝑋) ∈ ( bday ‘𝐴))
24		bdayelon 27742	. . . . . . 7 ⊢ ( bday ‘𝑋) ∈ On
25		bdayelon 27742	. . . . . . 7 ⊢ ( bday ‘𝐴) ∈ On
26		bdayelon 27742	. . . . . . 7 ⊢ ( bday ‘𝐵) ∈ On
27		naddel1 8613	. . . . . . 7 ⊢ ((( bday ‘𝑋) ∈ On ∧ ( bday ‘𝐴) ∈ On ∧ ( bday ‘𝐵) ∈ On) → (( bday ‘𝑋) ∈ ( bday ‘𝐴) ↔ (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵))))
28	24, 25, 26, 27	mp3an 1463	. . . . . 6 ⊢ (( bday ‘𝑋) ∈ ( bday ‘𝐴) ↔ (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵)))
29	23, 28	sylib 218	. . . . 5 ⊢ (𝜑 → (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵)))
30		elun1 4132	. . . . 5 ⊢ ((( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵)) → (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ ((( bday ‘𝐴) +no ( bday ‘𝐵)) ∪ (((( bday ‘𝐶) +no ( bday ‘𝐸)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐹))) ∪ ((( bday ‘𝐶) +no ( bday ‘𝐹)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐸))))))
31	29, 30	syl 17	. . . 4 ⊢ (𝜑 → (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ ((( bday ‘𝐴) +no ( bday ‘𝐵)) ∪ (((( bday ‘𝐶) +no ( bday ‘𝐸)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐹))) ∪ ((( bday ‘𝐶) +no ( bday ‘𝐹)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐸))))))
32	21, 31	eqeltrid 2838	. . 3 ⊢ (𝜑 → ((( bday ‘𝑋) +no ( bday ‘𝐵)) ∪ (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))))) ∈ ((( bday ‘𝐴) +no ( bday ‘𝐵)) ∪ (((( bday ‘𝐶) +no ( bday ‘𝐸)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐹))) ∪ ((( bday ‘𝐶) +no ( bday ‘𝐹)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐸))))))
33	1, 4, 5, 7, 7, 7, 7, 32	mulsproplem1 28085	. 2 ⊢ (𝜑 → ((𝑋 ·s 𝐵) ∈ No ∧ (( 0s <s 0s ∧ 0s <s 0s ) → (( 0s ·s 0s ) -s ( 0s ·s 0s )) <s (( 0s ·s 0s ) -s ( 0s ·s 0s )))))
34	33	simpld 494	1 ⊢ (𝜑 → (𝑋 ·s 𝐵) ∈ No )

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ∀wral 3049   ∪ cun 3897  ∅c0 4283   class class class wbr 5096  Oncon0 6315  ‘cfv 6490  (class class class)co 7356   +no cnadd 8591   No csur 27605   <s cslt 27606   bday cbday 27607   0_s c0s 27793   O cold 27811   -_s csubs 27989   ·_s cmuls 28075

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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678

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 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-tp 4583  df-op 4585  df-uni 4862  df-int 4901  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-se 5576  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-1o 8395  df-2o 8396  df-nadd 8592  df-no 27608  df-slt 27609  df-bday 27610  df-sslt 27748  df-scut 27750  df-0s 27795  df-made 27815  df-old 27816

This theorem is referenced by:  mulsproplem5  28089  mulsproplem6  28090  mulsproplem7  28091  mulsproplem8  28092  mulsproplem9  28093  mulsproplem13  28097