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

Theorem recexprlemopu 7184
Description: The upper cut of  B is open. Lemma for recexpr 7195. (Contributed by Jim Kingdon, 28-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
recexprlemopu  |-  ( ( A  e.  P.  /\  r  e.  Q.  /\  r  e.  ( 2nd `  B
) )  ->  E. q  e.  Q.  ( q  <Q 
r  /\  q  e.  ( 2nd `  B ) ) )
Distinct variable groups:    r, q, x, y, A    B, q,
r, x, y

Proof of Theorem recexprlemopu
StepHypRef Expression
1 recexpr.1 . . . 4  |-  B  = 
<. { x  |  E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) ) } ,  {
x  |  E. y
( y  <Q  x  /\  ( *Q `  y
)  e.  ( 1st `  A ) ) }
>.
21recexprlemelu 7180 . . 3  |-  ( r  e.  ( 2nd `  B
)  <->  E. y ( y 
<Q  r  /\  ( *Q `  y )  e.  ( 1st `  A
) ) )
3 ltbtwnnqq 6972 . . . . . 6  |-  ( y 
<Q  r  <->  E. q  e.  Q.  ( y  <Q  q  /\  q  <Q  r ) )
43biimpi 118 . . . . 5  |-  ( y 
<Q  r  ->  E. q  e.  Q.  ( y  <Q 
q  /\  q  <Q  r ) )
5 simplr 497 . . . . . . . 8  |-  ( ( ( y  <Q  q  /\  q  <Q  r )  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  q  <Q  r )
6 19.8a 1527 . . . . . . . . . 10  |-  ( ( y  <Q  q  /\  ( *Q `  y )  e.  ( 1st `  A
) )  ->  E. y
( y  <Q  q  /\  ( *Q `  y
)  e.  ( 1st `  A ) ) )
71recexprlemelu 7180 . . . . . . . . . 10  |-  ( q  e.  ( 2nd `  B
)  <->  E. y ( y 
<Q  q  /\  ( *Q `  y )  e.  ( 1st `  A
) ) )
86, 7sylibr 132 . . . . . . . . 9  |-  ( ( y  <Q  q  /\  ( *Q `  y )  e.  ( 1st `  A
) )  ->  q  e.  ( 2nd `  B
) )
98adantlr 461 . . . . . . . 8  |-  ( ( ( y  <Q  q  /\  q  <Q  r )  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  q  e.  ( 2nd `  B ) )
105, 9jca 300 . . . . . . 7  |-  ( ( ( y  <Q  q  /\  q  <Q  r )  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  ( q  <Q  r  /\  q  e.  ( 2nd `  B
) ) )
1110expcom 114 . . . . . 6  |-  ( ( *Q `  y )  e.  ( 1st `  A
)  ->  ( (
y  <Q  q  /\  q  <Q  r )  ->  (
q  <Q  r  /\  q  e.  ( 2nd `  B
) ) ) )
1211reximdv 2474 . . . . 5  |-  ( ( *Q `  y )  e.  ( 1st `  A
)  ->  ( E. q  e.  Q.  (
y  <Q  q  /\  q  <Q  r )  ->  E. q  e.  Q.  ( q  <Q 
r  /\  q  e.  ( 2nd `  B ) ) ) )
134, 12mpan9 275 . . . 4  |-  ( ( y  <Q  r  /\  ( *Q `  y )  e.  ( 1st `  A
) )  ->  E. q  e.  Q.  ( q  <Q 
r  /\  q  e.  ( 2nd `  B ) ) )
1413exlimiv 1534 . . 3  |-  ( E. y ( y  <Q 
r  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  E. q  e.  Q.  ( q  <Q 
r  /\  q  e.  ( 2nd `  B ) ) )
152, 14sylbi 119 . 2  |-  ( r  e.  ( 2nd `  B
)  ->  E. q  e.  Q.  ( q  <Q 
r  /\  q  e.  ( 2nd `  B ) ) )
16153ad2ant3 966 1  |-  ( ( A  e.  P.  /\  r  e.  Q.  /\  r  e.  ( 2nd `  B
) )  ->  E. q  e.  Q.  ( q  <Q 
r  /\  q  e.  ( 2nd `  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    /\ w3a 924    = wceq 1289   E.wex 1426    e. wcel 1438   {cab 2074   E.wrex 2360   <.cop 3449   class class class wbr 3845   ` cfv 5015   1stc1st 5909   2ndc2nd 5910   Q.cnq 6837   *Qcrq 6841    <Q cltq 6842   P.cnp 6848
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-coll 3954  ax-sep 3957  ax-nul 3965  ax-pow 4009  ax-pr 4036  ax-un 4260  ax-setind 4353  ax-iinf 4403
This theorem depends on definitions:  df-bi 115  df-dc 781  df-3or 925  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-ral 2364  df-rex 2365  df-reu 2366  df-rab 2368  df-v 2621  df-sbc 2841  df-csb 2934  df-dif 3001  df-un 3003  df-in 3005  df-ss 3012  df-nul 3287  df-pw 3431  df-sn 3452  df-pr 3453  df-op 3455  df-uni 3654  df-int 3689  df-iun 3732  df-br 3846  df-opab 3900  df-mpt 3901  df-tr 3937  df-eprel 4116  df-id 4120  df-po 4123  df-iso 4124  df-iord 4193  df-on 4195  df-suc 4198  df-iom 4406  df-xp 4444  df-rel 4445  df-cnv 4446  df-co 4447  df-dm 4448  df-rn 4449  df-res 4450  df-ima 4451  df-iota 4980  df-fun 5017  df-fn 5018  df-f 5019  df-f1 5020  df-fo 5021  df-f1o 5022  df-fv 5023  df-ov 5655  df-oprab 5656  df-mpt2 5657  df-1st 5911  df-2nd 5912  df-recs 6070  df-irdg 6135  df-1o 6181  df-oadd 6185  df-omul 6186  df-er 6290  df-ec 6292  df-qs 6296  df-ni 6861  df-pli 6862  df-mi 6863  df-lti 6864  df-plpq 6901  df-mpq 6902  df-enq 6904  df-nqqs 6905  df-plqqs 6906  df-mqqs 6907  df-1nqqs 6908  df-rq 6909  df-ltnqqs 6910
This theorem is referenced by:  recexprlemrnd  7186
  Copyright terms: Public domain W3C validator