Theorem resoprab2 6175

Description: Restriction of an operator abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.)

Assertion

Ref	Expression
resoprab2	|- ( ( C C_ A /\ D C_ B ) -> ( { <. <. x , y >. , z >. | ( ( x e. A /\ y e. B ) /\ ph ) } |` ( C X. D ) ) = { <. <. x , y >. , z >. | ( ( x e. C /\ y e. D ) /\ ph ) } )

Distinct variable groups:   x, A, y, z   x, B, y, z   x, C, y, z   x, D, y, z

Allowed substitution hints:   ph( x, y, z)

Proof of Theorem resoprab2

Step	Hyp	Ref	Expression
1		resoprab 6174	. 2 |- ( { <. <. x , y >. , z >. | ( ( x e. A /\ y e. B ) /\ ph ) } |` ( C X. D ) ) = { <. <. x , y >. , z >. | ( ( x e. C /\ y e. D ) /\ ( ( x e. A /\ y e. B ) /\ ph ) ) }
2		anass 405	. . . 4 |- ( ( ( ( x e. C /\ y e. D ) /\ ( x e. A /\ y e. B ) ) /\ ph ) <-> ( ( x e. C /\ y e. D ) /\ ( ( x e. A /\ y e. B ) /\ ph ) ) )
3		an4 592	. . . . . 6 |- ( ( ( x e. C /\ y e. D ) /\ ( x e. A /\ y e. B ) ) <-> ( ( x e. C /\ x e. A ) /\ ( y e. D /\ y e. B ) ) )
4		ssel 3242	. . . . . . . . 9 |- ( C C_ A -> ( x e. C -> x e. A ) )
5	4	pm4.71d 397	. . . . . . . 8 |- ( C C_ A -> ( x e. C <-> ( x e. C /\ x e. A ) ) )
6	5	bicomd 141	. . . . . . 7 |- ( C C_ A -> ( ( x e. C /\ x e. A ) <-> x e. C ) )
7		ssel 3242	. . . . . . . . 9 |- ( D C_ B -> ( y e. D -> y e. B ) )
8	7	pm4.71d 397	. . . . . . . 8 |- ( D C_ B -> ( y e. D <-> ( y e. D /\ y e. B ) ) )
9	8	bicomd 141	. . . . . . 7 |- ( D C_ B -> ( ( y e. D /\ y e. B ) <-> y e. D ) )
10	6, 9	bi2anan9 614	. . . . . 6 |- ( ( C C_ A /\ D C_ B ) -> ( ( ( x e. C /\ x e. A ) /\ ( y e. D /\ y e. B ) ) <-> ( x e. C /\ y e. D ) ) )
11	3, 10	bitrid 192	. . . . 5 |- ( ( C C_ A /\ D C_ B ) -> ( ( ( x e. C /\ y e. D ) /\ ( x e. A /\ y e. B ) ) <-> ( x e. C /\ y e. D ) ) )
12	11	anbi1d 469	. . . 4 |- ( ( C C_ A /\ D C_ B ) -> ( ( ( ( x e. C /\ y e. D ) /\ ( x e. A /\ y e. B ) ) /\ ph ) <-> ( ( x e. C /\ y e. D ) /\ ph ) ) )
13	2, 12	bitr3id 194	. . 3 |- ( ( C C_ A /\ D C_ B ) -> ( ( ( x e. C /\ y e. D ) /\ ( ( x e. A /\ y e. B ) /\ ph ) ) <-> ( ( x e. C /\ y e. D ) /\ ph ) ) )
14	13	oprabbidv 6132	. 2 |- ( ( C C_ A /\ D C_ B ) -> { <. <. x , y >. , z >. | ( ( x e. C /\ y e. D ) /\ ( ( x e. A /\ y e. B ) /\ ph ) ) } = { <. <. x , y >. , z >. | ( ( x e. C /\ y e. D ) /\ ph ) } )
15	1, 14	eqtrid 2283	1 |- ( ( C C_ A /\ D C_ B ) -> ( { <. <. x , y >. , z >. | ( ( x e. A /\ y e. B ) /\ ph ) } |` ( C X. D ) ) = { <. <. x , y >. , z >. | ( ( x e. C /\ y e. D ) /\ ph ) } )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   C_ wss 3220   X. cxp 4767   |` cres 4771   {coprab 6076

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-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-opab 4188  df-xp 4775  df-rel 4776  df-res 4781  df-oprab 6079

This theorem is referenced by:  resmpo  6176