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

Theorem prop 7673
Description: A positive real is an ordered pair of a lower cut and an upper cut. (Contributed by Jim Kingdon, 27-Sep-2019.)
Assertion
Ref Expression
prop  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )

Proof of Theorem prop
StepHypRef Expression
1 npsspw 7669 . . . 4  |-  P.  C_  ( ~P Q.  X.  ~P Q. )
21sseli 3220 . . 3  |-  ( A  e.  P.  ->  A  e.  ( ~P Q.  X.  ~P Q. ) )
3 1st2nd2 6327 . . 3  |-  ( A  e.  ( ~P Q.  X.  ~P Q. )  ->  A  =  <. ( 1st `  A ) ,  ( 2nd `  A )
>. )
42, 3syl 14 . 2  |-  ( A  e.  P.  ->  A  =  <. ( 1st `  A
) ,  ( 2nd `  A ) >. )
5 eleq1 2292 . . 3  |-  ( A  =  <. ( 1st `  A
) ,  ( 2nd `  A ) >.  ->  ( A  e.  P.  <->  <. ( 1st `  A ) ,  ( 2nd `  A )
>.  e.  P. ) )
65biimpcd 159 . 2  |-  ( A  e.  P.  ->  ( A  =  <. ( 1st `  A ) ,  ( 2nd `  A )
>.  ->  <. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P. ) )
74, 6mpd 13 1  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395    e. wcel 2200   ~Pcpw 3649   <.cop 3669    X. cxp 4717   ` cfv 5318   1stc1st 6290   2ndc2nd 6291   Q.cnq 7478   P.cnp 7489
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-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 4202  ax-pow 4258  ax-pr 4293  ax-un 4524
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-iota 5278  df-fun 5320  df-fv 5326  df-1st 6292  df-2nd 6293  df-inp 7664
This theorem is referenced by:  elnp1st2nd  7674  0npr  7681  genpdf  7706  genipv  7707  genpelvl  7710  genpelvu  7711  genpml  7715  genpmu  7716  genprndl  7719  genprndu  7720  genpdisj  7721  genpassl  7722  genpassu  7723  addnqprl  7727  addnqpru  7728  addlocprlemeqgt  7730  addlocprlemgt  7732  addlocprlem  7733  addlocpr  7734  nqprl  7749  nqpru  7750  addnqprlemfl  7757  addnqprlemfu  7758  mulnqprl  7766  mulnqpru  7767  mullocprlem  7768  mullocpr  7769  mulnqprlemfl  7773  mulnqprlemfu  7774  addcomprg  7776  mulcomprg  7778  distrlem1prl  7780  distrlem1pru  7781  distrlem4prl  7782  distrlem4pru  7783  ltprordil  7787  1idprl  7788  1idpru  7789  ltpopr  7793  ltsopr  7794  ltaddpr  7795  ltexprlemm  7798  ltexprlemopl  7799  ltexprlemlol  7800  ltexprlemopu  7801  ltexprlemupu  7802  ltexprlemdisj  7804  ltexprlemloc  7805  ltexprlemfl  7807  ltexprlemrl  7808  ltexprlemfu  7809  ltexprlemru  7810  addcanprleml  7812  addcanprlemu  7813  prplnqu  7818  recexprlemm  7822  recexprlemdisj  7828  recexprlemloc  7829  recexprlem1ssl  7831  recexprlem1ssu  7832  recexprlemss1l  7833  recexprlemss1u  7834  aptiprleml  7837  aptiprlemu  7838  archpr  7841  cauappcvgprlemladdru  7854  cauappcvgprlemladdrl  7855  archrecpr  7862  caucvgprlemladdrl  7876  caucvgprprlemml  7892  caucvgprprlemmu  7893  caucvgprprlemopl  7895  suplocexprlemml  7914  suplocexprlemrl  7915  suplocexprlemmu  7916  suplocexprlemdisj  7918  suplocexprlemloc  7919  suplocexprlemex  7920  suplocexprlemub  7921
  Copyright terms: Public domain W3C validator