Theorem reapmul1 8931

Description: Multiplication of both sides of real apartness by a real number apart from zero. Special case of apmul1 9126. (Contributed by Jim Kingdon, 8-Feb-2020.)

Assertion

Ref	Expression
reapmul1	|- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C # 0 ) ) -> ( A # B <-> ( A x. C ) # ( B x. C ) ) )

Proof of Theorem reapmul1

Step	Hyp	Ref	Expression
1		0re 8332	. . . . 5 |- 0 e. RR
2		reaplt 8924	. . . . 5 |- ( ( C e. RR /\ 0 e. RR ) -> ( C # 0 <-> ( C < 0 \/ 0 < C ) ) )
3	1, 2	mpan2 429	. . . 4 |- ( C e. RR -> ( C # 0 <-> ( C < 0 \/ 0 < C ) ) )
4	3	pm5.32i 458	. . 3 |- ( ( C e. RR /\ C # 0 ) <-> ( C e. RR /\ ( C < 0 \/ 0 < C ) ) )
5		simp1 1028	. . . . . . . . . . 11 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> A e. RR )
6	5	recnd 8360	. . . . . . . . . 10 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> A e. CC )
7		simp3l 1056	. . . . . . . . . . 11 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> C e. RR )
8	7	recnd 8360	. . . . . . . . . 10 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> C e. CC )
9	6, 8	mulneg2d 8746	. . . . . . . . 9 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( A x. -u C ) = -u ( A x. C ) )
10		simp2 1029	. . . . . . . . . . 11 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> B e. RR )
11	10	recnd 8360	. . . . . . . . . 10 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> B e. CC )
12	11, 8	mulneg2d 8746	. . . . . . . . 9 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( B x. -u C ) = -u ( B x. C ) )
13	9, 12	breq12d 4144	. . . . . . . 8 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( ( A x. -u C ) # ( B x. -u C ) <-> -u ( A x. C ) # -u ( B x. C ) ) )
14	7	renegcld 8714	. . . . . . . . 9 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> -u C e. RR )
15		simp3r 1057	. . . . . . . . . 10 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> C < 0 )
16	7	lt0neg1d 8850	. . . . . . . . . 10 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( C < 0 <-> 0 < -u C ) )
17	15, 16	mpbid 147	. . . . . . . . 9 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> 0 < -u C )
18		reapmul1lem 8930	. . . . . . . . 9 |- ( ( A e. RR /\ B e. RR /\ ( -u C e. RR /\ 0 < -u C ) ) -> ( A # B <-> ( A x. -u C ) # ( B x. -u C ) ) )
19	5, 10, 14, 17, 18	syl112anc 1282	. . . . . . . 8 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( A # B <-> ( A x. -u C ) # ( B x. -u C ) ) )
20	5, 7	remulcld 8362	. . . . . . . . . . 11 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( A x. C ) e. RR )
21	10, 7	remulcld 8362	. . . . . . . . . . 11 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( B x. C ) e. RR )
22	20, 21	ltnegd 8858	. . . . . . . . . 10 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( ( A x. C ) < ( B x. C ) <-> -u ( B x. C ) < -u ( A x. C ) ) )
23	21, 20	ltnegd 8858	. . . . . . . . . 10 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( ( B x. C ) < ( A x. C ) <-> -u ( A x. C ) < -u ( B x. C ) ) )
24	22, 23	orbi12d 805	. . . . . . . . 9 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( ( ( A x. C ) < ( B x. C ) \/ ( B x. C ) < ( A x. C ) ) <-> ( -u ( B x. C ) < -u ( A x. C ) \/ -u ( A x. C ) < -u ( B x. C ) ) ) )
25		reaplt 8924	. . . . . . . . . 10 |- ( ( ( A x. C ) e. RR /\ ( B x. C ) e. RR ) -> ( ( A x. C ) # ( B x. C ) <-> ( ( A x. C ) < ( B x. C ) \/ ( B x. C ) < ( A x. C ) ) ) )
26	20, 21, 25	syl2anc 415	. . . . . . . . 9 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( ( A x. C ) # ( B x. C ) <-> ( ( A x. C ) < ( B x. C ) \/ ( B x. C ) < ( A x. C ) ) ) )
27	20	renegcld 8714	. . . . . . . . . . 11 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> -u ( A x. C ) e. RR )
28	21	renegcld 8714	. . . . . . . . . . 11 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> -u ( B x. C ) e. RR )
29		reaplt 8924	. . . . . . . . . . 11 |- ( ( -u ( A x. C ) e. RR /\ -u ( B x. C ) e. RR ) -> ( -u ( A x. C ) # -u ( B x. C ) <-> ( -u ( A x. C ) < -u ( B x. C ) \/ -u ( B x. C ) < -u ( A x. C ) ) ) )
30	27, 28, 29	syl2anc 415	. . . . . . . . . 10 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( -u ( A x. C ) # -u ( B x. C ) <-> ( -u ( A x. C ) < -u ( B x. C ) \/ -u ( B x. C ) < -u ( A x. C ) ) ) )
31		orcom 740	. . . . . . . . . 10 |- ( ( -u ( A x. C ) < -u ( B x. C ) \/ -u ( B x. C ) < -u ( A x. C ) ) <-> ( -u ( B x. C ) < -u ( A x. C ) \/ -u ( A x. C ) < -u ( B x. C ) ) )
32	30, 31	bitrdi 196	. . . . . . . . 9 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( -u ( A x. C ) # -u ( B x. C ) <-> ( -u ( B x. C ) < -u ( A x. C ) \/ -u ( A x. C ) < -u ( B x. C ) ) ) )
33	24, 26, 32	3bitr4d 220	. . . . . . . 8 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( ( A x. C ) # ( B x. C ) <-> -u ( A x. C ) # -u ( B x. C ) ) )
34	13, 19, 33	3bitr4d 220	. . . . . . 7 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C < 0 ) ) -> ( A # B <-> ( A x. C ) # ( B x. C ) ) )
35	34	3expa 1234	. . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ C < 0 ) ) -> ( A # B <-> ( A x. C ) # ( B x. C ) ) )
36	35	anassrs 404	. . . . 5 |- ( ( ( ( A e. RR /\ B e. RR ) /\ C e. RR ) /\ C < 0 ) -> ( A # B <-> ( A x. C ) # ( B x. C ) ) )
37		reapmul1lem 8930	. . . . . . 7 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( A # B <-> ( A x. C ) # ( B x. C ) ) )
38	37	3expa 1234	. . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ 0 < C ) ) -> ( A # B <-> ( A x. C ) # ( B x. C ) ) )
39	38	anassrs 404	. . . . 5 |- ( ( ( ( A e. RR /\ B e. RR ) /\ C e. RR ) /\ 0 < C ) -> ( A # B <-> ( A x. C ) # ( B x. C ) ) )
40	36, 39	jaodan 809	. . . 4 |- ( ( ( ( A e. RR /\ B e. RR ) /\ C e. RR ) /\ ( C < 0 \/ 0 < C ) ) -> ( A # B <-> ( A x. C ) # ( B x. C ) ) )
41	40	anasss 403	. . 3 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ ( C < 0 \/ 0 < C ) ) ) -> ( A # B <-> ( A x. C ) # ( B x. C ) ) )
42	4, 41	sylan2b 287	. 2 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ C # 0 ) ) -> ( A # B <-> ( A x. C ) # ( B x. C ) ) )
43	42	3impa 1225	1 |- ( ( A e. RR /\ B e. RR /\ ( C e. RR /\ C # 0 ) ) -> ( A # B <-> ( A x. C ) # ( B x. C ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   /\ w3a 1009   e. wcel 2209   class class class wbr 4131  (class class class)co 6088   RRcr 8184   0cc0 8185   x. cmul 8190   < clt 8366   -ucneg 8505   # cap 8917

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-mulrcl 8284  ax-addcom 8285  ax-mulcom 8286  ax-addass 8287  ax-mulass 8288  ax-distr 8289  ax-i2m1 8290  ax-0lt1 8291  ax-1rid 8292  ax-0id 8293  ax-rnegex 8294  ax-precex 8295  ax-cnre 8296  ax-pre-ltirr 8297  ax-pre-lttrn 8299  ax-pre-apti 8300  ax-pre-ltadd 8301  ax-pre-mulgt0 8302

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-iota 5340  df-fun 5382  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-sub 8506  df-neg 8507  df-reap 8911  df-ap 8918

This theorem is used by: (None)