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

Theorem enqex 7568
Description: The equivalence relation for positive fractions exists. (Contributed by NM, 3-Sep-1995.)
Assertion
Ref Expression
enqex  |-  ~Q  e.  _V

Proof of Theorem enqex
Dummy variables  x  y  z  w  v  u are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 niex 7520 . . . 4  |-  N.  e.  _V
21, 1xpex 4838 . . 3  |-  ( N. 
X.  N. )  e.  _V
32, 2xpex 4838 . 2  |-  ( ( N.  X.  N. )  X.  ( N.  X.  N. ) )  e.  _V
4 df-enq 7555 . . 3  |-  ~Q  =  { <. x ,  y
>.  |  ( (
x  e.  ( N. 
X.  N. )  /\  y  e.  ( N.  X.  N. ) )  /\  E. z E. w E. v E. u ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ( z  .N  u
)  =  ( w  .N  v ) ) ) }
5 opabssxp 4796 . . 3  |-  { <. x ,  y >.  |  ( ( x  e.  ( N.  X.  N. )  /\  y  e.  ( N.  X.  N. ) )  /\  E. z E. w E. v E. u ( ( x  =  <. z ,  w >.  /\  y  =  <. v ,  u >. )  /\  ( z  .N  u
)  =  ( w  .N  v ) ) ) }  C_  (
( N.  X.  N. )  X.  ( N.  X.  N. ) )
64, 5eqsstri 3257 . 2  |-  ~Q  C_  (
( N.  X.  N. )  X.  ( N.  X.  N. ) )
73, 6ssexi 4223 1  |-  ~Q  e.  _V
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1395   E.wex 1538    e. wcel 2200   _Vcvv 2800   <.cop 3670   {copab 4145    X. cxp 4719  (class class class)co 6011   N.cnpi 7480    .N cmi 7482    ~Q ceq 7487
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4203  ax-pow 4260  ax-pr 4295  ax-un 4526  ax-iinf 4682
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3890  df-int 3925  df-opab 4147  df-iom 4685  df-xp 4727  df-ni 7512  df-enq 7555
This theorem is referenced by:  1nq  7574  addpipqqs  7578  mulpipqqs  7581  ordpipqqs  7582  addclnq  7583  mulclnq  7584  dmaddpq  7587  dmmulpq  7588  recexnq  7598  ltexnqq  7616  prarloclemarch  7626  prarloclemarch2  7627  nnnq  7630  nqpnq0nq  7661  prarloclemlt  7701  prarloclemlo  7702  prarloclemcalc  7710  nqprm  7750
  Copyright terms: Public domain W3C validator