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

Theorem norecdiv 28383
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 782 . . . . . 6 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → 𝑤 No )
2 simpl3 1212 . . . . . 6 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → 𝐵 No )
31, 2mulscld 28328 . . . . 5 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → (𝑤 ·s 𝐵) ∈ No )
4 oveq1 7417 . . . . . . . 8 ((𝐴 ·s 𝑤) = 1s → ((𝐴 ·s 𝑤) ·s 𝐵) = ( 1s ·s 𝐵))
54adantl 486 . . . . . . 7 ((𝑤 No ∧ (𝐴 ·s 𝑤) = 1s ) → ((𝐴 ·s 𝑤) ·s 𝐵) = ( 1s ·s 𝐵))
65adantl 486 . . . . . 6 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → ((𝐴 ·s 𝑤) ·s 𝐵) = ( 1s ·s 𝐵))
7 simpl1 1210 . . . . . . 7 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → 𝐴 No )
87, 1, 2mulsassd 28360 . . . . . 6 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → ((𝐴 ·s 𝑤) ·s 𝐵) = (𝐴 ·s (𝑤 ·s 𝐵)))
92mulslidd 28336 . . . . . 6 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → ( 1s ·s 𝐵) = 𝐵)
106, 8, 93eqtr3d 2806 . . . . 5 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → (𝐴 ·s (𝑤 ·s 𝐵)) = 𝐵)
11 oveq2 7418 . . . . . . 7 (𝑧 = (𝑤 ·s 𝐵) → (𝐴 ·s 𝑧) = (𝐴 ·s (𝑤 ·s 𝐵)))
1211eqeq1d 2765 . . . . . 6 (𝑧 = (𝑤 ·s 𝐵) → ((𝐴 ·s 𝑧) = 𝐵 ↔ (𝐴 ·s (𝑤 ·s 𝐵)) = 𝐵))
1312rspcev 3581 . . . . 5 (((𝑤 ·s 𝐵) ∈ No ∧ (𝐴 ·s (𝑤 ·s 𝐵)) = 𝐵) → ∃𝑧 No (𝐴 ·s 𝑧) = 𝐵)
143, 10, 13syl2anc 595 . . . 4 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ (𝑤 No ∧ (𝐴 ·s 𝑤) = 1s )) → ∃𝑧 No (𝐴 ·s 𝑧) = 𝐵)
1514rexlimdvaa 3167 . . 3 ((𝐴 No 𝐴 ≠ 0s𝐵 No ) → (∃𝑤 No (𝐴 ·s 𝑤) = 1s → ∃𝑧 No (𝐴 ·s 𝑧) = 𝐵))
1615imp 411 . 2 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ ∃𝑤 No (𝐴 ·s 𝑤) = 1s ) → ∃𝑧 No (𝐴 ·s 𝑧) = 𝐵)
17 oveq2 7418 . . . . 5 (𝑥 = 𝑤 → (𝐴 ·s 𝑥) = (𝐴 ·s 𝑤))
1817eqeq1d 2765 . . . 4 (𝑥 = 𝑤 → ((𝐴 ·s 𝑥) = 1s ↔ (𝐴 ·s 𝑤) = 1s ))
1918cbvrexvw 3244 . . 3 (∃𝑥 No (𝐴 ·s 𝑥) = 1s ↔ ∃𝑤 No (𝐴 ·s 𝑤) = 1s )
2019anbi2i 634 . 2 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ ∃𝑥 No (𝐴 ·s 𝑥) = 1s ) ↔ ((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ ∃𝑤 No (𝐴 ·s 𝑤) = 1s ))
21 oveq2 7418 . . . 4 (𝑦 = 𝑧 → (𝐴 ·s 𝑦) = (𝐴 ·s 𝑧))
2221eqeq1d 2765 . . 3 (𝑦 = 𝑧 → ((𝐴 ·s 𝑦) = 𝐵 ↔ (𝐴 ·s 𝑧) = 𝐵))
2322cbvrexvw 3244 . 2 (∃𝑦 No (𝐴 ·s 𝑦) = 𝐵 ↔ ∃𝑧 No (𝐴 ·s 𝑧) = 𝐵)
2416, 20, 233imtr4i 295 1 (((𝐴 No 𝐴 ≠ 0s𝐵 No ) ∧ ∃𝑥 No (𝐴 ·s 𝑥) = 1s ) → ∃𝑦 No (𝐴 ·s 𝑦) = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1103   = wceq 1570  wcel 2143  wne 2958  wrex 3089  (class class class)co 7410   No csur 27804   0s c0s 27998   1s c1s 27999   ·s cmuls 28299
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-ot 4598  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-1o 8449  df-2o 8450  df-nadd 8648  df-no 27807  df-lts 27808  df-bday 27809  df-les 27909  df-slts 27951  df-cuts 27953  df-0s 28000  df-1s 28001  df-made 28020  df-old 28021  df-left 28023  df-right 28024  df-norec 28131  df-norec2 28142  df-adds 28153  df-negs 28214  df-subs 28215  df-muls 28300
This theorem is referenced by:  noreceuw  28384
  Copyright terms: Public domain W3C validator