ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cnm Unicode version

Theorem cnm 7664
Description: A complex number is an inhabited set. Note: do not use this after the real number axioms are developed, since it is a construction-dependent property. (Contributed by Jim Kingdon, 23-Oct-2023.) (New usage is discouraged.)
Assertion
Ref Expression
cnm  |-  ( A  e.  CC  ->  E. x  x  e.  A )
Distinct variable group:    x, A

Proof of Theorem cnm
Dummy variables  u  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elxpi 4563 . . 3  |-  ( A  e.  ( R.  X.  R. )  ->  E. u E. v ( A  = 
<. u ,  v >.  /\  ( u  e.  R.  /\  v  e.  R. )
) )
2 df-c 7650 . . 3  |-  CC  =  ( R.  X.  R. )
31, 2eleq2s 2235 . 2  |-  ( A  e.  CC  ->  E. u E. v ( A  = 
<. u ,  v >.  /\  ( u  e.  R.  /\  v  e.  R. )
) )
4 vex 2692 . . . . . 6  |-  u  e. 
_V
5 vex 2692 . . . . . 6  |-  v  e. 
_V
6 opm 4164 . . . . . 6  |-  ( E. x  x  e.  <. u ,  v >.  <->  ( u  e.  _V  /\  v  e. 
_V ) )
74, 5, 6mpbir2an 927 . . . . 5  |-  E. x  x  e.  <. u ,  v >.
8 simprl 521 . . . . . . 7  |-  ( ( A  e.  CC  /\  ( A  =  <. u ,  v >.  /\  (
u  e.  R.  /\  v  e.  R. )
) )  ->  A  =  <. u ,  v
>. )
98eleq2d 2210 . . . . . 6  |-  ( ( A  e.  CC  /\  ( A  =  <. u ,  v >.  /\  (
u  e.  R.  /\  v  e.  R. )
) )  ->  (
x  e.  A  <->  x  e.  <.
u ,  v >.
) )
109exbidv 1798 . . . . 5  |-  ( ( A  e.  CC  /\  ( A  =  <. u ,  v >.  /\  (
u  e.  R.  /\  v  e.  R. )
) )  ->  ( E. x  x  e.  A 
<->  E. x  x  e. 
<. u ,  v >.
) )
117, 10mpbiri 167 . . . 4  |-  ( ( A  e.  CC  /\  ( A  =  <. u ,  v >.  /\  (
u  e.  R.  /\  v  e.  R. )
) )  ->  E. x  x  e.  A )
1211ex 114 . . 3  |-  ( A  e.  CC  ->  (
( A  =  <. u ,  v >.  /\  (
u  e.  R.  /\  v  e.  R. )
)  ->  E. x  x  e.  A )
)
1312exlimdvv 1870 . 2  |-  ( A  e.  CC  ->  ( E. u E. v ( A  =  <. u ,  v >.  /\  (
u  e.  R.  /\  v  e.  R. )
)  ->  E. x  x  e.  A )
)
143, 13mpd 13 1  |-  ( A  e.  CC  ->  E. x  x  e.  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    = wceq 1332   E.wex 1469    e. wcel 1481   _Vcvv 2689   <.cop 3535    X. cxp 4545   R.cnr 7129   CCcc 7642
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-opab 3998  df-xp 4553  df-c 7650
This theorem is referenced by:  axaddf  7700  axmulf  7701
  Copyright terms: Public domain W3C validator