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

Theorem mulnqprlemfu 7789
Description: Lemma for mulnqpr 7790. The forward subset relationship for the upper cut. (Contributed by Jim Kingdon, 18-Jul-2021.)
Assertion
Ref Expression
mulnqprlemfu  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( 2nd `  <. { l  |  l  <Q 
( A  .Q  B
) } ,  {
u  |  ( A  .Q  B )  <Q  u } >. )  C_  ( 2nd `  ( <. { 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 mulnqprlemfu
Dummy variable  r is distinct from all other variables.
StepHypRef Expression
1 mulnqprlemrl 7786 . . . . . 6  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( 1st `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  .P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
)  C_  ( 1st ` 
<. { l  |  l 
<Q  ( A  .Q  B
) } ,  {
u  |  ( A  .Q  B )  <Q  u } >. ) )
2 ltsonq 7611 . . . . . . . . 9  |-  <Q  Or  Q.
3 mulclnq 7589 . . . . . . . . 9  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  .Q  B
)  e.  Q. )
4 sonr 4412 . . . . . . . . 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 7578 . . . . . . . . . . . 12  |-  <Q  C_  ( Q.  X.  Q. )
76brel 4776 . . . . . . . . . . 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 2812 . . . . . . . . . 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 breq1 4089 . . . . . . . . 9  |-  ( l  =  ( A  .Q  B )  ->  (
l  <Q  ( A  .Q  B )  <->  ( A  .Q  B )  <Q  ( A  .Q  B ) ) )
1210, 11elab3 2956 . . . . . . . 8  |-  ( ( A  .Q  B )  e.  { l  |  l  <Q  ( A  .Q  B ) }  <->  ( A  .Q  B )  <Q  ( A  .Q  B ) )
135, 12sylnibr 681 . . . . . . 7  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  -.  ( A  .Q  B )  e.  {
l  |  l  <Q 
( A  .Q  B
) } )
14 ltnqex 7762 . . . . . . . . 9  |-  { l  |  l  <Q  ( A  .Q  B ) }  e.  _V
15 gtnqex 7763 . . . . . . . . 9  |-  { u  |  ( A  .Q  B )  <Q  u }  e.  _V
1614, 15op1st 6304 . . . . . . . 8  |-  ( 1st `  <. { l  |  l  <Q  ( A  .Q  B ) } ,  { u  |  ( A  .Q  B )  <Q  u } >. )  =  {
l  |  l  <Q 
( A  .Q  B
) }
1716eleq2i 2296 . . . . . . 7  |-  ( ( A  .Q  B )  e.  ( 1st `  <. { l  |  l  <Q 
( A  .Q  B
) } ,  {
u  |  ( A  .Q  B )  <Q  u } >. )  <->  ( A  .Q  B )  e.  {
l  |  l  <Q 
( A  .Q  B
) } )
1813, 17sylnibr 681 . . . . . 6  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  -.  ( A  .Q  B )  e.  ( 1st `  <. { l  |  l  <Q  ( A  .Q  B ) } ,  { u  |  ( A  .Q  B
)  <Q  u } >. ) )
191, 18ssneldd 3228 . . . . 5  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  -.  ( A  .Q  B )  e.  ( 1st `  ( <. { 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.  ( 2nd `  <. { l  |  l  <Q  ( A  .Q  B ) } ,  { u  |  ( A  .Q  B )  <Q  u } >. ) )  ->  -.  ( A  .Q  B
)  e.  ( 1st `  ( <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  .P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. ) ) )
21 nqprlu 7760 . . . . . . . 8  |-  ( A  e.  Q.  ->  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  e.  P. )
22 nqprlu 7760 . . . . . . . 8  |-  ( B  e.  Q.  ->  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >.  e.  P. )
23 mulclpr 7785 . . . . . . . 8  |-  ( (
<. { 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 . . . . . . 7  |-  ( ( 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 7688 . . . . . . 7  |-  ( (
<. { 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 . . . . . 6  |-  ( ( 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 2803 . . . . . . . 8  |-  r  e. 
_V
28 breq2 4090 . . . . . . . 8  |-  ( u  =  r  ->  (
( A  .Q  B
)  <Q  u  <->  ( A  .Q  B )  <Q  r
) )
2914, 15op2nd 6305 . . . . . . . 8  |-  ( 2nd `  <. { l  |  l  <Q  ( A  .Q  B ) } ,  { u  |  ( A  .Q  B )  <Q  u } >. )  =  {
u  |  ( A  .Q  B )  <Q  u }
3027, 28, 29elab2 2952 . . . . . . 7  |-  ( r  e.  ( 2nd `  <. { l  |  l  <Q 
( A  .Q  B
) } ,  {
u  |  ( A  .Q  B )  <Q  u } >. )  <->  ( A  .Q  B )  <Q  r
)
3130biimpi 120 . . . . . 6  |-  ( r  e.  ( 2nd `  <. { l  |  l  <Q 
( A  .Q  B
) } ,  {
u  |  ( A  .Q  B )  <Q  u } >. )  ->  ( A  .Q  B )  <Q 
r )
32 prloc 7704 . . . . . 6  |-  ( (
<. ( 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.  /\  ( A  .Q  B
)  <Q  r )  -> 
( ( A  .Q  B )  e.  ( 1st `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  .P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
)  \/  r  e.  ( 2nd `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  .P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
) ) )
3326, 31, 32syl2an 289 . . . . 5  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  r  e.  ( 2nd `  <. { l  |  l  <Q  ( A  .Q  B ) } ,  { u  |  ( A  .Q  B )  <Q  u } >. ) )  -> 
( ( A  .Q  B )  e.  ( 1st `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  .P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
)  \/  r  e.  ( 2nd `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  .P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
) ) )
3433orcomd 734 . . . 4  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  r  e.  ( 2nd `  <. { l  |  l  <Q  ( A  .Q  B ) } ,  { u  |  ( A  .Q  B )  <Q  u } >. ) )  -> 
( r  e.  ( 2nd `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  .P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
)  \/  ( A  .Q  B )  e.  ( 1st `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  .P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
) ) )
3520, 34ecased 1383 . . 3  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  r  e.  ( 2nd `  <. { l  |  l  <Q  ( A  .Q  B ) } ,  { u  |  ( A  .Q  B )  <Q  u } >. ) )  -> 
r  e.  ( 2nd `  ( <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  .P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. ) ) )
3635ex 115 . 2  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( r  e.  ( 2nd `  <. { l  |  l  <Q  ( A  .Q  B ) } ,  { u  |  ( A  .Q  B
)  <Q  u } >. )  ->  r  e.  ( 2nd `  ( <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  .P.  <. { l  |  l  <Q  B } ,  { u  |  B  <Q  u } >. )
) ) )
3736ssrdv 3231 1  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( 2nd `  <. { l  |  l  <Q 
( A  .Q  B
) } ,  {
u  |  ( A  .Q  B )  <Q  u } >. )  C_  ( 2nd `  ( <. { 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 713    e. wcel 2200   {cab 2215   _Vcvv 2800    C_ wss 3198   <.cop 3670   class class class wbr 4086    Or wor 4390   ` cfv 5324  (class class class)co 6013   1stc1st 6296   2ndc2nd 6297   Q.cnq 7493    .Q cmq 7496    <Q cltq 7498   P.cnp 7504    .P. cmp 7507
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-eprel 4384  df-id 4388  df-po 4391  df-iso 4392  df-iord 4461  df-on 4463  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-irdg 6531  df-1o 6577  df-2o 6578  df-oadd 6581  df-omul 6582  df-er 6697  df-ec 6699  df-qs 6703  df-ni 7517  df-pli 7518  df-mi 7519  df-lti 7520  df-plpq 7557  df-mpq 7558  df-enq 7560  df-nqqs 7561  df-plqqs 7562  df-mqqs 7563  df-1nqqs 7564  df-rq 7565  df-ltnqqs 7566  df-enq0 7637  df-nq0 7638  df-0nq0 7639  df-plq0 7640  df-mq0 7641  df-inp 7679  df-imp 7682
This theorem is referenced by:  mulnqpr  7790
  Copyright terms: Public domain W3C validator