Theorem genpprecll 7829

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.

Step	Hyp	Ref	Expression
1		eqid 2232	. . 3 |- ( C G D ) = ( C G D )
2		rspceov 6093	. . 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 ) )
3	1, 2	mp3an3 1363	. 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. )
6	4, 5	genpelvl 7827	. 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 ) ) )
7	3, 6	imbitrrid 156	1 |- ( ( A e. P. /\ B e. P. ) -> ( ( C e. ( 1st ` A ) /\ D e. ( 1st ` B ) ) -> ( C G D ) e. ( 1st ` ( A F B ) ) ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   e. wcel 2203   E.wrex 2521   {crab 2524   <.cop 3692   ` cfv 5352  (class class class)co 6050   e. cmpo 6052   1stc1st 6332   2ndc2nd 6333   Q.cnq 7595   P.cnp 7606

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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-qs 6773  df-ni 7619  df-nqqs 7663  df-inp 7781

This theorem is referenced by:  genpml  7832  genprndl  7836  addnqprl  7844  mulnqprl  7883  distrlem1prl  7897  distrlem4prl  7899  ltaddpr  7912  ltexprlemrl  7925  addcanprleml  7929  addcanprlemu  7930