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

Theorem addnqprlemfl 7822
Description: Lemma for addnqpr 7824. The forward subset relationship for the lower cut. (Contributed by Jim Kingdon, 19-Aug-2020.)
Assertion
Ref Expression
addnqprlemfl  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( 1st `  <. { l  |  l  <Q 
( A  +Q  B
) } ,  {
u  |  ( A  +Q  B )  <Q  u } >. )  C_  ( 1st `  ( <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. ) ) )
Distinct variable groups:    A, l, u    B, l, u

Proof of Theorem addnqprlemfl
Dummy variable  r is distinct from all other variables.
StepHypRef Expression
1 addnqprlemru 7821 . . . . . 6  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( 2nd `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
)  C_  ( 2nd ` 
<. { l  |  l 
<Q  ( A  +Q  B
) } ,  {
u  |  ( A  +Q  B )  <Q  u } >. ) )
2 ltsonq 7661 . . . . . . . . 9  |-  <Q  Or  Q.
3 addclnq 7638 . . . . . . . . 9  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  +Q  B
)  e.  Q. )
4 sonr 4420 . . . . . . . . 9  |-  ( ( 
<Q  Or  Q.  /\  ( A  +Q  B )  e. 
Q. )  ->  -.  ( A  +Q  B
)  <Q  ( A  +Q  B ) )
52, 3, 4sylancr 414 . . . . . . . 8  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  -.  ( A  +Q  B )  <Q  ( A  +Q  B ) )
6 ltrelnq 7628 . . . . . . . . . . . 12  |-  <Q  C_  ( Q.  X.  Q. )
76brel 4784 . . . . . . . . . . 11  |-  ( ( A  +Q  B ) 
<Q  ( A  +Q  B
)  ->  ( ( A  +Q  B )  e. 
Q.  /\  ( A  +Q  B )  e.  Q. ) )
87simpld 112 . . . . . . . . . 10  |-  ( ( A  +Q  B ) 
<Q  ( A  +Q  B
)  ->  ( A  +Q  B )  e.  Q. )
9 elex 2815 . . . . . . . . . 10  |-  ( ( A  +Q  B )  e.  Q.  ->  ( A  +Q  B )  e. 
_V )
108, 9syl 14 . . . . . . . . 9  |-  ( ( A  +Q  B ) 
<Q  ( A  +Q  B
)  ->  ( A  +Q  B )  e.  _V )
11 breq2 4097 . . . . . . . . 9  |-  ( u  =  ( A  +Q  B )  ->  (
( A  +Q  B
)  <Q  u  <->  ( A  +Q  B )  <Q  ( A  +Q  B ) ) )
1210, 11elab3 2959 . . . . . . . 8  |-  ( ( A  +Q  B )  e.  { u  |  ( A  +Q  B
)  <Q  u }  <->  ( A  +Q  B )  <Q  ( A  +Q  B ) )
135, 12sylnibr 684 . . . . . . 7  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  -.  ( A  +Q  B )  e.  {
u  |  ( A  +Q  B )  <Q  u } )
14 ltnqex 7812 . . . . . . . . 9  |-  { l  |  l  <Q  ( A  +Q  B ) }  e.  _V
15 gtnqex 7813 . . . . . . . . 9  |-  { u  |  ( A  +Q  B )  <Q  u }  e.  _V
1614, 15op2nd 6319 . . . . . . . 8  |-  ( 2nd `  <. { l  |  l  <Q  ( A  +Q  B ) } ,  { u  |  ( A  +Q  B )  <Q  u } >. )  =  {
u  |  ( A  +Q  B )  <Q  u }
1716eleq2i 2298 . . . . . . 7  |-  ( ( A  +Q  B )  e.  ( 2nd `  <. { l  |  l  <Q 
( A  +Q  B
) } ,  {
u  |  ( A  +Q  B )  <Q  u } >. )  <->  ( A  +Q  B )  e.  {
u  |  ( A  +Q  B )  <Q  u } )
1813, 17sylnibr 684 . . . . . 6  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  -.  ( A  +Q  B )  e.  ( 2nd `  <. { l  |  l  <Q  ( A  +Q  B ) } ,  { u  |  ( A  +Q  B
)  <Q  u } >. ) )
191, 18ssneldd 3231 . . . . 5  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  -.  ( A  +Q  B )  e.  ( 2nd `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
) )
2019adantr 276 . . . 4  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  r  e.  ( 1st `  <. { l  |  l  <Q  ( A  +Q  B ) } ,  { u  |  ( A  +Q  B )  <Q  u } >. ) )  ->  -.  ( A  +Q  B
)  e.  ( 2nd `  ( <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. ) ) )
21 nqprlu 7810 . . . . . . 7  |-  ( A  e.  Q.  ->  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  e.  P. )
22 nqprlu 7810 . . . . . . 7  |-  ( B  e.  Q.  ->  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >.  e.  P. )
23 addclpr 7800 . . . . . . 7  |-  ( (
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  e.  P.  /\ 
<. { l  |  l 
<Q  B } ,  {
u  |  B  <Q  u } >.  e.  P. )  ->  ( <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )  e.  P. )
2421, 22, 23syl2an 289 . . . . . 6  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )  e.  P. )
25 prop 7738 . . . . . 6  |-  ( (
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )  e.  P.  ->  <. ( 1st `  ( <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. ) ) ,  ( 2nd `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
) >.  e.  P. )
2624, 25syl 14 . . . . 5  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  -> 
<. ( 1st `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
) ,  ( 2nd `  ( <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. ) ) >.  e.  P. )
27 vex 2806 . . . . . . 7  |-  r  e. 
_V
28 breq1 4096 . . . . . . 7  |-  ( l  =  r  ->  (
l  <Q  ( A  +Q  B )  <->  r  <Q  ( A  +Q  B ) ) )
2914, 15op1st 6318 . . . . . . 7  |-  ( 1st `  <. { l  |  l  <Q  ( A  +Q  B ) } ,  { u  |  ( A  +Q  B )  <Q  u } >. )  =  {
l  |  l  <Q 
( A  +Q  B
) }
3027, 28, 29elab2 2955 . . . . . 6  |-  ( r  e.  ( 1st `  <. { l  |  l  <Q 
( A  +Q  B
) } ,  {
u  |  ( A  +Q  B )  <Q  u } >. )  <->  r  <Q  ( A  +Q  B ) )
3130biimpi 120 . . . . 5  |-  ( r  e.  ( 1st `  <. { l  |  l  <Q 
( A  +Q  B
) } ,  {
u  |  ( A  +Q  B )  <Q  u } >. )  ->  r  <Q  ( A  +Q  B
) )
32 prloc 7754 . . . . 5  |-  ( (
<. ( 1st `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
) ,  ( 2nd `  ( <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. ) ) >.  e.  P.  /\  r  <Q  ( A  +Q  B ) )  -> 
( r  e.  ( 1st `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
)  \/  ( A  +Q  B )  e.  ( 2nd `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
) ) )
3326, 31, 32syl2an 289 . . . 4  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  r  e.  ( 1st `  <. { l  |  l  <Q  ( A  +Q  B ) } ,  { u  |  ( A  +Q  B )  <Q  u } >. ) )  -> 
( r  e.  ( 1st `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
)  \/  ( A  +Q  B )  e.  ( 2nd `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
) ) )
3420, 33ecased 1386 . . 3  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  r  e.  ( 1st `  <. { l  |  l  <Q  ( A  +Q  B ) } ,  { u  |  ( A  +Q  B )  <Q  u } >. ) )  -> 
r  e.  ( 1st `  ( <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. ) ) )
3534ex 115 . 2  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( r  e.  ( 1st `  <. { l  |  l  <Q  ( A  +Q  B ) } ,  { u  |  ( A  +Q  B
)  <Q  u } >. )  ->  r  e.  ( 1st `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
) ) )
3635ssrdv 3234 1  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( 1st `  <. { l  |  l  <Q 
( A  +Q  B
) } ,  {
u  |  ( A  +Q  B )  <Q  u } >. )  C_  ( 1st `  ( <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  +P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 716    e. wcel 2202   {cab 2217   _Vcvv 2803    C_ wss 3201   <.cop 3676   class class class wbr 4093    Or wor 4398   ` cfv 5333  (class class class)co 6028   1stc1st 6310   2ndc2nd 6311   Q.cnq 7543    +Q cplq 7545    <Q cltq 7548   P.cnp 7554    +P. cpp 7556
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-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  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-nul 3497  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-tr 4193  df-eprel 4392  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-suc 4474  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-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-1o 6625  df-2o 6626  df-oadd 6629  df-omul 6630  df-er 6745  df-ec 6747  df-qs 6751  df-ni 7567  df-pli 7568  df-mi 7569  df-lti 7570  df-plpq 7607  df-mpq 7608  df-enq 7610  df-nqqs 7611  df-plqqs 7612  df-mqqs 7613  df-1nqqs 7614  df-rq 7615  df-ltnqqs 7616  df-enq0 7687  df-nq0 7688  df-0nq0 7689  df-plq0 7690  df-mq0 7691  df-inp 7729  df-iplp 7731
This theorem is referenced by:  addnqpr  7824
  Copyright terms: Public domain W3C validator