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

Theorem genpprecll 6612
Description: Pre-closure law for general operation on lower cuts. (Contributed by Jim Kingdon, 2-Oct-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
genpprecll  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( C  e.  ( 1st `  A
)  /\  D  e.  ( 1st `  B ) )  ->  ( C G D )  e.  ( 1st `  ( 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 genpprecll
Dummy variables  g  h are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2040 . . 3  |-  ( C G D )  =  ( C G D )
2 rspceov 5547 . . 3  |-  ( ( C  e.  ( 1st `  A )  /\  D  e.  ( 1st `  B
)  /\  ( C G D )  =  ( C G D ) )  ->  E. g  e.  ( 1st `  A
) E. h  e.  ( 1st `  B
) ( C G D )  =  ( g G h ) )
31, 2mp3an3 1221 . 2  |-  ( ( C  e.  ( 1st `  A )  /\  D  e.  ( 1st `  B
) )  ->  E. g  e.  ( 1st `  A
) E. h  e.  ( 1st `  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, 5genpelvl 6610 . 2  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( C G D )  e.  ( 1st `  ( A F B ) )  <->  E. g  e.  ( 1st `  A ) E. h  e.  ( 1st `  B ) ( C G D )  =  ( g G h ) ) )
73, 6syl5ibr 145 1  |-  ( ( A  e.  P.  /\  B  e.  P. )  ->  ( ( C  e.  ( 1st `  A
)  /\  D  e.  ( 1st `  B ) )  ->  ( C G D )  e.  ( 1st `  ( A F B ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    /\ w3a 885    = wceq 1243    e. wcel 1393   E.wrex 2307   {crab 2310   <.cop 3378   ` cfv 4902  (class class class)co 5512    |-> cmpt2 5514   1stc1st 5765   2ndc2nd 5766   Q.cnq 6378   P.cnp 6389
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-qs 6112  df-ni 6402  df-nqqs 6446  df-inp 6564
This theorem is referenced by:  genpml  6615  genprndl  6619  addnqprl  6627  mulnqprl  6666  distrlem1prl  6680  distrlem4prl  6682  ltaddpr  6695  ltexprlemrl  6708  addcanprleml  6712  addcanprlemu  6713
  Copyright terms: Public domain W3C validator