Theorem mulsproplem2 27563

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 27346	. . . 4 ⊢ ( O ‘( bday ‘𝐴)) ⊆ No
3		mulsproplem2.1	. . . 4 ⊢ (𝜑 → 𝑋 ∈ ( O ‘( bday ‘𝐴)))
4	2, 3	sselid 3980	. . 3 ⊢ (𝜑 → 𝑋 ∈ No )
5		mulsproplem2.2	. . 3 ⊢ (𝜑 → 𝐵 ∈ No )
6		0sno 27317	. . . 4 ⊢ 0s ∈ No
7	6	a1i 11	. . 3 ⊢ (𝜑 → 0s ∈ No )
8		bday0s 27319	. . . . . . . . . . . 12 ⊢ ( bday ‘ 0s ) = ∅
9	8, 8	oveq12i 7418	. . . . . . . . . . 11 ⊢ (( bday ‘ 0s ) +no ( bday ‘ 0s )) = (∅ +no ∅)
10		0elon 6416	. . . . . . . . . . . 12 ⊢ ∅ ∈ On
11		naddrid 8679	. . . . . . . . . . . 12 ⊢ (∅ ∈ On → (∅ +no ∅) = ∅)
12	10, 11	ax-mp 5	. . . . . . . . . . 11 ⊢ (∅ +no ∅) = ∅
13	9, 12	eqtri 2761	. . . . . . . . . 10 ⊢ (( bday ‘ 0s ) +no ( bday ‘ 0s )) = ∅
14	13, 13	uneq12i 4161	. . . . . . . . 9 ⊢ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = (∅ ∪ ∅)
15		un0 4390	. . . . . . . . 9 ⊢ (∅ ∪ ∅) = ∅
16	14, 15	eqtri 2761	. . . . . . . 8 ⊢ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = ∅
17	16, 16	uneq12i 4161	. . . . . . 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 2761	. . . . . 6 ⊢ (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = ∅
19	18	uneq2i 4160	. . . . 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 4390	. . . . 5 ⊢ ((( bday ‘𝑋) +no ( bday ‘𝐵)) ∪ ∅) = (( bday ‘𝑋) +no ( bday ‘𝐵))
21	19, 20	eqtri 2761	. . . 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 27373	. . . . . . 7 ⊢ (𝑋 ∈ ( O ‘( bday ‘𝐴)) → ( bday ‘𝑋) ∈ ( bday ‘𝐴))
23	3, 22	syl 17	. . . . . 6 ⊢ (𝜑 → ( bday ‘𝑋) ∈ ( bday ‘𝐴))
24		bdayelon 27268	. . . . . . 7 ⊢ ( bday ‘𝑋) ∈ On
25		bdayelon 27268	. . . . . . 7 ⊢ ( bday ‘𝐴) ∈ On
26		bdayelon 27268	. . . . . . 7 ⊢ ( bday ‘𝐵) ∈ On
27		naddel1 8683	. . . . . . 7 ⊢ ((( bday ‘𝑋) ∈ On ∧ ( bday ‘𝐴) ∈ On ∧ ( bday ‘𝐵) ∈ On) → (( bday ‘𝑋) ∈ ( bday ‘𝐴) ↔ (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵))))
28	24, 25, 26, 27	mp3an 1462	. . . . . 6 ⊢ (( bday ‘𝑋) ∈ ( bday ‘𝐴) ↔ (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵)))
29	23, 28	sylib 217	. . . . 5 ⊢ (𝜑 → (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵)))
30		elun1 4176	. . . . 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 27562	. 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 496	1 ⊢ (𝜑 → (𝑋 ·s 𝐵) ∈ No )

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   = wceq 1542   ∈ wcel 2107  ∀wral 3062   ∪ cun 3946  ∅c0 4322   class class class wbr 5148  Oncon0 6362  ‘cfv 6541  (class class class)co 7406   +no cnadd 8661   No csur 27133   <s cslt 27134   bday cbday 27135   0_s c0s 27313   O cold 27328   -_s csubs 27485   ·_s cmuls 27552

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7722

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-tp 4633  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-se 5632  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6298  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6493  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-riota 7362  df-ov 7409  df-oprab 7410  df-mpo 7411  df-1st 7972  df-2nd 7973  df-frecs 8263  df-wrecs 8294  df-recs 8368  df-1o 8463  df-2o 8464  df-nadd 8662  df-no 27136  df-slt 27137  df-bday 27138  df-sslt 27273  df-scut 27275  df-0s 27315  df-made 27332  df-old 27333

This theorem is referenced by:  mulsproplem5  27566  mulsproplem6  27567  mulsproplem7  27568  mulsproplem8  27569  mulsproplem9  27570  mulsproplem13  27574