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

Theorem recexprlemopl 7942
Description: The lower cut of  B is open. Lemma for recexpr 7955. (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
recexprlemopl  |-  ( ( A  e.  P.  /\  q  e.  Q.  /\  q  e.  ( 1st `  B
) )  ->  E. r  e.  Q.  ( q  <Q 
r  /\  r  e.  ( 1st `  B ) ) )
Distinct variable groups:    r, q, x, y, A    B, q,
r, x, y

Proof of Theorem recexprlemopl
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 ) ) }
>.
21recexprlemell 7939 . . 3  |-  ( q  e.  ( 1st `  B
)  <->  E. y ( q 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) )
3 ltbtwnnqq 7732 . . . . . 6  |-  ( q 
<Q  y  <->  E. r  e.  Q.  ( q  <Q  r  /\  r  <Q  y ) )
43biimpi 120 . . . . 5  |-  ( q 
<Q  y  ->  E. r  e.  Q.  ( q  <Q 
r  /\  r  <Q  y ) )
5 simpll 527 . . . . . . . 8  |-  ( ( ( q  <Q  r  /\  r  <Q  y )  /\  ( *Q `  y )  e.  ( 2nd `  A ) )  ->  q  <Q  r )
6 19.8a 1639 . . . . . . . . . 10  |-  ( ( r  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) )  ->  E. y
( r  <Q  y  /\  ( *Q `  y
)  e.  ( 2nd `  A ) ) )
71recexprlemell 7939 . . . . . . . . . 10  |-  ( r  e.  ( 1st `  B
)  <->  E. y ( r 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) )
86, 7sylibr 134 . . . . . . . . 9  |-  ( ( r  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) )  ->  r  e.  ( 1st `  B
) )
98adantll 476 . . . . . . . 8  |-  ( ( ( q  <Q  r  /\  r  <Q  y )  /\  ( *Q `  y )  e.  ( 2nd `  A ) )  ->  r  e.  ( 1st `  B ) )
105, 9jca 306 . . . . . . 7  |-  ( ( ( q  <Q  r  /\  r  <Q  y )  /\  ( *Q `  y )  e.  ( 2nd `  A ) )  ->  ( q  <Q  r  /\  r  e.  ( 1st `  B
) ) )
1110expcom 116 . . . . . 6  |-  ( ( *Q `  y )  e.  ( 2nd `  A
)  ->  ( (
q  <Q  r  /\  r  <Q  y )  ->  (
q  <Q  r  /\  r  e.  ( 1st `  B
) ) ) )
1211reximdv 2645 . . . . 5  |-  ( ( *Q `  y )  e.  ( 2nd `  A
)  ->  ( E. r  e.  Q.  (
q  <Q  r  /\  r  <Q  y )  ->  E. r  e.  Q.  ( q  <Q 
r  /\  r  e.  ( 1st `  B ) ) ) )
134, 12mpan9 281 . . . 4  |-  ( ( q  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) )  ->  E. r  e.  Q.  ( q  <Q 
r  /\  r  e.  ( 1st `  B ) ) )
1413exlimiv 1647 . . 3  |-  ( E. y ( q  <Q 
y  /\  ( *Q `  y )  e.  ( 2nd `  A ) )  ->  E. r  e.  Q.  ( q  <Q 
r  /\  r  e.  ( 1st `  B ) ) )
152, 14sylbi 121 . 2  |-  ( q  e.  ( 1st `  B
)  ->  E. r  e.  Q.  ( q  <Q 
r  /\  r  e.  ( 1st `  B ) ) )
16153ad2ant3 1047 1  |-  ( ( A  e.  P.  /\  q  e.  Q.  /\  q  e.  ( 1st `  B
) )  ->  E. r  e.  Q.  ( q  <Q 
r  /\  r  e.  ( 1st `  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398   E.wex 1541    e. wcel 2205   {cab 2220   E.wrex 2523   <.cop 3694   class class class wbr 4111   ` cfv 5354   1stc1st 6334   2ndc2nd 6335   Q.cnq 7597   *Qcrq 7601    <Q cltq 7602   P.cnp 7608
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-eprel 4412  df-id 4416  df-po 4419  df-iso 4420  df-iord 4489  df-on 4491  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-irdg 6603  df-1o 6649  df-oadd 6653  df-omul 6654  df-er 6769  df-ec 6771  df-qs 6775  df-ni 7621  df-pli 7622  df-mi 7623  df-lti 7624  df-plpq 7661  df-mpq 7662  df-enq 7664  df-nqqs 7665  df-plqqs 7666  df-mqqs 7667  df-1nqqs 7668  df-rq 7669  df-ltnqqs 7670
This theorem is referenced by:  recexprlemrnd  7946
  Copyright terms: Public domain W3C validator