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

Theorem divsmo 28627
Description: Uniqueness of surreal inversion. Given a nonzero surreal 𝐴, there is at most one surreal giving a particular product. (Contributed by Scott Fenton, 10-Mar-2025.)
Assertion
Ref Expression
divsmo ((𝐴 ∈ No ∧ 𝐴 ≠ 0s ) → ∃*𝑥 ∈ No (𝐴 ·s 𝑥) = 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem divsmo
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eqtr3 2785 . . . 4 (((𝐴 ·s 𝑥) = 𝐵 ∧ (𝐴 ·s 𝑦) = 𝐵) → (𝐴 ·s 𝑥) = (𝐴 ·s 𝑦))
2 simprl 783 . . . . 5 (((𝐴 ∈ No ∧ 𝐴 ≠ 0s ) ∧ (𝑥 ∈ No ∧ 𝑦 ∈ No)) → 𝑥 ∈ No)
3 simprr 785 . . . . 5 (((𝐴 ∈ No ∧ 𝐴 ≠ 0s ) ∧ (𝑥 ∈ No ∧ 𝑦 ∈ No)) → 𝑦 ∈ No)
4 simpll 779 . . . . 5 (((𝐴 ∈ No ∧ 𝐴 ≠ 0s ) ∧ (𝑥 ∈ No ∧ 𝑦 ∈ No)) → 𝐴 ∈ No)
5 simplr 781 . . . . 5 (((𝐴 ∈ No ∧ 𝐴 ≠ 0s ) ∧ (𝑥 ∈ No ∧ 𝑦 ∈ No)) → 𝐴 ≠ 0s )
62, 3, 4, 5mulscan1d 28623 . . . 4 (((𝐴 ∈ No ∧ 𝐴 ≠ 0s ) ∧ (𝑥 ∈ No ∧ 𝑦 ∈ No)) → ((𝐴 ·s 𝑥) = (𝐴 ·s 𝑦) ↔ 𝑥 = 𝑦))
71, 6imbitrid 247 . . 3 (((𝐴 ∈ No ∧ 𝐴 ≠ 0s ) ∧ (𝑥 ∈ No ∧ 𝑦 ∈ No)) → (((𝐴 ·s 𝑥) = 𝐵 ∧ (𝐴 ·s 𝑦) = 𝐵) → 𝑥 = 𝑦))
87ralrimivva 3209 . 2 ((𝐴 ∈ No ∧ 𝐴 ≠ 0s ) → ∀𝑥 ∈ No ∀𝑦 ∈ No (((𝐴 ·s 𝑥) = 𝐵 ∧ (𝐴 ·s 𝑦) = 𝐵) → 𝑥 = 𝑦))
9 oveq2 7459 . . . 4 (𝑥 = 𝑦 → (𝐴 ·s 𝑥) = (𝐴 ·s 𝑦))
109eqeq1d 2765 . . 3 (𝑥 = 𝑦 → ((𝐴 ·s 𝑥) = 𝐵 ↔ (𝐴 ·s 𝑦) = 𝐵))
1110rmo4 3691 . 2 (∃*𝑥 ∈ No (𝐴 ·s 𝑥) = 𝐵 ↔ ∀𝑥 ∈ No ∀𝑦 ∈ No (((𝐴 ·s 𝑥) = 𝐵 ∧ (𝐴 ·s 𝑦) = 𝐵) → 𝑥 = 𝑦))
128, 11sylibr 237 1 ((𝐴 ∈ No ∧ 𝐴 ≠ 0s ) → ∃*𝑥 ∈ No (𝐴 ·s 𝑥) = 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃*wrmo 3368  (class class class)co 7451  Nocsur 28054   0s c0s 28248   ·s cmuls 28549
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-ot 4864  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-1o 8514  df-2o 8515  df-nadd 8713  df-no 28057  df-lts 28058  df-bday 28059  df-les 28159  df-slts 28201  df-cuts 28203  df-0s 28250  df-made 28270  df-old 28271  df-left 28273  df-right 28274  df-norec 28381  df-norec2 28392  df-adds 28403  df-negs 28464  df-subs 28465  df-muls 28550
This theorem is used by:  noreceuw  28634
  Copyright terms: Public domain W3C validator