Theorem cbviotav 6451

Description: Change bound variables in a description binder. Usage of this theorem is discouraged because it depends on ax-13 2380. Use the weaker cbviotavw 6449 when possible. (Contributed by Andrew Salmon, 1-Aug-2011.) (New usage is discouraged.)

Hypothesis

Ref	Expression
cbviotav.1	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbviotav	⊢ (℩𝑥𝜑) = (℩𝑦𝜓)

Distinct variable groups:   𝜑,𝑦   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)

Proof of Theorem cbviotav

Step	Hyp	Ref	Expression
1		cbviotav.1	. 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
2		nfv 1921	. 2 ⊢ Ⅎ𝑦𝜑
3		nfv 1921	. 2 ⊢ Ⅎ𝑥𝜓
4	1, 2, 3	cbviota 6450	1 ⊢ (℩𝑥𝜑) = (℩𝑦𝜓)

Syntax hints:   → wi 4   ↔ wb 207   = wceq 1547  ℩cio 6439

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-13 2380  ax-ext 2711

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-v 3433  df-ss 3900  df-sn 4556  df-uni 4839  df-iota 6441

This theorem is referenced by: (None)