Theorem mulsproplem2 27933

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 27704	. . . 4 ⊢ ( O ‘( bday ‘𝐴)) ⊆ No
3		mulsproplem2.1	. . . 4 ⊢ (𝜑 → 𝑋 ∈ ( O ‘( bday ‘𝐴)))
4	2, 3	sselid 3972	. . 3 ⊢ (𝜑 → 𝑋 ∈ No )
5		mulsproplem2.2	. . 3 ⊢ (𝜑 → 𝐵 ∈ No )
6		0sno 27675	. . . 4 ⊢ 0s ∈ No
7	6	a1i 11	. . 3 ⊢ (𝜑 → 0s ∈ No )
8		bday0s 27677	. . . . . . . . . . . 12 ⊢ ( bday ‘ 0s ) = ∅
9	8, 8	oveq12i 7413	. . . . . . . . . . 11 ⊢ (( bday ‘ 0s ) +no ( bday ‘ 0s )) = (∅ +no ∅)
10		0elon 6408	. . . . . . . . . . . 12 ⊢ ∅ ∈ On
11		naddrid 8678	. . . . . . . . . . . 12 ⊢ (∅ ∈ On → (∅ +no ∅) = ∅)
12	10, 11	ax-mp 5	. . . . . . . . . . 11 ⊢ (∅ +no ∅) = ∅
13	9, 12	eqtri 2752	. . . . . . . . . 10 ⊢ (( bday ‘ 0s ) +no ( bday ‘ 0s )) = ∅
14	13, 13	uneq12i 4153	. . . . . . . . 9 ⊢ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = (∅ ∪ ∅)
15		un0 4382	. . . . . . . . 9 ⊢ (∅ ∪ ∅) = ∅
16	14, 15	eqtri 2752	. . . . . . . 8 ⊢ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = ∅
17	16, 16	uneq12i 4153	. . . . . . 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 2752	. . . . . 6 ⊢ (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = ∅
19	18	uneq2i 4152	. . . . 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 4382	. . . . 5 ⊢ ((( bday ‘𝑋) +no ( bday ‘𝐵)) ∪ ∅) = (( bday ‘𝑋) +no ( bday ‘𝐵))
21	19, 20	eqtri 2752	. . . 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 27731	. . . . . . 7 ⊢ (𝑋 ∈ ( O ‘( bday ‘𝐴)) → ( bday ‘𝑋) ∈ ( bday ‘𝐴))
23	3, 22	syl 17	. . . . . 6 ⊢ (𝜑 → ( bday ‘𝑋) ∈ ( bday ‘𝐴))
24		bdayelon 27625	. . . . . . 7 ⊢ ( bday ‘𝑋) ∈ On
25		bdayelon 27625	. . . . . . 7 ⊢ ( bday ‘𝐴) ∈ On
26		bdayelon 27625	. . . . . . 7 ⊢ ( bday ‘𝐵) ∈ On
27		naddel1 8682	. . . . . . 7 ⊢ ((( bday ‘𝑋) ∈ On ∧ ( bday ‘𝐴) ∈ On ∧ ( bday ‘𝐵) ∈ On) → (( bday ‘𝑋) ∈ ( bday ‘𝐴) ↔ (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵))))
28	24, 25, 26, 27	mp3an 1457	. . . . . 6 ⊢ (( bday ‘𝑋) ∈ ( bday ‘𝐴) ↔ (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵)))
29	23, 28	sylib 217	. . . . 5 ⊢ (𝜑 → (( bday ‘𝑋) +no ( bday ‘𝐵)) ∈ (( bday ‘𝐴) +no ( bday ‘𝐵)))
30		elun1 4168	. . . . 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 2829	. . 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 27932	. 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 205   ∧ wa 395   = wceq 1533   ∈ wcel 2098  ∀wral 3053   ∪ cun 3938  ∅c0 4314   class class class wbr 5138  Oncon0 6354  ‘cfv 6533  (class class class)co 7401   +no cnadd 8660   No csur 27489   <s cslt 27490   bday cbday 27491   0_s c0s 27671   O cold 27686   -_s csubs 27849   ·_s cmuls 27922

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695  ax-rep 5275  ax-sep 5289  ax-nul 5296  ax-pow 5353  ax-pr 5417  ax-un 7718

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ne 2933  df-ral 3054  df-rex 3063  df-rmo 3368  df-reu 3369  df-rab 3425  df-v 3468  df-sbc 3770  df-csb 3886  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-pss 3959  df-nul 4315  df-if 4521  df-pw 4596  df-sn 4621  df-pr 4623  df-tp 4625  df-op 4627  df-uni 4900  df-int 4941  df-iun 4989  df-br 5139  df-opab 5201  df-mpt 5222  df-tr 5256  df-id 5564  df-eprel 5570  df-po 5578  df-so 5579  df-fr 5621  df-se 5622  df-we 5623  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6290  df-ord 6357  df-on 6358  df-suc 6360  df-iota 6485  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7357  df-ov 7404  df-oprab 7405  df-mpo 7406  df-1st 7968  df-2nd 7969  df-frecs 8261  df-wrecs 8292  df-recs 8366  df-1o 8461  df-2o 8462  df-nadd 8661  df-no 27492  df-slt 27493  df-bday 27494  df-sslt 27630  df-scut 27632  df-0s 27673  df-made 27690  df-old 27691

This theorem is referenced by:  mulsproplem5  27936  mulsproplem6  27937  mulsproplem7  27938  mulsproplem8  27939  mulsproplem9  27940  mulsproplem13  27944