Theorem mulsproplem2 28361

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		mulsproplem2.1	. . . 4 ⊢ (𝜑 → 𝑋 ∈ ( O ‘( bday ‘𝐴)))
3	2	oldnod 28091	. . 3 ⊢ (𝜑 → 𝑋 ∈ No )
4		mulsproplem2.2	. . 3 ⊢ (𝜑 → 𝐵 ∈ No )
5		0no 28053	. . . 4 ⊢ 0s ∈ No
6	5	a1i 11	. . 3 ⊢ (𝜑 → 0s ∈ No )
7		bday0 28055	. . . . . . . . . . . 12 ⊢ ( bday ‘ 0s ) = ∅
8	7, 7	oveq12i 7431	. . . . . . . . . . 11 ⊢ (( bday ‘ 0s ) +no ( bday ‘ 0s )) = (∅ +no ∅)
9		0elon 6420	. . . . . . . . . . . 12 ⊢ ∅ ∈ On
10		naddrid 8676	. . . . . . . . . . . 12 ⊢ (∅ ∈ On → (∅ +no ∅) = ∅)
11	9, 10	ax-mp 5	. . . . . . . . . . 11 ⊢ (∅ +no ∅) = ∅
12	8, 11	eqtri 2788	. . . . . . . . . 10 ⊢ (( bday ‘ 0s ) +no ( bday ‘ 0s )) = ∅
13	12, 12	uneq12i 4120	. . . . . . . . 9 ⊢ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = (∅ ∪ ∅)
14		un0 4351	. . . . . . . . 9 ⊢ (∅ ∪ ∅) = ∅
15	13, 14	eqtri 2788	. . . . . . . 8 ⊢ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = ∅
16	15, 15	uneq12i 4120	. . . . . . 7 ⊢ (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = (∅ ∪ ∅)
17	16, 14	eqtri 2788	. . . . . 6 ⊢ (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = ∅
18	17	uneq2i 4119	. . . . 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 ‘𝐵)) ∪ ∅)
19		un0 4351	. . . . 5 ⊢ ((( bday ‘𝑋) +no ( bday ‘𝐵)) ∪ ∅) = (( bday ‘𝑋) +no ( bday ‘𝐵))
20	18, 19	eqtri 2788	. . . 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 ‘𝐵))
21		oldbdayim 28133	. . . . . . 7 ⊢ (𝑋 ∈ ( O ‘( bday ‘𝐴)) → ( bday ‘𝑋) ∈ ( bday ‘𝐴))
22	2, 21	syl 18	. . . . . 6 ⊢ (𝜑 → ( bday ‘𝑋) ∈ ( bday ‘𝐴))
23		bdayon 27996	. . . . . . 7 ⊢ ( bday ‘𝑋) ∈ On
24		bdayon 27996	. . . . . . 7 ⊢ ( bday ‘𝐴) ∈ On
25		bdayon 27996	. . . . . . 7 ⊢ ( bday ‘𝐵) ∈ On
26		naddel1 8680	. . . . . . 7 ⊢ ((( bday ‘𝑋) ∈ On ∧ ( bday ‘𝐴) ∈ On ∧ ( bday ‘𝐵) ∈ On) → (( bday ‘𝑋) ∈ ( bday ‘𝐴) ↔ (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵))))
27	23, 24, 25, 26	mp3an 1490	. . . . . 6 ⊢ (( bday ‘𝑋) ∈ ( bday ‘𝐴) ↔ (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵)))
28	22, 27	sylib 221	. . . . 5 ⊢ (𝜑 → (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵)))
29		elun1 4135	. . . . 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 ‘𝐸))))))
30	28, 29	syl 18	. . . 4 ⊢ (𝜑 → (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ ((( bday ‘𝐴) +no ( bday ‘𝐵)) ∪ (((( bday ‘𝐶) +no ( bday ‘𝐸)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐹))) ∪ ((( bday ‘𝐶) +no ( bday ‘𝐹)) ∪ (( bday ‘𝐷) +no ( bday ‘𝐸))))))
31	20, 30	eqeltrid 2869	. . 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 ‘𝐸))))))
32	1, 3, 4, 6, 6, 6, 6, 31	mulsproplem1 28360	. 2 ⊢ (𝜑 → ((𝑋 ·s 𝐵) ∈ No ∧ (( 0s <s 0s ∧ 0s <s 0s ) → (( 0s ·s 0s ) -s ( 0s ·s 0s )) <s (( 0s ·s 0s ) -s ( 0s ·s 0s )))))
33	32	simpld 500	1 ⊢ (𝜑 → (𝑋 ·s 𝐵) ∈ No )

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081   ∪ cun 3904  ∅c0 4286   class class class wbr 5111  Oncon0 6364  ‘cfv 6540  (class class class)co 7419   +no cnadd 8657   No csur 27855   <s clts 27856   bday cbday 27857   0_s c0s 28049   O cold 28067   -_s csubs 28264   ·_s cmuls 28350

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-1o 8459  df-2o 8460  df-nadd 8658  df-no 27858  df-lts 27859  df-bday 27860  df-slts 28002  df-cuts 28004  df-0s 28051  df-made 28071  df-old 28072

This theorem is used by:  mulsproplem5  28364  mulsproplem6  28365  mulsproplem7  28366  mulsproplem8  28367  mulsproplem9  28368  mulsproplem13  28372