Theorem rereim 8914

Description: Decomposition of a real number into real part (itself) and imaginary part (zero). (Contributed by Jim Kingdon, 30-Jan-2020.)

Assertion

Ref	Expression
rereim	|- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> ( B = A /\ C = 0 ) )

Proof of Theorem rereim

Step	Hyp	Ref	Expression
1		simpll 531	. . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> A e. RR )
2	1	recnd 8354	. . . 4 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> A e. CC )
3		simplr 533	. . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> B e. RR )
4	3	recnd 8354	. . . 4 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> B e. CC )
5		simprr 537	. . . . . . 7 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> A = ( B + ( _i x. C ) ) )
6	5	eqcomd 2244	. . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> ( B + ( _i x. C ) ) = A )
7		ax-icn 8274	. . . . . . . . 9 |- _i e. CC
8	7	a1i 9	. . . . . . . 8 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> _i e. CC )
9		simprl 535	. . . . . . . . 9 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> C e. RR )
10	9	recnd 8354	. . . . . . . 8 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> C e. CC )
11	8, 10	mulcld 8346	. . . . . . 7 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> ( _i x. C ) e. CC )
12	2, 4, 11	subaddd 8655	. . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> ( ( A - B ) = ( _i x. C ) <-> ( B + ( _i x. C ) ) = A ) )
13	6, 12	mpbird 167	. . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> ( A - B ) = ( _i x. C ) )
14	1, 3	resubcld 8708	. . . . . . . . 9 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> ( A - B ) e. RR )
15	13, 14	eqeltrrd 2316	. . . . . . . 8 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> ( _i x. C ) e. RR )
16		rimul 8913	. . . . . . . 8 |- ( ( C e. RR /\ ( _i x. C ) e. RR ) -> C = 0 )
17	9, 15, 16	syl2anc 415	. . . . . . 7 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> C = 0 )
18	17	oveq2d 6101	. . . . . 6 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> ( _i x. C ) = ( _i x. 0 ) )
19	7	mul01i 8718	. . . . . 6 |- ( _i x. 0 ) = 0
20	18, 19	eqtrdi 2287	. . . . 5 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> ( _i x. C ) = 0 )
21	13, 20	eqtrd 2271	. . . 4 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> ( A - B ) = 0 )
22	2, 4, 21	subeq0d 8645	. . 3 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> A = B )
23	22	eqcomd 2244	. 2 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> B = A )
24	23, 17	jca 306	1 |- ( ( ( A e. RR /\ B e. RR ) /\ ( C e. RR /\ A = ( B + ( _i x. C ) ) ) ) -> ( B = A /\ C = 0 ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209  (class class class)co 6085   CCcc 8177   RRcr 8178   0cc0 8179   _ici 8181   + caddc 8182   x. cmul 8184   - cmin 8497

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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296

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 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-sub 8499  df-neg 8500  df-reap 8903

This theorem is used by:  apreap  8915