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

Theorem divsmulw 28096
Description: Relationship between surreal division and multiplication. Weak version that does not assume reciprocals. Later, when we prove precsex 28120, we can eliminate the existence hypothesis (see divsmul 28123). (Contributed by Scott Fenton, 12-Mar-2025.)
Assertion
Ref Expression
divsmulw (((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) ∧ ∃𝑥 No (𝐶 ·s 𝑥) = 1s ) → ((𝐴 /su 𝐶) = 𝐵 ↔ (𝐶 ·s 𝐵) = 𝐴))
Distinct variable group:   𝑥,𝐶
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem divsmulw
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 divsval 28092 . . . . . 6 ((𝐴 No 𝐶 No 𝐶 ≠ 0s ) → (𝐴 /su 𝐶) = (𝑦 No (𝐶 ·s 𝑦) = 𝐴))
21eqeq1d 2731 . . . . 5 ((𝐴 No 𝐶 No 𝐶 ≠ 0s ) → ((𝐴 /su 𝐶) = 𝐵 ↔ (𝑦 No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
323expb 1120 . . . 4 ((𝐴 No ∧ (𝐶 No 𝐶 ≠ 0s )) → ((𝐴 /su 𝐶) = 𝐵 ↔ (𝑦 No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
433adant2 1131 . . 3 ((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) → ((𝐴 /su 𝐶) = 𝐵 ↔ (𝑦 No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
54adantr 480 . 2 (((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) ∧ ∃𝑥 No (𝐶 ·s 𝑥) = 1s ) → ((𝐴 /su 𝐶) = 𝐵 ↔ (𝑦 No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
6 simpl2 1193 . . 3 (((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) ∧ ∃𝑥 No (𝐶 ·s 𝑥) = 1s ) → 𝐵 No )
7 simp3l 1202 . . . . 5 ((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) → 𝐶 No )
8 simp3r 1203 . . . . 5 ((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) → 𝐶 ≠ 0s )
9 simp1 1136 . . . . 5 ((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) → 𝐴 No )
107, 8, 93jca 1128 . . . 4 ((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) → (𝐶 No 𝐶 ≠ 0s𝐴 No ))
11 noreceuw 28094 . . . 4 (((𝐶 No 𝐶 ≠ 0s𝐴 No ) ∧ ∃𝑥 No (𝐶 ·s 𝑥) = 1s ) → ∃!𝑦 No (𝐶 ·s 𝑦) = 𝐴)
1210, 11sylan 580 . . 3 (((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) ∧ ∃𝑥 No (𝐶 ·s 𝑥) = 1s ) → ∃!𝑦 No (𝐶 ·s 𝑦) = 𝐴)
13 oveq2 7395 . . . . 5 (𝑦 = 𝐵 → (𝐶 ·s 𝑦) = (𝐶 ·s 𝐵))
1413eqeq1d 2731 . . . 4 (𝑦 = 𝐵 → ((𝐶 ·s 𝑦) = 𝐴 ↔ (𝐶 ·s 𝐵) = 𝐴))
1514riota2 7369 . . 3 ((𝐵 No ∧ ∃!𝑦 No (𝐶 ·s 𝑦) = 𝐴) → ((𝐶 ·s 𝐵) = 𝐴 ↔ (𝑦 No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
166, 12, 15syl2anc 584 . 2 (((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) ∧ ∃𝑥 No (𝐶 ·s 𝑥) = 1s ) → ((𝐶 ·s 𝐵) = 𝐴 ↔ (𝑦 No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
175, 16bitr4d 282 1 (((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) ∧ ∃𝑥 No (𝐶 ·s 𝑥) = 1s ) → ((𝐴 /su 𝐶) = 𝐵 ↔ (𝐶 ·s 𝐵) = 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109  wne 2925  wrex 3053  ∃!wreu 3352  crio 7343  (class class class)co 7387   No csur 27551   0s c0s 27734   1s c1s 27735   ·s cmuls 28009   /su cdivs 28090
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-ot 4598  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-se 5592  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-1o 8434  df-2o 8435  df-nadd 8630  df-no 27554  df-slt 27555  df-bday 27556  df-sle 27657  df-sslt 27693  df-scut 27695  df-0s 27736  df-1s 27737  df-made 27755  df-old 27756  df-left 27758  df-right 27759  df-norec 27845  df-norec2 27856  df-adds 27867  df-negs 27927  df-subs 27928  df-muls 28010  df-divs 28091
This theorem is referenced by:  divsmulwd  28097  divs1  28107  divsmul  28123
  Copyright terms: Public domain W3C validator