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

Theorem genppreclu 6671
Description: Pre-closure law for general operation on upper cuts. (Contributed by Jim Kingdon, 7-Nov-2019.)
Hypotheses
Ref Expression
genpelvl.1  |-  F  =  ( w  e.  P. ,  v  e.  P.  |->  <. { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 1st `  w )  /\  z  e.  ( 1st `  v
)  /\  x  =  ( y G z ) ) } ,  { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 2nd `  w )  /\  z  e.  ( 2nd `  v
)  /\  x  =  ( y G z ) ) } >. )
genpelvl.2  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y G z )  e.  Q. )
Assertion
Ref Expression
genppreclu  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( C  e.  ( 2nd `  A
)  /\  D  e.  ( 2nd `  B ) )  ->  ( C G D )  e.  ( 2nd `  ( A F B ) ) ) )
Distinct variable groups:    x, y, z, w, v, A    x, B, y, z, w, v   
x, G, y, z, w, v
Allowed substitution hints:    C( x, y, z, w, v)    D( x, y, z, w, v)    F( x, y, z, w, v)

Proof of Theorem genppreclu
Dummy variables  g  h are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2056 . . 3  |-  ( C G D )  =  ( C G D )
2 rspceov 5575 . . 3  |-  ( ( C  e.  ( 2nd `  A )  /\  D  e.  ( 2nd `  B
)  /\  ( C G D )  =  ( C G D ) )  ->  E. g  e.  ( 2nd `  A
) E. h  e.  ( 2nd `  B
) ( C G D )  =  ( g G h ) )
31, 2mp3an3 1232 . 2  |-  ( ( C  e.  ( 2nd `  A )  /\  D  e.  ( 2nd `  B
) )  ->  E. g  e.  ( 2nd `  A
) E. h  e.  ( 2nd `  B
) ( C G D )  =  ( g G h ) )
4 genpelvl.1 . . 3  |-  F  =  ( w  e.  P. ,  v  e.  P.  |->  <. { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 1st `  w )  /\  z  e.  ( 1st `  v
)  /\  x  =  ( y G z ) ) } ,  { x  e.  Q.  |  E. y  e.  Q.  E. z  e.  Q.  (
y  e.  ( 2nd `  w )  /\  z  e.  ( 2nd `  v
)  /\  x  =  ( y G z ) ) } >. )
5 genpelvl.2 . . 3  |-  ( ( y  e.  Q.  /\  z  e.  Q. )  ->  ( y G z )  e.  Q. )
64, 5genpelvu 6669 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( C G D )  e.  ( 2nd `  ( A F B ) )  <->  E. g  e.  ( 2nd `  A ) E. h  e.  ( 2nd `  B ) ( C G D )  =  ( g G h ) ) )
73, 6syl5ibr 149 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( C  e.  ( 2nd `  A
)  /\  D  e.  ( 2nd `  B ) )  ->  ( C G D )  e.  ( 2nd `  ( A F B ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 101    /\ w3a 896    = wceq 1259    e. wcel 1409   E.wrex 2324   {crab 2327   <.cop 3406   ` cfv 4930  (class class class)co 5540    |-> cmpt2 5542   1stc1st 5793   2ndc2nd 5794   Q.cnq 6436   P.cnp 6447
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-coll 3900  ax-sep 3903  ax-pow 3955  ax-pr 3972  ax-un 4198  ax-setind 4290  ax-iinf 4339
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ne 2221  df-ral 2328  df-rex 2329  df-reu 2330  df-rab 2332  df-v 2576  df-sbc 2788  df-csb 2881  df-dif 2948  df-un 2950  df-in 2952  df-ss 2959  df-pw 3389  df-sn 3409  df-pr 3410  df-op 3412  df-uni 3609  df-int 3644  df-iun 3687  df-br 3793  df-opab 3847  df-mpt 3848  df-id 4058  df-iom 4342  df-xp 4379  df-rel 4380  df-cnv 4381  df-co 4382  df-dm 4383  df-rn 4384  df-res 4385  df-ima 4386  df-iota 4895  df-fun 4932  df-fn 4933  df-f 4934  df-f1 4935  df-fo 4936  df-f1o 4937  df-fv 4938  df-ov 5543  df-oprab 5544  df-mpt2 5545  df-1st 5795  df-2nd 5796  df-qs 6143  df-ni 6460  df-nqqs 6504  df-inp 6622
This theorem is referenced by:  genpmu  6674  genprndu  6678  addnqpru  6686  mulnqpru  6725  distrlem1pru  6739  distrlem4pru  6741  ltexprlemru  6768  addcanprleml  6770  addcanprlemu  6771
  Copyright terms: Public domain W3C validator