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

Theorem mulsproplem4 28212
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
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 mulsproplem4.1 . . . 4 (𝜑𝑋 ∈ ( O ‘( bday 𝐴)))
32oldnod 27940 . . 3 (𝜑𝑋 No )
4 mulsproplem4.2 . . . 4 (𝜑𝑌 ∈ ( O ‘( bday 𝐵)))
54oldnod 27940 . . 3 (𝜑𝑌 No )
6 0no 27902 . . . 4 0s No
76a1i 11 . . 3 (𝜑 → 0s No )
8 bday0 27904 . . . . . . . . . . . 12 ( bday ‘ 0s ) = ∅
98, 8oveq12i 7408 . . . . . . . . . . 11 (( bday ‘ 0s ) +no ( bday ‘ 0s )) = (∅ +no ∅)
10 0elon 6401 . . . . . . . . . . . 12 ∅ ∈ On
11 naddrid 8654 . . . . . . . . . . . 12 (∅ ∈ On → (∅ +no ∅) = ∅)
1210, 11ax-mp 5 . . . . . . . . . . 11 (∅ +no ∅) = ∅
139, 12eqtri 2785 . . . . . . . . . 10 (( bday ‘ 0s ) +no ( bday ‘ 0s )) = ∅
1413, 13uneq12i 4119 . . . . . . . . 9 ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = (∅ ∪ ∅)
15 un0 4348 . . . . . . . . 9 (∅ ∪ ∅) = ∅
1614, 15eqtri 2785 . . . . . . . 8 ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = ∅
1716, 16uneq12i 4119 . . . . . . 7 (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = (∅ ∪ ∅)
1817, 15eqtri 2785 . . . . . 6 (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = ∅
1918uneq2i 4118 . . . . 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 4348 . . . . 5 ((( bday 𝑋) +no ( bday 𝑌)) ∪ ∅) = (( bday 𝑋) +no ( bday 𝑌))
2119, 20eqtri 2785 . . . 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 27982 . . . . . . 7 (𝑋 ∈ ( O ‘( bday 𝐴)) → ( bday 𝑋) ∈ ( bday 𝐴))
232, 22syl 17 . . . . . 6 (𝜑 → ( bday 𝑋) ∈ ( bday 𝐴))
24 oldbdayim 27982 . . . . . . 7 (𝑌 ∈ ( O ‘( bday 𝐵)) → ( bday 𝑌) ∈ ( bday 𝐵))
254, 24syl 17 . . . . . 6 (𝜑 → ( bday 𝑌) ∈ ( bday 𝐵))
26 bdayon 27845 . . . . . . 7 ( bday 𝐴) ∈ On
27 bdayon 27845 . . . . . . 7 ( bday 𝐵) ∈ On
28 naddel12 8671 . . . . . . 7 ((( bday 𝐴) ∈ On ∧ ( bday 𝐵) ∈ On) → ((( bday 𝑋) ∈ ( bday 𝐴) ∧ ( bday 𝑌) ∈ ( bday 𝐵)) → (( bday 𝑋) +no ( bday 𝑌)) ∈ (( bday 𝐴) +no ( bday 𝐵))))
2926, 27, 28mp2an 702 . . . . . 6 ((( bday 𝑋) ∈ ( bday 𝐴) ∧ ( bday 𝑌) ∈ ( bday 𝐵)) → (( bday 𝑋) +no ( bday 𝑌)) ∈ (( bday 𝐴) +no ( bday 𝐵)))
3023, 25, 29syl2anc 593 . . . . 5 (𝜑 → (( bday 𝑋) +no ( bday 𝑌)) ∈ (( bday 𝐴) +no ( bday 𝐵)))
31 elun1 4134 . . . . 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 𝐸))))))
3230, 31syl 17 . . . 4 (𝜑 → (( bday 𝑋) +no ( bday 𝑌)) ∈ ((( bday 𝐴) +no ( bday 𝐵)) ∪ (((( bday 𝐶) +no ( bday 𝐸)) ∪ (( bday 𝐷) +no ( bday 𝐹))) ∪ ((( bday 𝐶) +no ( bday 𝐹)) ∪ (( bday 𝐷) +no ( bday 𝐸))))))
3321, 32eqeltrid 2866 . . 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 𝐸))))))
341, 3, 5, 7, 7, 7, 7, 33mulsproplem1 28209 . 2 (𝜑 → ((𝑋 ·s 𝑌) ∈ No ∧ (( 0s <s 0s ∧ 0s <s 0s ) → (( 0s ·s 0s ) -s ( 0s ·s 0s )) <s (( 0s ·s 0s ) -s ( 0s ·s 0s )))))
3534simpld 498 1 (𝜑 → (𝑋 ·s 𝑌) ∈ No )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1560  wcel 2142  wral 3076  cun 3902  c0 4285   class class class wbr 5100  Oncon0 6346  cfv 6521  (class class class)co 7396   +no cnadd 8635   No csur 27704   <s clts 27705   bday cbday 27706   0s c0s 27898   O cold 27916   -s csubs 28113   ·s cmuls 28199
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-int 4906  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-se 5601  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-1o 8437  df-2o 8438  df-nadd 8636  df-no 27707  df-lts 27708  df-bday 27709  df-slts 27851  df-cuts 27853  df-0s 27900  df-made 27920  df-old 27921
This theorem is referenced by:  mulsproplem5  28213  mulsproplem6  28214  mulsproplem7  28215  mulsproplem8  28216  mulsproplem9  28217
  Copyright terms: Public domain W3C validator