Theorem cbviinv 4007

Description: Change bound variables in an indexed intersection. (Contributed by Jeff Hankins, 26-Aug-2009.)

Hypothesis

Ref	Expression
cbviunv.1	|- (x = y -> B = C)

Assertion

Ref	Expression
cbviinv	|- |^|_x e. A B = |^|_y e. A C

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

Allowed substitution hints:   B(x)   C(y)

Proof of Theorem cbviinv

Step	Hyp	Ref	Expression
1		nfcv 2490	. 2 |- F/_yB
2		nfcv 2490	. 2 |- F/_xC
3		cbviunv.1	. 2 |- (x = y -> B = C)
4	1, 2, 3	cbviin 4005	1 |- |^|_x e. A B = |^|_y e. A C

Syntax hints:   -> wi 4   = wceq 1642  |^|_ciin 3971

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ral 2620  df-iin 3973

This theorem is referenced by: (None)