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

Theorem recexprlemss1u 7953
Description: The upper cut of  A  .P.  B is a subset of the upper cut of one. Lemma for recexpr 7955. (Contributed by Jim Kingdon, 27-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
recexprlemss1u  |-  ( A  e.  P.  ->  ( 2nd `  ( A  .P.  B ) )  C_  ( 2nd `  1P ) )
Distinct variable groups:    x, y, A   
x, B, y

Proof of Theorem recexprlemss1u
Dummy variables  q  z  w  u  f  g are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 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 ) ) }
>.
21recexprlempr 7949 . . . . 5  |-  ( A  e.  P.  ->  B  e.  P. )
3 df-imp 7786 . . . . . 6  |-  .P.  =  ( y  e.  P. ,  w  e.  P.  |->  <. { u  e.  Q.  |  E. f  e.  Q.  E. g  e.  Q.  (
f  e.  ( 1st `  y )  /\  g  e.  ( 1st `  w
)  /\  u  =  ( f  .Q  g
) ) } ,  { u  e.  Q.  |  E. f  e.  Q.  E. g  e.  Q.  (
f  e.  ( 2nd `  y )  /\  g  e.  ( 2nd `  w
)  /\  u  =  ( f  .Q  g
) ) } >. )
4 mulclnq 7693 . . . . . 6  |-  ( ( f  e.  Q.  /\  g  e.  Q. )  ->  ( f  .Q  g
)  e.  Q. )
53, 4genpelvu 7830 . . . . 5  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( w  e.  ( 2nd `  ( A  .P.  B ) )  <->  E. z  e.  ( 2nd `  A ) E. q  e.  ( 2nd `  B ) w  =  ( z  .Q  q
) ) )
62, 5mpdan 421 . . . 4  |-  ( A  e.  P.  ->  (
w  e.  ( 2nd `  ( A  .P.  B
) )  <->  E. z  e.  ( 2nd `  A
) E. q  e.  ( 2nd `  B
) w  =  ( z  .Q  q ) ) )
71recexprlemelu 7940 . . . . . . . 8  |-  ( q  e.  ( 2nd `  B
)  <->  E. y ( y 
<Q  q  /\  ( *Q `  y )  e.  ( 1st `  A
) ) )
8 ltrelnq 7682 . . . . . . . . . . . . . 14  |-  <Q  C_  ( Q.  X.  Q. )
98brel 4804 . . . . . . . . . . . . 13  |-  ( y 
<Q  q  ->  ( y  e.  Q.  /\  q  e.  Q. ) )
109simpld 112 . . . . . . . . . . . 12  |-  ( y 
<Q  q  ->  y  e. 
Q. )
11 prop 7792 . . . . . . . . . . . . . . . . . 18  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
12 elprnqu 7799 . . . . . . . . . . . . . . . . . 18  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
z  e.  Q. )
1311, 12sylan 283 . . . . . . . . . . . . . . . . 17  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
z  e.  Q. )
14 ltmnqi 7720 . . . . . . . . . . . . . . . . . 18  |-  ( ( y  <Q  q  /\  z  e.  Q. )  ->  ( z  .Q  y
)  <Q  ( z  .Q  q ) )
1514expcom 116 . . . . . . . . . . . . . . . . 17  |-  ( z  e.  Q.  ->  (
y  <Q  q  ->  (
z  .Q  y ) 
<Q  ( z  .Q  q
) ) )
1613, 15syl 14 . . . . . . . . . . . . . . . 16  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
( y  <Q  q  ->  ( z  .Q  y
)  <Q  ( z  .Q  q ) ) )
1716adantr 276 . . . . . . . . . . . . . . 15  |-  ( ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  /\  y  e.  Q. )  ->  ( y  <Q  q  ->  ( z  .Q  y
)  <Q  ( z  .Q  q ) ) )
18 prltlu 7804 . . . . . . . . . . . . . . . . . . . 20  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  ( *Q `  y
)  e.  ( 1st `  A )  /\  z  e.  ( 2nd `  A
) )  ->  ( *Q `  y )  <Q 
z )
1911, 18syl3an1 1307 . . . . . . . . . . . . . . . . . . 19  |-  ( ( A  e.  P.  /\  ( *Q `  y )  e.  ( 1st `  A
)  /\  z  e.  ( 2nd `  A ) )  ->  ( *Q `  y )  <Q  z
)
20193com23 1236 . . . . . . . . . . . . . . . . . 18  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A )  /\  ( *Q `  y )  e.  ( 1st `  A
) )  ->  ( *Q `  y )  <Q 
z )
21203expia 1232 . . . . . . . . . . . . . . . . 17  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
( ( *Q `  y )  e.  ( 1st `  A )  ->  ( *Q `  y )  <Q  z
) )
2221adantr 276 . . . . . . . . . . . . . . . 16  |-  ( ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  /\  y  e.  Q. )  ->  ( ( *Q `  y )  e.  ( 1st `  A )  ->  ( *Q `  y )  <Q  z
) )
23 ltmnqi 7720 . . . . . . . . . . . . . . . . . . . . 21  |-  ( ( ( *Q `  y
)  <Q  z  /\  y  e.  Q. )  ->  (
y  .Q  ( *Q
`  y ) ) 
<Q  ( y  .Q  z
) )
2423expcom 116 . . . . . . . . . . . . . . . . . . . 20  |-  ( y  e.  Q.  ->  (
( *Q `  y
)  <Q  z  ->  (
y  .Q  ( *Q
`  y ) ) 
<Q  ( y  .Q  z
) ) )
2524adantr 276 . . . . . . . . . . . . . . . . . . 19  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( ( *Q `  y )  <Q  z  ->  ( y  .Q  ( *Q `  y ) ) 
<Q  ( y  .Q  z
) ) )
26 recidnq 7710 . . . . . . . . . . . . . . . . . . . . 21  |-  ( y  e.  Q.  ->  (
y  .Q  ( *Q
`  y ) )  =  1Q )
2726adantr 276 . . . . . . . . . . . . . . . . . . . 20  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y  .Q  ( *Q `  y ) )  =  1Q )
28 mulcomnqg 7700 . . . . . . . . . . . . . . . . . . . 20  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y  .Q  z
)  =  ( z  .Q  y ) )
2927, 28breq12d 4124 . . . . . . . . . . . . . . . . . . 19  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( ( y  .Q  ( *Q `  y
) )  <Q  (
y  .Q  z )  <-> 
1Q  <Q  ( z  .Q  y ) ) )
3025, 29sylibd 149 . . . . . . . . . . . . . . . . . 18  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( ( *Q `  y )  <Q  z  ->  1Q  <Q  ( z  .Q  y ) ) )
3130ancoms 268 . . . . . . . . . . . . . . . . 17  |-  ( ( z  e.  Q.  /\  y  e.  Q. )  ->  ( ( *Q `  y )  <Q  z  ->  1Q  <Q  ( z  .Q  y ) ) )
3213, 31sylan 283 . . . . . . . . . . . . . . . 16  |-  ( ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  /\  y  e.  Q. )  ->  ( ( *Q `  y )  <Q  z  ->  1Q  <Q  ( z  .Q  y ) ) )
3322, 32syld 45 . . . . . . . . . . . . . . 15  |-  ( ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  /\  y  e.  Q. )  ->  ( ( *Q `  y )  e.  ( 1st `  A )  ->  1Q  <Q  (
z  .Q  y ) ) )
3417, 33anim12d 335 . . . . . . . . . . . . . 14  |-  ( ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  /\  y  e.  Q. )  ->  ( ( y  <Q 
q  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  ( (
z  .Q  y ) 
<Q  ( z  .Q  q
)  /\  1Q  <Q  ( z  .Q  y ) ) ) )
35 ltsonq 7715 . . . . . . . . . . . . . . . 16  |-  <Q  Or  Q.
3635, 8sotri 5160 . . . . . . . . . . . . . . 15  |-  ( ( 1Q  <Q  ( z  .Q  y )  /\  (
z  .Q  y ) 
<Q  ( z  .Q  q
) )  ->  1Q  <Q  ( z  .Q  q
) )
3736ancoms 268 . . . . . . . . . . . . . 14  |-  ( ( ( z  .Q  y
)  <Q  ( z  .Q  q )  /\  1Q  <Q  ( z  .Q  y
) )  ->  1Q  <Q  ( z  .Q  q
) )
3834, 37syl6 33 . . . . . . . . . . . . 13  |-  ( ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  /\  y  e.  Q. )  ->  ( ( y  <Q 
q  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  1Q  <Q  ( z  .Q  q ) ) )
3938exp4b 367 . . . . . . . . . . . 12  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
( y  e.  Q.  ->  ( y  <Q  q  ->  ( ( *Q `  y )  e.  ( 1st `  A )  ->  1Q  <Q  (
z  .Q  q ) ) ) ) )
4010, 39syl5 32 . . . . . . . . . . 11  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
( y  <Q  q  ->  ( y  <Q  q  ->  ( ( *Q `  y )  e.  ( 1st `  A )  ->  1Q  <Q  (
z  .Q  q ) ) ) ) )
4140pm2.43d 50 . . . . . . . . . 10  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
( y  <Q  q  ->  ( ( *Q `  y )  e.  ( 1st `  A )  ->  1Q  <Q  (
z  .Q  q ) ) ) )
4241impd 254 . . . . . . . . 9  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
( ( y  <Q 
q  /\  ( *Q `  y )  e.  ( 1st `  A ) )  ->  1Q  <Q  ( z  .Q  q ) ) )
4342exlimdv 1868 . . . . . . . 8  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
( E. y ( y  <Q  q  /\  ( *Q `  y )  e.  ( 1st `  A
) )  ->  1Q  <Q  ( z  .Q  q
) ) )
447, 43biimtrid 152 . . . . . . 7  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
( q  e.  ( 2nd `  B )  ->  1Q  <Q  (
z  .Q  q ) ) )
45 breq2 4115 . . . . . . . 8  |-  ( w  =  ( z  .Q  q )  ->  ( 1Q  <Q  w  <->  1Q  <Q  ( z  .Q  q ) ) )
4645biimprcd 160 . . . . . . 7  |-  ( 1Q 
<Q  ( z  .Q  q
)  ->  ( w  =  ( z  .Q  q )  ->  1Q  <Q  w ) )
4744, 46syl6 33 . . . . . 6  |-  ( ( A  e.  P.  /\  z  e.  ( 2nd `  A ) )  -> 
( q  e.  ( 2nd `  B )  ->  ( w  =  ( z  .Q  q
)  ->  1Q  <Q  w ) ) )
4847expimpd 363 . . . . 5  |-  ( A  e.  P.  ->  (
( z  e.  ( 2nd `  A )  /\  q  e.  ( 2nd `  B ) )  ->  ( w  =  ( z  .Q  q )  ->  1Q  <Q  w ) ) )
4948rexlimdvv 2669 . . . 4  |-  ( A  e.  P.  ->  ( E. z  e.  ( 2nd `  A ) E. q  e.  ( 2nd `  B ) w  =  ( z  .Q  q
)  ->  1Q  <Q  w ) )
506, 49sylbid 150 . . 3  |-  ( A  e.  P.  ->  (
w  e.  ( 2nd `  ( A  .P.  B
) )  ->  1Q  <Q  w ) )
51 1pru 7873 . . . 4  |-  ( 2nd `  1P )  =  {
w  |  1Q  <Q  w }
5251abeq2i 2345 . . 3  |-  ( w  e.  ( 2nd `  1P ) 
<->  1Q  <Q  w )
5350, 52imbitrrdi 162 . 2  |-  ( A  e.  P.  ->  (
w  e.  ( 2nd `  ( A  .P.  B
) )  ->  w  e.  ( 2nd `  1P ) ) )
5453ssrdv 3246 1  |-  ( A  e.  P.  ->  ( 2nd `  ( A  .P.  B ) )  C_  ( 2nd `  1P ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398   E.wex 1541    e. wcel 2205   {cab 2220   E.wrex 2523    C_ wss 3213   <.cop 3694   class class class wbr 4111   ` cfv 5354  (class class class)co 6052   1stc1st 6334   2ndc2nd 6335   Q.cnq 7597   1Qc1q 7598    .Q cmq 7600   *Qcrq 7601    <Q cltq 7602   P.cnp 7608   1Pc1p 7609    .P. cmp 7611
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712
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 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-eprel 4412  df-id 4416  df-po 4419  df-iso 4420  df-iord 4489  df-on 4491  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-irdg 6603  df-1o 6649  df-oadd 6653  df-omul 6654  df-er 6769  df-ec 6771  df-qs 6775  df-ni 7621  df-pli 7622  df-mi 7623  df-lti 7624  df-plpq 7661  df-mpq 7662  df-enq 7664  df-nqqs 7665  df-plqqs 7666  df-mqqs 7667  df-1nqqs 7668  df-rq 7669  df-ltnqqs 7670  df-inp 7783  df-i1p 7784  df-imp 7786
This theorem is referenced by:  recexprlemex  7954
  Copyright terms: Public domain W3C validator