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

Theorem opelcn 5228
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 5220 . . 3 |- CC = (R. X. R.)
21eleq2i 1535 . 2 |- (<.A, B>. e. CC <-> <.A, B>. e. (R. X. R.))
3 opelcn.1 . . 3 |- B e. V
43opelxp 3209 . 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 956  Vcvv 1807  <.cop 2407   X. cxp 3163  R.cnr 4973  CCcc 5212
This theorem is referenced by:  axicn 5250
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-pow 2737  ax-pr 2774
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-op 2412  df-opab 2662  df-xp 3179  df-c 5220
Copyright terms: Public domain