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

Theorem addnqprlemfl 7549
Description: Lemma for addnqpr 7551. 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 7548 . . . . . 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 7388 . . . . . . . . 9  |-  <Q  Or  Q.
3 addclnq 7365 . . . . . . . . 9  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  +Q  B
)  e.  Q. )
4 sonr 4314 . . . . . . . . 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 7355 . . . . . . . . . . . 12  |-  <Q  C_  ( Q.  X.  Q. )
76brel 4675 . . . . . . . . . . 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 2748 . . . . . . . . . 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 4004 . . . . . . . . 9  |-  ( u  =  ( A  +Q  B )  ->  (
( A  +Q  B
)  <Q  u  <->  ( A  +Q  B )  <Q  ( A  +Q  B ) ) )
1210, 11elab3 2889 . . . . . . . 8  |-  ( ( A  +Q  B )  e.  { u  |  ( A  +Q  B
)  <Q  u }  <->  ( A  +Q  B )  <Q  ( A  +Q  B ) )
135, 12sylnibr 677 . . . . . . 7  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  -.  ( A  +Q  B )  e.  {
u  |  ( A  +Q  B )  <Q  u } )
14 ltnqex 7539 . . . . . . . . 9  |-  { l  |  l  <Q  ( A  +Q  B ) }  e.  _V
15 gtnqex 7540 . . . . . . . . 9  |-  { u  |  ( A  +Q  B )  <Q  u }  e.  _V
1614, 15op2nd 6142 . . . . . . . 8  |-  ( 2nd `  <. { l  |  l  <Q  ( A  +Q  B ) } ,  { u  |  ( A  +Q  B )  <Q  u } >. )  =  {
u  |  ( A  +Q  B )  <Q  u }
1716eleq2i 2244 . . . . . . 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 677 . . . . . 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 3158 . . . . 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 7537 . . . . . . 7  |-  ( A  e.  Q.  ->  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  e.  P. )
22 nqprlu 7537 . . . . . . 7  |-  ( B  e.  Q.  ->  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >.  e.  P. )
23 addclpr 7527 . . . . . . 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 7465 . . . . . 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 2740 . . . . . . 7  |-  r  e. 
_V
28 breq1 4003 . . . . . . 7  |-  ( l  =  r  ->  (
l  <Q  ( A  +Q  B )  <->  r  <Q  ( A  +Q  B ) ) )
2914, 15op1st 6141 . . . . . . 7  |-  ( 1st `  <. { l  |  l  <Q  ( A  +Q  B ) } ,  { u  |  ( A  +Q  B )  <Q  u } >. )  =  {
l  |  l  <Q 
( A  +Q  B
) }
3027, 28, 29elab2 2885 . . . . . 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 7481 . . . . 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 1349 . . 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 3161 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 708    e. wcel 2148   {cab 2163   _Vcvv 2737    C_ wss 3129   <.cop 3594   class class class wbr 4000    Or wor 4292   ` cfv 5212  (class class class)co 5869   1stc1st 6133   2ndc2nd 6134   Q.cnq 7270    +Q cplq 7272    <Q cltq 7275   P.cnp 7281    +P. cpp 7283
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-eprel 4286  df-id 4290  df-po 4293  df-iso 4294  df-iord 4363  df-on 4365  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-recs 6300  df-irdg 6365  df-1o 6411  df-2o 6412  df-oadd 6415  df-omul 6416  df-er 6529  df-ec 6531  df-qs 6535  df-ni 7294  df-pli 7295  df-mi 7296  df-lti 7297  df-plpq 7334  df-mpq 7335  df-enq 7337  df-nqqs 7338  df-plqqs 7339  df-mqqs 7340  df-1nqqs 7341  df-rq 7342  df-ltnqqs 7343  df-enq0 7414  df-nq0 7415  df-0nq0 7416  df-plq0 7417  df-mq0 7418  df-inp 7456  df-iplp 7458
This theorem is referenced by:  addnqpr  7551
  Copyright terms: Public domain W3C validator