Theorem cbvopab1v 2676

Description: Rule used to change the first bound variable in an ordered pair abstraction, using implicit substitution. (The proof was shortened by Eric Schmidt, 4-Apr-2007.)

Hypothesis

Ref	Expression
cbvopab1v.1	|- (x = z -> (ph <-> ps))

Assertion

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

Distinct variable groups:   x,y,z   ph,z   ps,x

Proof of Theorem cbvopab1v

Step	Hyp	Ref	Expression
1		ax-17 971	. 2 |- (ph -> A.zph)
2		ax-17 971	. 2 |- (ps -> A.xps)
3		cbvopab1v.1	. 2 |- (x = z -> (ph <-> ps))
4	1, 2, 3	cbvopab1 2674	1 |- {<.x, y>. | ph} = {<.z, y>. | ps}

Syntax hints:   -> wi 3   <-> wb 146   = wceq 956  {copab 2666

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-v 1812  df-un 2050  df-sn 2412  df-pr 2413  df-op 2416  df-opab 2667

Copyright terms: Public domain