HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem opelcn 5260
Description: Ordered pair membership in the class of complex numbers.
Hypothesis
Ref Expression
opelcn.1 |- B e. V
Assertion
Ref Expression
opelcn |- (<.A, B>. e. CC <-> (A e. R. /\ B e. R.))

Proof of Theorem opelcn
StepHypRef Expression
1 df-c 5252 . . 3 |- CC = (R. X. R.)
21eleq2i 1541 . 2 |- (<.A, B>. e. CC <-> <.A, B>. e. (R. X. R.))
3 opelcn.1 . . 3 |- B e. V
43opelxp 3220 . 2 |- (<.A, B>. e. (R. X. R.) <-> (A e. R. /\ B e. R.))
52, 4bitr 173 1 |- (<.A, B>. e. CC <-> (A e. R. /\ B e. R.))
Colors of variables: wff set class
Syntax hints:   <-> wb 146   /\ wa 223   e. wcel 960  Vcvv 1814  <.cop 2415   X. cxp 3174  R.cnr 5005  CCcc 5244
This theorem is referenced by:  axicn 5282
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-opab 2672  df-xp 3190  df-c 5252
Copyright terms: Public domain