Theorem cnegexlem1 8132

Description: Addition cancellation of a real number from two complex numbers. Lemma for cnegex 8135. (Contributed by Eric Schmidt, 22-May-2007.)

Assertion

Ref	Expression
cnegexlem1	|- ( ( A e. RR /\ B e. CC /\ C e. CC ) -> ( ( A + B ) = ( A + C ) <-> B = C ) )

Proof of Theorem cnegexlem1

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-rnegex 7920	. . . 4 |- ( A e. RR -> E. x e. RR ( A + x ) = 0 )
2	1	3ad2ant1 1018	. . 3 |- ( ( A e. RR /\ B e. CC /\ C e. CC ) -> E. x e. RR ( A + x ) = 0 )
3		recn 7944	. . . 4 |- ( A e. RR -> A e. CC )
4		recn 7944	. . . . . . 7 |- ( x e. RR -> x e. CC )
5		oveq2 5883	. . . . . . . . . . 11 |- ( ( A + B ) = ( A + C ) -> ( x + ( A + B ) ) = ( x + ( A + C ) ) )
6		simpr 110	. . . . . . . . . . . . 13 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> x e. CC )
7		simpll 527	. . . . . . . . . . . . 13 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> A e. CC )
8		simplrl 535	. . . . . . . . . . . . 13 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> B e. CC )
9	6, 7, 8	addassd 7980	. . . . . . . . . . . 12 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> ( ( x + A ) + B ) = ( x + ( A + B ) ) )
10		simplrr 536	. . . . . . . . . . . . 13 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> C e. CC )
11	6, 7, 10	addassd 7980	. . . . . . . . . . . 12 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> ( ( x + A ) + C ) = ( x + ( A + C ) ) )
12	9, 11	eqeq12d 2192	. . . . . . . . . . 11 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> ( ( ( x + A ) + B ) = ( ( x + A ) + C ) <-> ( x + ( A + B ) ) = ( x + ( A + C ) ) ) )
13	5, 12	imbitrrid 156	. . . . . . . . . 10 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> ( ( A + B ) = ( A + C ) -> ( ( x + A ) + B ) = ( ( x + A ) + C ) ) )
14	13	adantr 276	. . . . . . . . 9 |- ( ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) /\ ( A + x ) = 0 ) -> ( ( A + B ) = ( A + C ) -> ( ( x + A ) + B ) = ( ( x + A ) + C ) ) )
15		addcom 8094	. . . . . . . . . . . . 13 |- ( ( A e. CC /\ x e. CC ) -> ( A + x ) = ( x + A ) )
16	15	eqeq1d 2186	. . . . . . . . . . . 12 |- ( ( A e. CC /\ x e. CC ) -> ( ( A + x ) = 0 <-> ( x + A ) = 0 ) )
17	16	adantlr 477	. . . . . . . . . . 11 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> ( ( A + x ) = 0 <-> ( x + A ) = 0 ) )
18		oveq1 5882	. . . . . . . . . . . . . . 15 |- ( ( x + A ) = 0 -> ( ( x + A ) + B ) = ( 0 + B ) )
19		oveq1 5882	. . . . . . . . . . . . . . 15 |- ( ( x + A ) = 0 -> ( ( x + A ) + C ) = ( 0 + C ) )
20	18, 19	eqeq12d 2192	. . . . . . . . . . . . . 14 |- ( ( x + A ) = 0 -> ( ( ( x + A ) + B ) = ( ( x + A ) + C ) <-> ( 0 + B ) = ( 0 + C ) ) )
21	20	adantl 277	. . . . . . . . . . . . 13 |- ( ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) /\ ( x + A ) = 0 ) -> ( ( ( x + A ) + B ) = ( ( x + A ) + C ) <-> ( 0 + B ) = ( 0 + C ) ) )
22		addlid 8096	. . . . . . . . . . . . . . . 16 |- ( B e. CC -> ( 0 + B ) = B )
23		addlid 8096	. . . . . . . . . . . . . . . 16 |- ( C e. CC -> ( 0 + C ) = C )
24	22, 23	eqeqan12d 2193	. . . . . . . . . . . . . . 15 |- ( ( B e. CC /\ C e. CC ) -> ( ( 0 + B ) = ( 0 + C ) <-> B = C ) )
25	24	adantl 277	. . . . . . . . . . . . . 14 |- ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) -> ( ( 0 + B ) = ( 0 + C ) <-> B = C ) )
26	25	ad2antrr 488	. . . . . . . . . . . . 13 |- ( ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) /\ ( x + A ) = 0 ) -> ( ( 0 + B ) = ( 0 + C ) <-> B = C ) )
27	21, 26	bitrd 188	. . . . . . . . . . . 12 |- ( ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) /\ ( x + A ) = 0 ) -> ( ( ( x + A ) + B ) = ( ( x + A ) + C ) <-> B = C ) )
28	27	ex 115	. . . . . . . . . . 11 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> ( ( x + A ) = 0 -> ( ( ( x + A ) + B ) = ( ( x + A ) + C ) <-> B = C ) ) )
29	17, 28	sylbid 150	. . . . . . . . . 10 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> ( ( A + x ) = 0 -> ( ( ( x + A ) + B ) = ( ( x + A ) + C ) <-> B = C ) ) )
30	29	imp 124	. . . . . . . . 9 |- ( ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) /\ ( A + x ) = 0 ) -> ( ( ( x + A ) + B ) = ( ( x + A ) + C ) <-> B = C ) )
31	14, 30	sylibd 149	. . . . . . . 8 |- ( ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) /\ ( A + x ) = 0 ) -> ( ( A + B ) = ( A + C ) -> B = C ) )
32	31	ex 115	. . . . . . 7 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. CC ) -> ( ( A + x ) = 0 -> ( ( A + B ) = ( A + C ) -> B = C ) ) )
33	4, 32	sylan2 286	. . . . . 6 |- ( ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) /\ x e. RR ) -> ( ( A + x ) = 0 -> ( ( A + B ) = ( A + C ) -> B = C ) ) )
34	33	rexlimdva 2594	. . . . 5 |- ( ( A e. CC /\ ( B e. CC /\ C e. CC ) ) -> ( E. x e. RR ( A + x ) = 0 -> ( ( A + B ) = ( A + C ) -> B = C ) ) )
35	34	3impb 1199	. . . 4 |- ( ( A e. CC /\ B e. CC /\ C e. CC ) -> ( E. x e. RR ( A + x ) = 0 -> ( ( A + B ) = ( A + C ) -> B = C ) ) )
36	3, 35	syl3an1 1271	. . 3 |- ( ( A e. RR /\ B e. CC /\ C e. CC ) -> ( E. x e. RR ( A + x ) = 0 -> ( ( A + B ) = ( A + C ) -> B = C ) ) )
37	2, 36	mpd 13	. 2 |- ( ( A e. RR /\ B e. CC /\ C e. CC ) -> ( ( A + B ) = ( A + C ) -> B = C ) )
38		oveq2 5883	. 2 |- ( B = C -> ( A + B ) = ( A + C ) )
39	37, 38	impbid1 142	1 |- ( ( A e. RR /\ B e. CC /\ C e. CC ) -> ( ( A + B ) = ( A + C ) <-> B = C ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 978   = wceq 1353   e. wcel 2148   E.wrex 2456  (class class class)co 5875   CCcc 7809   RRcr 7810   0cc0 7811   + caddc 7814

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159  ax-resscn 7903  ax-1cn 7904  ax-icn 7906  ax-addcl 7907  ax-mulcl 7909  ax-addcom 7911  ax-addass 7913  ax-i2m1 7916  ax-0id 7919  ax-rnegex 7920

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2740  df-un 3134  df-in 3136  df-ss 3143  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-br 4005  df-iota 5179  df-fv 5225  df-ov 5878

This theorem is referenced by:  cnegexlem3  8134