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

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

Proof of Theorem recexprlemlol
StepHypRef Expression
1 ltsonq 7511 . . . . . . . . 9  |-  <Q  Or  Q.
2 ltrelnq 7478 . . . . . . . . 9  |-  <Q  C_  ( Q.  X.  Q. )
31, 2sotri 5078 . . . . . . . 8  |-  ( ( q  <Q  r  /\  r  <Q  y )  -> 
q  <Q  y )
43ex 115 . . . . . . 7  |-  ( q 
<Q  r  ->  ( r 
<Q  y  ->  q  <Q 
y ) )
54anim1d 336 . . . . . 6  |-  ( q 
<Q  r  ->  ( ( r  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) )  ->  (
q  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) ) )
65eximdv 1903 . . . . 5  |-  ( q 
<Q  r  ->  ( E. y ( r  <Q 
y  /\  ( *Q `  y )  e.  ( 2nd `  A ) )  ->  E. y
( q  <Q  y  /\  ( *Q `  y
)  e.  ( 2nd `  A ) ) ) )
7 recexpr.1 . . . . . 6  |-  B  = 
<. { x  |  E. y ( x  <Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A ) ) } ,  {
x  |  E. y
( y  <Q  x  /\  ( *Q `  y
)  e.  ( 1st `  A ) ) }
>.
87recexprlemell 7735 . . . . 5  |-  ( r  e.  ( 1st `  B
)  <->  E. y ( r 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) )
97recexprlemell 7735 . . . . 5  |-  ( q  e.  ( 1st `  B
)  <->  E. y ( q 
<Q  y  /\  ( *Q `  y )  e.  ( 2nd `  A
) ) )
106, 8, 93imtr4g 205 . . . 4  |-  ( q 
<Q  r  ->  ( r  e.  ( 1st `  B
)  ->  q  e.  ( 1st `  B ) ) )
1110imp 124 . . 3  |-  ( ( q  <Q  r  /\  r  e.  ( 1st `  B ) )  -> 
q  e.  ( 1st `  B ) )
1211rexlimivw 2619 . 2  |-  ( E. r  e.  Q.  (
q  <Q  r  /\  r  e.  ( 1st `  B
) )  ->  q  e.  ( 1st `  B
) )
1312a1i 9 1  |-  ( ( A  e.  P.  /\  q  e.  Q. )  ->  ( E. r  e. 
Q.  ( q  <Q 
r  /\  r  e.  ( 1st `  B ) )  ->  q  e.  ( 1st `  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1373   E.wex 1515    e. wcel 2176   {cab 2191   E.wrex 2485   <.cop 3636   class class class wbr 4044   ` cfv 5271   1stc1st 6224   2ndc2nd 6225   Q.cnq 7393   *Qcrq 7397    <Q cltq 7398   P.cnp 7404
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-nul 4170  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-iinf 4636
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-tr 4143  df-eprel 4336  df-id 4340  df-po 4343  df-iso 4344  df-iord 4413  df-on 4415  df-suc 4418  df-iom 4639  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5947  df-oprab 5948  df-mpo 5949  df-1st 6226  df-2nd 6227  df-recs 6391  df-irdg 6456  df-oadd 6506  df-omul 6507  df-er 6620  df-ec 6622  df-qs 6626  df-ni 7417  df-mi 7419  df-lti 7420  df-enq 7460  df-nqqs 7461  df-ltnqqs 7466
This theorem is referenced by:  recexprlemrnd  7742
  Copyright terms: Public domain W3C validator