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

Theorem divsmulw 28236
Description: Relationship between surreal division and multiplication. Weak version that does not assume reciprocals. Later, when we prove precsex 28260, we can eliminate the existence hypothesis (see divsmul 28263). (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 28233 . . . . . 6 ((𝐴 No 𝐶 No 𝐶 ≠ 0s ) → (𝐴 /su 𝐶) = (𝑦 No (𝐶 ·s 𝑦) = 𝐴))
21eqeq1d 2742 . . . . 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 1192 . . 3 (((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) ∧ ∃𝑥 No (𝐶 ·s 𝑥) = 1s ) → 𝐵 No )
7 simp3l 1201 . . . . 5 ((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) → 𝐶 No )
8 simp3r 1202 . . . . 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 28235 . . . 4 (((𝐶 No 𝐶 ≠ 0s𝐴 No ) ∧ ∃𝑥 No (𝐶 ·s 𝑥) = 1s ) → ∃!𝑦 No (𝐶 ·s 𝑦) = 𝐴)
1210, 11sylan 579 . . 3 (((𝐴 No 𝐵 No ∧ (𝐶 No 𝐶 ≠ 0s )) ∧ ∃𝑥 No (𝐶 ·s 𝑥) = 1s ) → ∃!𝑦 No (𝐶 ·s 𝑦) = 𝐴)
13 oveq2 7456 . . . . 5 (𝑦 = 𝐵 → (𝐶 ·s 𝑦) = (𝐶 ·s 𝐵))
1413eqeq1d 2742 . . . 4 (𝑦 = 𝐵 → ((𝐶 ·s 𝑦) = 𝐴 ↔ (𝐶 ·s 𝐵) = 𝐴))
1514riota2 7430 . . 3 ((𝐵 No ∧ ∃!𝑦 No (𝐶 ·s 𝑦) = 𝐴) → ((𝐶 ·s 𝐵) = 𝐴 ↔ (𝑦 No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
166, 12, 15syl2anc 583 . 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 1087   = wceq 1537  wcel 2108  wne 2946  wrex 3076  ∃!wreu 3386  crio 7403  (class class class)co 7448   No csur 27702   0s c0s 27885   1s c1s 27886   ·s cmuls 28150   /su cdivs 28231
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-tp 4653  df-op 4655  df-ot 4657  df-uni 4932  df-int 4971  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-se 5653  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-1st 8030  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-1o 8522  df-2o 8523  df-nadd 8722  df-no 27705  df-slt 27706  df-bday 27707  df-sle 27808  df-sslt 27844  df-scut 27846  df-0s 27887  df-1s 27888  df-made 27904  df-old 27905  df-left 27907  df-right 27908  df-norec 27989  df-norec2 28000  df-adds 28011  df-negs 28071  df-subs 28072  df-muls 28151  df-divs 28232
This theorem is referenced by:  divsmulwd  28237  divs1  28247  divsmul  28263  nohalf  28425
  Copyright terms: Public domain W3C validator