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

Theorem recexprlemell 7885
Description: Membership in the lower cut of  B. Lemma for recexpr 7901. (Contributed by Jim Kingdon, 27-Dec-2019.)
Hypothesis
Ref Expression
recexpr.1  |-  B  = 
<. { x  |  E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) ) } ,  {
x  |  E. y
( y  <Q  x  /\  ( *Q `  y
)  e.  ( 1st `  A ) ) }
>.
Assertion
Ref Expression
recexprlemell  |-  ( C  e.  ( 1st `  B
)  <->  E. y ( C 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) )
Distinct variable groups:    x, y, A   
x, B, y    x, C, y

Proof of Theorem recexprlemell
StepHypRef Expression
1 elex 2815 . 2  |-  ( C  e.  ( 1st `  B
)  ->  C  e.  _V )
2 ltrelnq 7628 . . . . . . 7  |-  <Q  C_  ( Q.  X.  Q. )
32brel 4784 . . . . . 6  |-  ( C 
<Q  y  ->  ( C  e.  Q.  /\  y  e.  Q. ) )
43simpld 112 . . . . 5  |-  ( C 
<Q  y  ->  C  e. 
Q. )
5 elex 2815 . . . . 5  |-  ( C  e.  Q.  ->  C  e.  _V )
64, 5syl 14 . . . 4  |-  ( C 
<Q  y  ->  C  e. 
_V )
76adantr 276 . . 3  |-  ( ( C  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) )  ->  C  e.  _V )
87exlimiv 1647 . 2  |-  ( E. y ( C  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) )  ->  C  e.  _V )
9 breq1 4096 . . . . 5  |-  ( x  =  C  ->  (
x  <Q  y  <->  C  <Q  y ) )
109anbi1d 465 . . . 4  |-  ( x  =  C  ->  (
( x  <Q  y  /\  ( *Q `  y
)  e.  ( 2nd `  A ) )  <->  ( C  <Q  y  /\  ( *Q
`  y )  e.  ( 2nd `  A
) ) ) )
1110exbidv 1873 . . 3  |-  ( x  =  C  ->  ( E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) )  <->  E. y ( C 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) ) )
12 recexpr.1 . . . . 5  |-  B  = 
<. { x  |  E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) ) } ,  {
x  |  E. y
( y  <Q  x  /\  ( *Q `  y
)  e.  ( 1st `  A ) ) }
>.
1312fveq2i 5651 . . . 4  |-  ( 1st `  B )  =  ( 1st `  <. { x  |  E. y ( x 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) } ,  { x  |  E. y ( y  <Q  x  /\  ( *Q `  y )  e.  ( 1st `  A ) ) } >. )
14 nqex 7626 . . . . . 6  |-  Q.  e.  _V
152brel 4784 . . . . . . . . . 10  |-  ( x 
<Q  y  ->  ( x  e.  Q.  /\  y  e.  Q. ) )
1615simpld 112 . . . . . . . . 9  |-  ( x 
<Q  y  ->  x  e. 
Q. )
1716adantr 276 . . . . . . . 8  |-  ( ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) )  ->  x  e.  Q. )
1817exlimiv 1647 . . . . . . 7  |-  ( E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) )  ->  x  e.  Q. )
1918abssi 3303 . . . . . 6  |-  { x  |  E. y ( x 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) }  C_  Q.
2014, 19ssexi 4232 . . . . 5  |-  { x  |  E. y ( x 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) }  e.  _V
212brel 4784 . . . . . . . . . 10  |-  ( y 
<Q  x  ->  ( y  e.  Q.  /\  x  e.  Q. ) )
2221simprd 114 . . . . . . . . 9  |-  ( y 
<Q  x  ->  x  e. 
Q. )
2322adantr 276 . . . . . . . 8  |-  ( ( y  <Q  x  /\  ( *Q `  y )  e.  ( 1st `  A
) )  ->  x  e.  Q. )
2423exlimiv 1647 . . . . . . 7  |-  ( E. y ( y  <Q  x  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  x  e.  Q. )
2524abssi 3303 . . . . . 6  |-  { x  |  E. y ( y 
<Q  x  /\  ( *Q `  y )  e.  ( 1st `  A
) ) }  C_  Q.
2614, 25ssexi 4232 . . . . 5  |-  { x  |  E. y ( y 
<Q  x  /\  ( *Q `  y )  e.  ( 1st `  A
) ) }  e.  _V
2720, 26op1st 6318 . . . 4  |-  ( 1st `  <. { x  |  E. y ( x 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) } ,  { x  |  E. y ( y  <Q  x  /\  ( *Q `  y )  e.  ( 1st `  A ) ) } >. )  =  { x  |  E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) ) }
2813, 27eqtri 2252 . . 3  |-  ( 1st `  B )  =  {
x  |  E. y
( x  <Q  y  /\  ( *Q `  y
)  e.  ( 2nd `  A ) ) }
2911, 28elab2g 2954 . 2  |-  ( C  e.  _V  ->  ( C  e.  ( 1st `  B )  <->  E. y
( C  <Q  y  /\  ( *Q `  y
)  e.  ( 2nd `  A ) ) ) )
301, 8, 29pm5.21nii 712 1  |-  ( C  e.  ( 1st `  B
)  <->  E. y ( C 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1398   E.wex 1541    e. wcel 2202   {cab 2217   _Vcvv 2803   <.cop 3676   class class class wbr 4093   ` cfv 5333   1stc1st 6310   2ndc2nd 6311   Q.cnq 7543   *Qcrq 7547    <Q cltq 7548
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-iinf 4692
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-1st 6312  df-qs 6751  df-ni 7567  df-nqqs 7611  df-ltnqqs 7616
This theorem is referenced by:  recexprlemm  7887  recexprlemopl  7888  recexprlemlol  7889  recexprlemdisj  7893  recexprlemloc  7894  recexprlem1ssl  7896  recexprlemss1l  7898
  Copyright terms: Public domain W3C validator