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

Theorem mulsproplem3 28126
Description: Lemma for surreal multiplication. Under the inductive hypothesis, the product of 𝐴 itself 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 𝑒))))))
mulsproplem3.1 (𝜑𝐴 No )
mulsproplem3.2 (𝜑𝑌 ∈ ( O ‘( bday 𝐵)))
Assertion
Ref Expression
mulsproplem3 (𝜑 → (𝐴 ·s 𝑌) ∈ No )
Distinct variable groups:   𝐴,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐵,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐶,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐷,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐸,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝐹,𝑎,𝑏,𝑐,𝑑,𝑒,𝑓   𝑌,𝑏,𝑐,𝑑,𝑒,𝑓
Allowed substitution hints:   𝜑(𝑒,𝑓,𝑎,𝑏,𝑐,𝑑)   𝑌(𝑎)

Proof of Theorem mulsproplem3
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 mulsproplem3.1 . . 3 (𝜑𝐴 No )
3 mulsproplem3.2 . . . 4 (𝜑𝑌 ∈ ( O ‘( bday 𝐵)))
43oldnod 27855 . . 3 (𝜑𝑌 No )
5 0no 27817 . . . 4 0s No
65a1i 11 . . 3 (𝜑 → 0s No )
7 bday0 27819 . . . . . . . . . . . 12 ( bday ‘ 0s ) = ∅
87, 7oveq12i 7380 . . . . . . . . . . 11 (( bday ‘ 0s ) +no ( bday ‘ 0s )) = (∅ +no ∅)
9 0elon 6380 . . . . . . . . . . . 12 ∅ ∈ On
10 naddrid 8621 . . . . . . . . . . . 12 (∅ ∈ On → (∅ +no ∅) = ∅)
119, 10ax-mp 5 . . . . . . . . . . 11 (∅ +no ∅) = ∅
128, 11eqtri 2760 . . . . . . . . . 10 (( bday ‘ 0s ) +no ( bday ‘ 0s )) = ∅
1312, 12uneq12i 4120 . . . . . . . . 9 ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = (∅ ∪ ∅)
14 un0 4348 . . . . . . . . 9 (∅ ∪ ∅) = ∅
1513, 14eqtri 2760 . . . . . . . 8 ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) = ∅
1615, 15uneq12i 4120 . . . . . . 7 (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = (∅ ∪ ∅)
1716, 14eqtri 2760 . . . . . 6 (((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s ))) ∪ ((( bday ‘ 0s ) +no ( bday ‘ 0s )) ∪ (( bday ‘ 0s ) +no ( bday ‘ 0s )))) = ∅
1817uneq2i 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 4348 . . . . 5 ((( bday 𝐴) +no ( bday 𝑌)) ∪ ∅) = (( bday 𝐴) +no ( bday 𝑌))
2018, 19eqtri 2760 . . . 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 27897 . . . . . . 7 (𝑌 ∈ ( O ‘( bday 𝐵)) → ( bday 𝑌) ∈ ( bday 𝐵))
223, 21syl 17 . . . . . 6 (𝜑 → ( bday 𝑌) ∈ ( bday 𝐵))
23 bdayon 27760 . . . . . . 7 ( bday 𝑌) ∈ On
24 bdayon 27760 . . . . . . 7 ( bday 𝐵) ∈ On
25 bdayon 27760 . . . . . . 7 ( bday 𝐴) ∈ On
26 naddel2 8626 . . . . . . 7 ((( bday 𝑌) ∈ On ∧ ( bday 𝐵) ∈ On ∧ ( bday 𝐴) ∈ On) → (( bday 𝑌) ∈ ( bday 𝐵) ↔ (( bday 𝐴) +no ( bday 𝑌)) ∈ (( bday 𝐴) +no ( bday 𝐵))))
2723, 24, 25, 26mp3an 1464 . . . . . 6 (( bday 𝑌) ∈ ( bday 𝐵) ↔ (( bday 𝐴) +no ( bday 𝑌)) ∈ (( bday 𝐴) +no ( bday 𝐵)))
2822, 27sylib 218 . . . . 5 (𝜑 → (( bday 𝐴) +no ( bday 𝑌)) ∈ (( bday 𝐴) +no ( bday 𝐵)))
29 elun1 4136 . . . . 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 17 . . . 4 (𝜑 → (( bday 𝐴) +no ( bday 𝑌)) ∈ ((( bday 𝐴) +no ( bday 𝐵)) ∪ (((( bday 𝐶) +no ( bday 𝐸)) ∪ (( bday 𝐷) +no ( bday 𝐹))) ∪ ((( bday 𝐶) +no ( bday 𝐹)) ∪ (( bday 𝐷) +no ( bday 𝐸))))))
3120, 30eqeltrid 2841 . . 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, 2, 4, 6, 6, 6, 6, 31mulsproplem1 28124 . 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 494 1 (𝜑 → (𝐴 ·s 𝑌) ∈ No )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3052  cun 3901  c0 4287   class class class wbr 5100  Oncon0 6325  cfv 6500  (class class class)co 7368   +no cnadd 8603   No csur 27619   <s clts 27620   bday cbday 27621   0s c0s 27813   O cold 27831   -s csubs 28028   ·s cmuls 28114
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-1o 8407  df-2o 8408  df-nadd 8604  df-no 27622  df-lts 27623  df-bday 27624  df-slts 27766  df-cuts 27768  df-0s 27815  df-made 27835  df-old 27836
This theorem is referenced by:  mulsproplem5  28128  mulsproplem6  28129  mulsproplem7  28130  mulsproplem8  28131  mulsproplem9  28132  mulsproplem14  28137
  Copyright terms: Public domain W3C validator