Theorem creui 9290

Description: The imaginary part of a complex number is unique. Proposition 10-1.3 of [Gleason] p. 130. (Contributed by NM, 9-May-1999.) (Proof shortened by Mario Carneiro, 27-May-2016.)

Assertion

Ref	Expression
creui	|- ( A e. CC -> E! y e. RR E. x e. RR A = ( x + ( _i x. y ) ) )

Distinct variable group:   x, y, A

Proof of Theorem creui

Dummy variables z w are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnre 8322	. 2 |- ( A e. CC -> E. z e. RR E. w e. RR A = ( z + ( _i x. w ) ) )
2		simpr 110	. . . . 5 |- ( ( z e. RR /\ w e. RR ) -> w e. RR )
3		eqcom 2240	. . . . . . . . . 10 |- ( ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) <-> ( x + ( _i x. y ) ) = ( z + ( _i x. w ) ) )
4		cru 8930	. . . . . . . . . . 11 |- ( ( ( x e. RR /\ y e. RR ) /\ ( z e. RR /\ w e. RR ) ) -> ( ( x + ( _i x. y ) ) = ( z + ( _i x. w ) ) <-> ( x = z /\ y = w ) ) )
5	4	ancoms 268	. . . . . . . . . 10 |- ( ( ( z e. RR /\ w e. RR ) /\ ( x e. RR /\ y e. RR ) ) -> ( ( x + ( _i x. y ) ) = ( z + ( _i x. w ) ) <-> ( x = z /\ y = w ) ) )
6	3, 5	bitrid 192	. . . . . . . . 9 |- ( ( ( z e. RR /\ w e. RR ) /\ ( x e. RR /\ y e. RR ) ) -> ( ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) <-> ( x = z /\ y = w ) ) )
7	6	anass1rs 577	. . . . . . . 8 |- ( ( ( ( z e. RR /\ w e. RR ) /\ y e. RR ) /\ x e. RR ) -> ( ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) <-> ( x = z /\ y = w ) ) )
8	7	rexbidva 2547	. . . . . . 7 |- ( ( ( z e. RR /\ w e. RR ) /\ y e. RR ) -> ( E. x e. RR ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) <-> E. x e. RR ( x = z /\ y = w ) ) )
9		biidd 172	. . . . . . . . 9 |- ( x = z -> ( y = w <-> y = w ) )
10	9	ceqsrexv 2956	. . . . . . . 8 |- ( z e. RR -> ( E. x e. RR ( x = z /\ y = w ) <-> y = w ) )
11	10	ad2antrr 492	. . . . . . 7 |- ( ( ( z e. RR /\ w e. RR ) /\ y e. RR ) -> ( E. x e. RR ( x = z /\ y = w ) <-> y = w ) )
12	8, 11	bitrd 188	. . . . . 6 |- ( ( ( z e. RR /\ w e. RR ) /\ y e. RR ) -> ( E. x e. RR ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) <-> y = w ) )
13	12	ralrimiva 2623	. . . . 5 |- ( ( z e. RR /\ w e. RR ) -> A. y e. RR ( E. x e. RR ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) <-> y = w ) )
14		reu6i 3017	. . . . 5 |- ( ( w e. RR /\ A. y e. RR ( E. x e. RR ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) <-> y = w ) ) -> E! y e. RR E. x e. RR ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) )
15	2, 13, 14	syl2anc 415	. . . 4 |- ( ( z e. RR /\ w e. RR ) -> E! y e. RR E. x e. RR ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) )
16		eqeq1 2245	. . . . . 6 |- ( A = ( z + ( _i x. w ) ) -> ( A = ( x + ( _i x. y ) ) <-> ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) ) )
17	16	rexbidv 2551	. . . . 5 |- ( A = ( z + ( _i x. w ) ) -> ( E. x e. RR A = ( x + ( _i x. y ) ) <-> E. x e. RR ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) ) )
18	17	reubidv 2737	. . . 4 |- ( A = ( z + ( _i x. w ) ) -> ( E! y e. RR E. x e. RR A = ( x + ( _i x. y ) ) <-> E! y e. RR E. x e. RR ( z + ( _i x. w ) ) = ( x + ( _i x. y ) ) ) )
19	15, 18	syl5ibrcom 157	. . 3 |- ( ( z e. RR /\ w e. RR ) -> ( A = ( z + ( _i x. w ) ) -> E! y e. RR E. x e. RR A = ( x + ( _i x. y ) ) ) )
20	19	rexlimivv 2674	. 2 |- ( E. z e. RR E. w e. RR A = ( z + ( _i x. w ) ) -> E! y e. RR E. x e. RR A = ( x + ( _i x. y ) ) )
21	1, 20	syl 14	1 |- ( A e. CC -> E! y e. RR E. x e. RR A = ( x + ( _i x. y ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   E.wrex 2529   E!wreu 2530  (class class class)co 6085   CCcc 8177   RRcr 8178   _ici 8181   + caddc 8182   x. cmul 8184

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: (None)