MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mulsproplem2 Structured version   Visualization version   GIF version

Theorem mulsproplem2 28383
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
StepHypRef 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 𝐴)))
32oldnod 28113 . . 3 (𝜑𝑋 No )
4 mulsproplem2.2 . . 3 (𝜑𝐵 No )
5 0no 28075 . . . 4 0s No
65a1i 11 . . 3 (𝜑 → 0s No )
7 bday0 28077 . . . . . . . . . . . 12 ( bday ‘ 0s ) = ∅
87, 7oveq12i 7426 . . . . . . . . . . 11 (( bday ‘ 0s ) +no ( bday ‘ 0s )) = (∅ +no ∅)
9 0elon 6413 . . . . . . . . . . . 12 ∅ ∈ On
10 naddrid 8673 . . . . . . . . . . . 12 (∅ ∈ On → (∅ +no ∅) = ∅)
119, 10ax-mp 5 . . . . . . . . . . 11 (∅ +no ∅) = ∅
128, 11eqtri 2783 . . . . . . . . . 10 (( bday ‘ 0s ) +no ( bday ‘ 0s )) = ∅
1312, 12uneq12i 4113 . . . . . . . . 9 ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = (∅ ∪ ∅)
14 un0 4344 . . . . . . . . 9 (∅ ∪ ∅) = ∅
1513, 14eqtri 2783 . . . . . . . 8 ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = ∅
1615, 15uneq12i 4113 . . . . . . 7 (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = (∅ ∪ ∅)
1716, 14eqtri 2783 . . . . . 6 (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = ∅
1817uneq2i 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 𝐵)) ∪ ∅)
19 un0 4344 . . . . 5 ((( bday 𝑋) +no ( bday 𝐵)) ∪ ∅) = (( bday 𝑋) +no ( bday 𝐵))
2018, 19eqtri 2783 . . . 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 28155 . . . . . . 7 (𝑋 ∈ ( O ‘( bday 𝐴)) → ( bday 𝑋) ∈ ( bday 𝐴))
222, 21syl 18 . . . . . 6 (𝜑 → ( bday 𝑋) ∈ ( bday 𝐴))
23 bdayon 28018 . . . . . . 7 ( bday 𝑋) ∈ On
24 bdayon 28018 . . . . . . 7 ( bday 𝐴) ∈ On
25 bdayon 28018 . . . . . . 7 ( bday 𝐵) ∈ On
26 naddel1 8677 . . . . . . 7 ((( bday 𝑋) ∈ On ∧ ( bday 𝐴) ∈ On ∧ ( bday 𝐵) ∈ On) → (( bday 𝑋) ∈ ( bday 𝐴) ↔ (( bday 𝑋) +no ( bday 𝐵)) ∈ (( bday 𝐴) +no ( bday 𝐵))))
2723, 24, 25, 26mp3an 1490 . . . . . 6 (( bday 𝑋) ∈ ( bday 𝐴) ↔ (( bday 𝑋) +no ( bday 𝐵)) ∈ (( bday 𝐴) +no ( bday 𝐵)))
2822, 27sylib 221 . . . . 5 (𝜑 → (( bday 𝑋) +no ( bday 𝐵)) ∈ (( bday 𝐴) +no ( bday 𝐵)))
29 elun1 4128 . . . . 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 𝐸))))))
3028, 29syl 18 . . . 4 (𝜑 → (( bday 𝑋) +no ( bday 𝐵)) ∈ ((( bday 𝐴) +no ( bday 𝐵)) ∪ (((( bday 𝐶) +no ( bday 𝐸)) ∪ (( bday 𝐷) +no ( bday 𝐹))) ∪ ((( bday 𝐶) +no ( bday 𝐹)) ∪ (( bday 𝐷) +no ( bday 𝐸))))))
3120, 30eqeltrid 2864 . . 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 𝐸))))))
321, 3, 4, 6, 6, 6, 6, 31mulsproplem1 28382 . 2 (𝜑 → ((𝑋 ·s 𝐵) ∈ No ∧ (( 0s <s 0s ∧ 0s <s 0s ) → (( 0s ·s 0s ) -s ( 0s ·s 0s )) <s (( 0s ·s 0s ) -s ( 0s ·s 0s )))))
3332simpld 500 1 (𝜑 → (𝑋 ·s 𝐵) ∈ No )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  wral 3076  cun 3897  c0 4279   class class class wbr 5103  Oncon0 6357  cfv 6533  (class class class)co 7414   +no cnadd 8654   No csur 27877   <s clts 27878   bday cbday 27879   0s c0s 28071   O cold 28089   -s csubs 28286   ·s cmuls 28372
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-1o 8456  df-2o 8457  df-nadd 8655  df-no 27880  df-lts 27881  df-bday 27882  df-slts 28024  df-cuts 28026  df-0s 28073  df-made 28093  df-old 28094
This theorem is used by:  mulsproplem5  28386  mulsproplem6  28387  mulsproplem7  28388  mulsproplem8  28389  mulsproplem9  28390  mulsproplem13  28394
  Copyright terms: Public domain W3C validator