Theorem oprabbii 6710

Description: Equivalent wff's yield equal operation class abstractions. (Contributed by NM, 28-May-1995.) (Revised by David Abernethy, 19-Jun-2012.)

Hypothesis

Ref	Expression
oprabbii.1	|- ( ph <-> ps )

Assertion

Ref	Expression
oprabbii	|- { <. <. x , y >. , z >. | ph } = { <. <. x , y >. , z >. | ps }

Distinct variable groups:   x, z   y, z

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

Proof of Theorem oprabbii

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2622	. 2 |- w = w
2		oprabbii.1	. . . 4 |- ( ph <-> ps )
3	2	a1i 11	. . 3 |- ( w = w -> ( ph <-> ps ) )
4	3	oprabbidv 6709	. 2 |- ( w = w -> { <. <. x , y >. , z >. | ph } = { <. <. x , y >. , z >. | ps } )
5	1, 4	ax-mp 5	1 |- { <. <. x , y >. , z >. | ph } = { <. <. x , y >. , z >. | ps }

Syntax hints:   <-> wb 196   = wceq 1483   {coprab 6651

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-oprab 6654

This theorem is referenced by:  oprab4  6726  mpt2v  6750  dfxp3  7230  tposmpt2  7389  addsrpr  9896  mulsrpr  9897  addcnsr  9956  mulcnsr  9957  joinfval2  17002  meetfval2  17016