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

Theorem elnp1st2nd 7849
Description: Membership in positive reals, using  1st and  2nd to refer to the lower and upper cut. (Contributed by Jim Kingdon, 3-Oct-2019.)
Assertion
Ref Expression
elnp1st2nd  |-  ( A  e.  P.  <->  ( ( A  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e. 
Q.  q  e.  ( 1st `  A )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  A ) ) )  /\  (
( A. q  e. 
Q.  ( q  e.  ( 1st `  A
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  A ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  A
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  A ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  A
)  \/  r  e.  ( 2nd `  A
) ) ) ) ) )
Distinct variable group:    r, q, A

Proof of Theorem elnp1st2nd
StepHypRef Expression
1 npsspw 7844 . . . . 5  |-  P.  C_  ( ~P Q.  X.  ~P Q. )
21sseli 3244 . . . 4  |-  ( A  e.  P.  ->  A  e.  ( ~P Q.  X.  ~P Q. ) )
3 prop 7848 . . . . . . 7  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
4 elinp 7847 . . . . . . 7  |-  ( <.
( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  <->  ( ( ( ( 1st `  A )  C_  Q.  /\  ( 2nd `  A
)  C_  Q. )  /\  ( E. q  e. 
Q.  q  e.  ( 1st `  A )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  A ) ) )  /\  (
( A. q  e. 
Q.  ( q  e.  ( 1st `  A
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  A ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  A
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  A ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  A
)  \/  r  e.  ( 2nd `  A
) ) ) ) ) )
53, 4sylib 122 . . . . . 6  |-  ( A  e.  P.  ->  (
( ( ( 1st `  A )  C_  Q.  /\  ( 2nd `  A
)  C_  Q. )  /\  ( E. q  e. 
Q.  q  e.  ( 1st `  A )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  A ) ) )  /\  (
( A. q  e. 
Q.  ( q  e.  ( 1st `  A
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  A ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  A
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  A ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  A
)  \/  r  e.  ( 2nd `  A
) ) ) ) ) )
65simpld 112 . . . . 5  |-  ( A  e.  P.  ->  (
( ( 1st `  A
)  C_  Q.  /\  ( 2nd `  A )  C_  Q. )  /\  ( E. q  e.  Q.  q  e.  ( 1st `  A )  /\  E. r  e.  Q.  r  e.  ( 2nd `  A
) ) ) )
76simprd 114 . . . 4  |-  ( A  e.  P.  ->  ( E. q  e.  Q.  q  e.  ( 1st `  A )  /\  E. r  e.  Q.  r  e.  ( 2nd `  A
) ) )
82, 7jca 306 . . 3  |-  ( A  e.  P.  ->  ( A  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e. 
Q.  q  e.  ( 1st `  A )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  A ) ) ) )
95simprd 114 . . 3  |-  ( A  e.  P.  ->  (
( A. q  e. 
Q.  ( q  e.  ( 1st `  A
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  A ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  A
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  A ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  A
)  \/  r  e.  ( 2nd `  A
) ) ) ) )
108, 9jca 306 . 2  |-  ( A  e.  P.  ->  (
( A  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e.  Q.  q  e.  ( 1st `  A )  /\  E. r  e.  Q.  r  e.  ( 2nd `  A
) ) )  /\  ( ( A. q  e.  Q.  ( q  e.  ( 1st `  A
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  A ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  A
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  A ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  A
)  \/  r  e.  ( 2nd `  A
) ) ) ) ) )
11 1st2nd2 6413 . . . 4  |-  ( A  e.  ( ~P Q.  X.  ~P Q. )  ->  A  =  <. ( 1st `  A ) ,  ( 2nd `  A )
>. )
1211ad2antrr 492 . . 3  |-  ( ( ( A  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e.  Q.  q  e.  ( 1st `  A )  /\  E. r  e.  Q.  r  e.  ( 2nd `  A
) ) )  /\  ( ( A. q  e.  Q.  ( q  e.  ( 1st `  A
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  A ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  A
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  A ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  A
)  \/  r  e.  ( 2nd `  A
) ) ) ) )  ->  A  =  <. ( 1st `  A
) ,  ( 2nd `  A ) >. )
13 xp1st 6403 . . . . . . . 8  |-  ( A  e.  ( ~P Q.  X.  ~P Q. )  -> 
( 1st `  A
)  e.  ~P Q. )
1413elpwid 3700 . . . . . . 7  |-  ( A  e.  ( ~P Q.  X.  ~P Q. )  -> 
( 1st `  A
)  C_  Q. )
15 xp2nd 6404 . . . . . . . 8  |-  ( A  e.  ( ~P Q.  X.  ~P Q. )  -> 
( 2nd `  A
)  e.  ~P Q. )
1615elpwid 3700 . . . . . . 7  |-  ( A  e.  ( ~P Q.  X.  ~P Q. )  -> 
( 2nd `  A
)  C_  Q. )
1714, 16jca 306 . . . . . 6  |-  ( A  e.  ( ~P Q.  X.  ~P Q. )  -> 
( ( 1st `  A
)  C_  Q.  /\  ( 2nd `  A )  C_  Q. ) )
1817anim1i 340 . . . . 5  |-  ( ( A  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e.  Q.  q  e.  ( 1st `  A )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  A ) ) )  ->  (
( ( 1st `  A
)  C_  Q.  /\  ( 2nd `  A )  C_  Q. )  /\  ( E. q  e.  Q.  q  e.  ( 1st `  A )  /\  E. r  e.  Q.  r  e.  ( 2nd `  A
) ) ) )
1918anim1i 340 . . . 4  |-  ( ( ( A  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e.  Q.  q  e.  ( 1st `  A )  /\  E. r  e.  Q.  r  e.  ( 2nd `  A
) ) )  /\  ( ( A. q  e.  Q.  ( q  e.  ( 1st `  A
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  A ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  A
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  A ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  A
)  \/  r  e.  ( 2nd `  A
) ) ) ) )  ->  ( (
( ( 1st `  A
)  C_  Q.  /\  ( 2nd `  A )  C_  Q. )  /\  ( E. q  e.  Q.  q  e.  ( 1st `  A )  /\  E. r  e.  Q.  r  e.  ( 2nd `  A
) ) )  /\  ( ( A. q  e.  Q.  ( q  e.  ( 1st `  A
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  A ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  A
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  A ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  A
)  \/  r  e.  ( 2nd `  A
) ) ) ) ) )
2019, 4sylibr 134 . . 3  |-  ( ( ( A  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e.  Q.  q  e.  ( 1st `  A )  /\  E. r  e.  Q.  r  e.  ( 2nd `  A
) ) )  /\  ( ( A. q  e.  Q.  ( q  e.  ( 1st `  A
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  A ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  A
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  A ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  A
)  \/  r  e.  ( 2nd `  A
) ) ) ) )  ->  <. ( 1st `  A ) ,  ( 2nd `  A )
>.  e.  P. )
2112, 20eqeltrd 2315 . 2  |-  ( ( ( A  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e.  Q.  q  e.  ( 1st `  A )  /\  E. r  e.  Q.  r  e.  ( 2nd `  A
) ) )  /\  ( ( A. q  e.  Q.  ( q  e.  ( 1st `  A
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  A ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  A
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  A ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  A
)  \/  r  e.  ( 2nd `  A
) ) ) ) )  ->  A  e.  P. )
2210, 21impbii 126 1  |-  ( A  e.  P.  <->  ( ( A  e.  ( ~P Q.  X.  ~P Q. )  /\  ( E. q  e. 
Q.  q  e.  ( 1st `  A )  /\  E. r  e. 
Q.  r  e.  ( 2nd `  A ) ) )  /\  (
( A. q  e. 
Q.  ( q  e.  ( 1st `  A
)  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  e.  ( 1st `  A ) ) )  /\  A. r  e.  Q.  ( r  e.  ( 2nd `  A
)  <->  E. q  e.  Q.  ( q  <Q  r  /\  q  e.  ( 2nd `  A ) ) ) )  /\  A. q  e.  Q.  -.  (
q  e.  ( 1st `  A )  /\  q  e.  ( 2nd `  A
) )  /\  A. q  e.  Q.  A. r  e.  Q.  ( q  <Q 
r  ->  ( q  e.  ( 1st `  A
)  \/  r  e.  ( 2nd `  A
) ) ) ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    /\ w3a 1009    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529    C_ wss 3220   ~Pcpw 3688   <.cop 3712   class class class wbr 4131    X. cxp 4774   ` cfv 5380   1stc1st 6376   2ndc2nd 6377   Q.cnq 7653    <Q cltq 7658   P.cnp 7664
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-iinf 4737
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-1st 6378  df-2nd 6379  df-qs 6817  df-ni 7677  df-nqqs 7721  df-inp 7839
This theorem is used by:  addclpr  7910  mulclpr  7945  ltexprlempr  7981  recexprlempr  8005  cauappcvgprlemcl  8026  caucvgprlemcl  8049  caucvgprprlemcl  8077
  Copyright terms: Public domain W3C validator