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

Theorem recexprlemupu 7712
Description: The upper cut of  B is upper. Lemma for recexpr 7722. (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
recexprlemupu  |-  ( ( A  e.  P.  /\  r  e.  Q. )  ->  ( E. q  e. 
Q.  ( q  <Q 
r  /\  q  e.  ( 2nd `  B ) )  ->  r  e.  ( 2nd `  B ) ) )
Distinct variable groups:    r, q, x, y, A    B, q,
r, x, y

Proof of Theorem recexprlemupu
StepHypRef Expression
1 ltsonq 7482 . . . . . . . . 9  |-  <Q  Or  Q.
2 ltrelnq 7449 . . . . . . . . 9  |-  <Q  C_  ( Q.  X.  Q. )
31, 2sotri 5066 . . . . . . . 8  |-  ( ( y  <Q  q  /\  q  <Q  r )  -> 
y  <Q  r )
43expcom 116 . . . . . . 7  |-  ( q 
<Q  r  ->  ( y 
<Q  q  ->  y  <Q 
r ) )
54anim1d 336 . . . . . 6  |-  ( q 
<Q  r  ->  ( ( y  <Q  q  /\  ( *Q `  y )  e.  ( 1st `  A
) )  ->  (
y  <Q  r  /\  ( *Q `  y )  e.  ( 1st `  A
) ) ) )
65eximdv 1894 . . . . 5  |-  ( q 
<Q  r  ->  ( E. y ( y  <Q 
q  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  E. y
( y  <Q  r  /\  ( *Q `  y
)  e.  ( 1st `  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 ) ) }
>.
87recexprlemelu 7707 . . . . 5  |-  ( q  e.  ( 2nd `  B
)  <->  E. y ( y 
<Q  q  /\  ( *Q `  y )  e.  ( 1st `  A
) ) )
97recexprlemelu 7707 . . . . 5  |-  ( r  e.  ( 2nd `  B
)  <->  E. y ( y 
<Q  r  /\  ( *Q `  y )  e.  ( 1st `  A
) ) )
106, 8, 93imtr4g 205 . . . 4  |-  ( q 
<Q  r  ->  ( q  e.  ( 2nd `  B
)  ->  r  e.  ( 2nd `  B ) ) )
1110imp 124 . . 3  |-  ( ( q  <Q  r  /\  q  e.  ( 2nd `  B ) )  -> 
r  e.  ( 2nd `  B ) )
1211rexlimivw 2610 . 2  |-  ( E. q  e.  Q.  (
q  <Q  r  /\  q  e.  ( 2nd `  B
) )  ->  r  e.  ( 2nd `  B
) )
1312a1i 9 1  |-  ( ( A  e.  P.  /\  r  e.  Q. )  ->  ( E. q  e. 
Q.  ( q  <Q 
r  /\  q  e.  ( 2nd `  B ) )  ->  r  e.  ( 2nd `  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364   E.wex 1506    e. wcel 2167   {cab 2182   E.wrex 2476   <.cop 3626   class class class wbr 4034   ` cfv 5259   1stc1st 6205   2ndc2nd 6206   Q.cnq 7364   *Qcrq 7368    <Q cltq 7369   P.cnp 7375
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-eprel 4325  df-id 4329  df-po 4332  df-iso 4333  df-iord 4402  df-on 4404  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-irdg 6437  df-oadd 6487  df-omul 6488  df-er 6601  df-ec 6603  df-qs 6607  df-ni 7388  df-mi 7390  df-lti 7391  df-enq 7431  df-nqqs 7432  df-ltnqqs 7437
This theorem is referenced by:  recexprlemrnd  7713
  Copyright terms: Public domain W3C validator