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

Theorem norecdiv 28159
Description: If a surreal has a reciprocal, then it has any division. (Contributed by Scott Fenton, 12-Mar-2025.)
Assertion
Ref Expression
norecdiv (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ ∃𝑥 No (𝐴 ·s 𝑥) = 1s ) → ∃𝑦 No (𝐴 ·s 𝑦) = 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑦,𝐴   𝑦,𝐵
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem norecdiv
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simprl 770 . . . . . 6 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → 𝑤 No )
2 simpl3 1194 . . . . . 6 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → 𝐵 No )
31, 2mulscld 28104 . . . . 5 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → (𝑤 ·s 𝐵) ∈ No )
4 oveq1 7363 . . . . . . . 8 ((𝐴 ·s 𝑤) = 1s → ((𝐴 ·s 𝑤) ·s 𝐵) = ( 1s ·s 𝐵))
54adantl 481 . . . . . . 7 ((𝑤 No ∧ (𝐴 ·s 𝑤) = 1s ) → ((𝐴 ·s 𝑤) ·s 𝐵) = ( 1s ·s 𝐵))
65adantl 481 . . . . . 6 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → ((𝐴 ·s 𝑤) ·s 𝐵) = ( 1s ·s 𝐵))
7 simpl1 1192 . . . . . . 7 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → 𝐴 No )
87, 1, 2mulsassd 28136 . . . . . 6 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → ((𝐴 ·s 𝑤) ·s 𝐵) = (𝐴 ·s (𝑤 ·s 𝐵)))
92mulslidd 28112 . . . . . 6 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → ( 1s ·s 𝐵) = 𝐵)
106, 8, 93eqtr3d 2777 . . . . 5 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → (𝐴 ·s (𝑤 ·s 𝐵)) = 𝐵)
11 oveq2 7364 . . . . . . 7 (𝑧 = (𝑤 ·s 𝐵) → (𝐴 ·s 𝑧) = (𝐴 ·s (𝑤 ·s 𝐵)))
1211eqeq1d 2736 . . . . . 6 (𝑧 = (𝑤 ·s 𝐵) → ((𝐴 ·s 𝑧) = 𝐵 ↔ (𝐴 ·s (𝑤 ·s 𝐵)) = 𝐵))
1312rspcev 3574 . . . . 5 (((𝑤 ·s 𝐵) ∈ No ∧ (𝐴 ·s (𝑤 ·s 𝐵)) = 𝐵) → ∃𝑧 No (𝐴 ·s 𝑧) = 𝐵)
143, 10, 13syl2anc 584 . . . 4 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → ∃𝑧 No (𝐴 ·s 𝑧) = 𝐵)
1514rexlimdvaa 3136 . . 3 ((𝐴 No 𝐴 ≠ 0s𝐵 No ) → (∃𝑤 No (𝐴 ·s 𝑤) = 1s → ∃𝑧 No (𝐴 ·s 𝑧) = 𝐵))
1615imp 406 . 2 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ ∃𝑤 No (𝐴 ·s 𝑤) = 1s ) → ∃𝑧 No (𝐴 ·s 𝑧) = 𝐵)
17 oveq2 7364 . . . . 5 (𝑥 = 𝑤 → (𝐴 ·s 𝑥) = (𝐴 ·s 𝑤))
1817eqeq1d 2736 . . . 4 (𝑥 = 𝑤 → ((𝐴 ·s 𝑥) = 1s ↔ (𝐴 ·s 𝑤) = 1s ))
1918cbvrexvw 3213 . . 3 (∃𝑥 No (𝐴 ·s 𝑥) = 1s ↔ ∃𝑤 No (𝐴 ·s 𝑤) = 1s )
2019anbi2i 623 . 2 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ ∃𝑥 No (𝐴 ·s 𝑥) = 1s ) ↔ ((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ ∃𝑤 No (𝐴 ·s 𝑤) = 1s ))
21 oveq2 7364 . . . 4 (𝑦 = 𝑧 → (𝐴 ·s 𝑦) = (𝐴 ·s 𝑧))
2221eqeq1d 2736 . . 3 (𝑦 = 𝑧 → ((𝐴 ·s 𝑦) = 𝐵 ↔ (𝐴 ·s 𝑧) = 𝐵))
2322cbvrexvw 3213 . 2 (∃𝑦 No (𝐴 ·s 𝑦) = 𝐵 ↔ ∃𝑧 No (𝐴 ·s 𝑧) = 𝐵)
2416, 20, 233imtr4i 292 1 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ ∃𝑥 No (𝐴 ·s 𝑥) = 1s ) → ∃𝑦 No (𝐴 ·s 𝑦) = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1541  wcel 2113  wne 2930  wrex 3058  (class class class)co 7356   No csur 27605   0s c0s 27793   1s c1s 27794   ·s cmuls 28075
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-tp 4583  df-op 4585  df-ot 4587  df-uni 4862  df-int 4901  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-se 5576  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-1o 8395  df-2o 8396  df-nadd 8592  df-no 27608  df-slt 27609  df-bday 27610  df-sle 27711  df-sslt 27748  df-scut 27750  df-0s 27795  df-1s 27796  df-made 27815  df-old 27816  df-left 27818  df-right 27819  df-norec 27908  df-norec2 27919  df-adds 27930  df-negs 27990  df-subs 27991  df-muls 28076
This theorem is referenced by:  noreceuw  28160
  Copyright terms: Public domain W3C validator