Theorem mulsproplem4 28058

Description: Lemma for surreal multiplication. Under the inductive hypothesis, the product of a member of the old set of 𝐴 and a member of the old set of 𝐵 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 𝑒))))))
mulsproplem4.1	⊢ (𝜑 → 𝑋 ∈ ( O ‘( bday ‘𝐴)))
mulsproplem4.2	⊢ (𝜑 → 𝑌 ∈ ( O ‘( bday ‘𝐵)))

Assertion

Ref	Expression
mulsproplem4	⊢ (𝜑 → (𝑋 ·s 𝑌) ∈ No )

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

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

Proof of Theorem mulsproplem4

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 27802	. . . 4 ⊢ ( O ‘( bday ‘𝐴)) ⊆ No
3		mulsproplem4.1	. . . 4 ⊢ (𝜑 → 𝑋 ∈ ( O ‘( bday ‘𝐴)))
4	2, 3	sselid 3927	. . 3 ⊢ (𝜑 → 𝑋 ∈ No )
5		oldssno 27802	. . . 4 ⊢ ( O ‘( bday ‘𝐵)) ⊆ No
6		mulsproplem4.2	. . . 4 ⊢ (𝜑 → 𝑌 ∈ ( O ‘( bday ‘𝐵)))
7	5, 6	sselid 3927	. . 3 ⊢ (𝜑 → 𝑌 ∈ No )
8		0sno 27770	. . . 4 ⊢ 0s ∈ No
9	8	a1i 11	. . 3 ⊢ (𝜑 → 0s ∈ No )
10		bday0s 27772	. . . . . . . . . . . 12 ⊢ ( bday ‘ 0s ) = ∅
11	10, 10	oveq12i 7358	. . . . . . . . . . 11 ⊢ (( bday ‘ 0s ) +no ( bday ‘ 0s )) = (∅ +no ∅)
12		0elon 6361	. . . . . . . . . . . 12 ⊢ ∅ ∈ On
13		naddrid 8598	. . . . . . . . . . . 12 ⊢ (∅ ∈ On → (∅ +no ∅) = ∅)
14	12, 13	ax-mp 5	. . . . . . . . . . 11 ⊢ (∅ +no ∅) = ∅
15	11, 14	eqtri 2754	. . . . . . . . . 10 ⊢ (( bday ‘ 0s ) +no ( bday ‘ 0s )) = ∅
16	15, 15	uneq12i 4113	. . . . . . . . 9 ⊢ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = (∅ ∪ ∅)
17		un0 4341	. . . . . . . . 9 ⊢ (∅ ∪ ∅) = ∅
18	16, 17	eqtri 2754	. . . . . . . 8 ⊢ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = ∅
19	18, 18	uneq12i 4113	. . . . . . 7 ⊢ (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = (∅ ∪ ∅)
20	19, 17	eqtri 2754	. . . . . 6 ⊢ (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = ∅
21	20	uneq2i 4112	. . . . 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 ‘𝑌)) ∪ ∅)
22		un0 4341	. . . . 5 ⊢ ((( bday ‘𝑋) +no ( bday ‘𝑌)) ∪ ∅) = (( bday ‘𝑋) +no ( bday ‘𝑌))
23	21, 22	eqtri 2754	. . . 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 ‘𝑌))
24		oldbdayim 27834	. . . . . . 7 ⊢ (𝑋 ∈ ( O ‘( bday ‘𝐴)) → ( bday ‘𝑋) ∈ ( bday ‘𝐴))
25	3, 24	syl 17	. . . . . 6 ⊢ (𝜑 → ( bday ‘𝑋) ∈ ( bday ‘𝐴))
26		oldbdayim 27834	. . . . . . 7 ⊢ (𝑌 ∈ ( O ‘( bday ‘𝐵)) → ( bday ‘𝑌) ∈ ( bday ‘𝐵))
27	6, 26	syl 17	. . . . . 6 ⊢ (𝜑 → ( bday ‘𝑌) ∈ ( bday ‘𝐵))
28		bdayelon 27715	. . . . . . 7 ⊢ ( bday ‘𝐴) ∈ On
29		bdayelon 27715	. . . . . . 7 ⊢ ( bday ‘𝐵) ∈ On
30		naddel12 8615	. . . . . . 7 ⊢ ((( bday ‘𝐴) ∈ On ∧ ( bday ‘𝐵) ∈ On) → ((( bday ‘𝑋) ∈ ( bday ‘𝐴) ∧ ( bday ‘𝑌) ∈ ( bday ‘𝐵)) → (( bday ‘𝑋) +no ( bday ‘𝑌)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵))))
31	28, 29, 30	mp2an 692	. . . . . 6 ⊢ ((( bday ‘𝑋) ∈ ( bday ‘𝐴) ∧ ( bday ‘𝑌) ∈ ( bday ‘𝐵)) → (( bday ‘𝑋) +no ( bday ‘𝑌)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵)))
32	25, 27, 31	syl2anc 584	. . . . 5 ⊢ (𝜑 → (( bday ‘𝑋) +no ( bday ‘𝑌)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵)))
33		elun1 4129	. . . . 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 ‘𝐸))))))
34	32, 33	syl 17	. . . 4 ⊢ (𝜑 → (( bday ‘𝑋) +no ( bday ‘𝑌)) ∈ ((( bday ‘𝐴) +no ( bday ‘𝐵)) ∪ (((( bday ‘𝐶) +no ( bday ‘𝐸)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐹))) ∪ ((( bday ‘𝐶) +no ( bday ‘𝐹)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐸))))))
35	23, 34	eqeltrid 2835	. . 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 ‘𝐸))))))
36	1, 4, 7, 9, 9, 9, 9, 35	mulsproplem1 28055	. 2 ⊢ (𝜑 → ((𝑋 ·s 𝑌) ∈ No ∧ (( 0s <s 0s ∧ 0s <s 0s ) → (( 0s ·s 0s ) -s ( 0s ·s 0s )) <s (( 0s ·s 0s ) -s ( 0s ·s 0s )))))
37	36	simpld 494	1 ⊢ (𝜑 → (𝑋 ·s 𝑌) ∈ No )

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2111  ∀wral 3047   ∪ cun 3895  ∅c0 4280   class class class wbr 5089  Oncon0 6306  ‘cfv 6481  (class class class)co 7346   +no cnadd 8580   No csur 27578   <s cslt 27579   bday cbday 27580   0_s c0s 27766   O cold 27784   -_s csubs 27962   ·_s cmuls 28045

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 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668

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 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-tp 4578  df-op 4580  df-uni 4857  df-int 4896  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-se 5568  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-pred 6248  df-ord 6309  df-on 6310  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-1st 7921  df-2nd 7922  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-1o 8385  df-2o 8386  df-nadd 8581  df-no 27581  df-slt 27582  df-bday 27583  df-sslt 27721  df-scut 27723  df-0s 27768  df-made 27788  df-old 27789

This theorem is referenced by:  mulsproplem5  28059  mulsproplem6  28060  mulsproplem7  28061  mulsproplem8  28062  mulsproplem9  28063