Theorem divmulsw 28189

Description: Relationship between surreal division and multiplication. Weak version that does not assume reciprocals. Later, when we prove precsex 28214, we can eliminate the existence hypothesis (see divmuls 28217). (Contributed by Scott Fenton, 12-Mar-2025.)

Assertion

Ref	Expression
divmulsw	⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ (𝐶 ∈ No ∧ 𝐶 ≠ 0s )) ∧ ∃𝑥 ∈ No (𝐶 ·s 𝑥) = 1s ) → ((𝐴 /su 𝐶) = 𝐵 ↔ (𝐶 ·s 𝐵) = 𝐴))

Distinct variable group:   𝑥,𝐶

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem divmulsw

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		divsval 28185	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝐶 ∈ No ∧ 𝐶 ≠ 0s ) → (𝐴 /su 𝐶) = (℩𝑦 ∈ No (𝐶 ·s 𝑦) = 𝐴))
2	1	eqeq1d 2738	. . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐶 ∈ No ∧ 𝐶 ≠ 0s ) → ((𝐴 /su 𝐶) = 𝐵 ↔ (℩𝑦 ∈ No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
3	2	3expb 1120	. . . 4 ⊢ ((𝐴 ∈ No ∧ (𝐶 ∈ No ∧ 𝐶 ≠ 0s )) → ((𝐴 /su 𝐶) = 𝐵 ↔ (℩𝑦 ∈ No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
4	3	3adant2 1131	. . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ (𝐶 ∈ No ∧ 𝐶 ≠ 0s )) → ((𝐴 /su 𝐶) = 𝐵 ↔ (℩𝑦 ∈ No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
5	4	adantr 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 )
10	7, 8, 9	3jca 1128	. . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ (𝐶 ∈ No ∧ 𝐶 ≠ 0s )) → (𝐶 ∈ No ∧ 𝐶 ≠ 0s ∧ 𝐴 ∈ No ))
11		noreceuw 28187	. . . 4 ⊢ (((𝐶 ∈ No ∧ 𝐶 ≠ 0s ∧ 𝐴 ∈ No ) ∧ ∃𝑥 ∈ No (𝐶 ·s 𝑥) = 1s ) → ∃!𝑦 ∈ No (𝐶 ·s 𝑦) = 𝐴)
12	10, 11	sylan 580	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ (𝐶 ∈ No ∧ 𝐶 ≠ 0s )) ∧ ∃𝑥 ∈ No (𝐶 ·s 𝑥) = 1s ) → ∃!𝑦 ∈ No (𝐶 ·s 𝑦) = 𝐴)
13		oveq2 7366	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐶 ·s 𝑦) = (𝐶 ·s 𝐵))
14	13	eqeq1d 2738	. . . 4 ⊢ (𝑦 = 𝐵 → ((𝐶 ·s 𝑦) = 𝐴 ↔ (𝐶 ·s 𝐵) = 𝐴))
15	14	riota2 7340	. . 3 ⊢ ((𝐵 ∈ No ∧ ∃!𝑦 ∈ No (𝐶 ·s 𝑦) = 𝐴) → ((𝐶 ·s 𝐵) = 𝐴 ↔ (℩𝑦 ∈ No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
16	6, 12, 15	syl2anc 584	. 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ (𝐶 ∈ No ∧ 𝐶 ≠ 0s )) ∧ ∃𝑥 ∈ No (𝐶 ·s 𝑥) = 1s ) → ((𝐶 ·s 𝐵) = 𝐴 ↔ (℩𝑦 ∈ No (𝐶 ·s 𝑦) = 𝐴) = 𝐵))
17	5, 16	bitr4d 282	1 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ (𝐶 ∈ No ∧ 𝐶 ≠ 0s )) ∧ ∃𝑥 ∈ No (𝐶 ·s 𝑥) = 1s ) → ((𝐴 /su 𝐶) = 𝐵 ↔ (𝐶 ·s 𝐵) = 𝐴))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ≠ wne 2932  ∃wrex 3060  ∃!wreu 3348  ℩crio 7314  (class class class)co 7358   No csur 27607   0_s c0s 27801   1_s c1s 27802   ·_s cmuls 28102   /_su cdivs 28183

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 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-tp 4585  df-op 4587  df-ot 4589  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-1o 8397  df-2o 8398  df-nadd 8594  df-no 27610  df-lts 27611  df-bday 27612  df-les 27713  df-slts 27754  df-cuts 27756  df-0s 27803  df-1s 27804  df-made 27823  df-old 27824  df-left 27826  df-right 27827  df-norec 27934  df-norec2 27945  df-adds 27956  df-negs 28017  df-subs 28018  df-muls 28103  df-divs 28184

This theorem is referenced by:  divmulswd  28190  divs1  28200  divmuls  28217