Theorem oprabbii 5560

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 2040	. 2 |- w = w
2		oprabbii.1	. . . 4 |- ( ph <-> ps )
3	2	a1i 9	. . 3 |- ( w = w -> ( ph <-> ps ) )
4	3	oprabbidv 5559	. 2 |- ( w = w -> { <. <. x , y >. , z >. | ph } = { <. <. x , y >. , z >. | ps } )
5	1, 4	ax-mp 7	1 |- { <. <. x , y >. , z >. | ph } = { <. <. x , y >. , z >. | ps }

Syntax hints:   <-> wb 98   = wceq 1243   {coprab 5513

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-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-11 1397  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-oprab 5516

This theorem is referenced by:  oprab4  5575  mpt2v  5594  dfxp3  5820  tposmpt2  5896  oviec  6212  dfplpq2  6452  dfmpq2  6453  dfmq0qs  6527  dfplq0qs  6528  addsrpr  6830  mulsrpr  6831  addcnsr  6910  mulcnsr  6911  addvalex  6920