Theorem oprabbid 5659

Description: Equivalent wff's yield equal operation class abstractions (deduction rule). (Contributed by NM, 21-Feb-2004.) (Revised by Mario Carneiro, 24-Jun-2014.)

Hypotheses

Ref	Expression
oprabbid.1	|- F/ x ph
oprabbid.2	|- F/ y ph
oprabbid.3	|- F/ z ph
oprabbid.4	|- ( ph -> ( ps <-> ch ) )

Assertion

Ref	Expression
oprabbid	|- ( ph -> { <. <. x , y >. , z >. | ps } = { <. <. x , y >. , z >. | ch } )

Distinct variable groups:   x, z   y, z

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

Proof of Theorem oprabbid

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		oprabbid.1	. . . 4 |- F/ x ph
2		oprabbid.2	. . . . 5 |- F/ y ph
3		oprabbid.3	. . . . . 6 |- F/ z ph
4		oprabbid.4	. . . . . . 7 |- ( ph -> ( ps <-> ch ) )
5	4	anbi2d 452	. . . . . 6 |- ( ph -> ( ( w = <. <. x , y >. , z >. /\ ps ) <-> ( w = <. <. x , y >. , z >. /\ ch ) ) )
6	3, 5	exbid 1550	. . . . 5 |- ( ph -> ( E. z ( w = <. <. x , y >. , z >. /\ ps ) <-> E. z ( w = <. <. x , y >. , z >. /\ ch ) ) )
7	2, 6	exbid 1550	. . . 4 |- ( ph -> ( E. y E. z ( w = <. <. x , y >. , z >. /\ ps ) <-> E. y E. z ( w = <. <. x , y >. , z >. /\ ch ) ) )
8	1, 7	exbid 1550	. . 3 |- ( ph -> ( E. x E. y E. z ( w = <. <. x , y >. , z >. /\ ps ) <-> E. x E. y E. z ( w = <. <. x , y >. , z >. /\ ch ) ) )
9	8	abbidv 2202	. 2 |- ( ph -> { w | E. x E. y E. z ( w = <. <. x , y >. , z >. /\ ps ) } = { w | E. x E. y E. z ( w = <. <. x , y >. , z >. /\ ch ) } )
10		df-oprab 5617	. 2 |- { <. <. x , y >. , z >. | ps } = { w | E. x E. y E. z ( w = <. <. x , y >. , z >. /\ ps ) }
11		df-oprab 5617	. 2 |- { <. <. x , y >. , z >. | ch } = { w | E. x E. y E. z ( w = <. <. x , y >. , z >. /\ ch ) }
12	9, 10, 11	3eqtr4g 2142	1 |- ( ph -> { <. <. x , y >. , z >. | ps } = { <. <. x , y >. , z >. | ch } )

Syntax hints:   -> wi 4   /\ wa 102   <-> wb 103   = wceq 1287   F/wnf 1392   E.wex 1424   {cab 2071   <.cop 3434   {coprab 5614

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-11 1440  ax-4 1443  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067

This theorem depends on definitions:  df-bi 115  df-tru 1290  df-nf 1393  df-sb 1690  df-clab 2072  df-cleq 2078  df-oprab 5617

This theorem is referenced by:  oprabbidv  5660  mpt2eq123  5665