Theorem cbvsbc 3777

Description: Change bound variables in a wff substitution. Usage of this theorem is discouraged because it depends on ax-13 2403. Use the weaker cbvsbcw 3775 when possible. (Contributed by Jeff Hankins, 19-Sep-2009.) (Proof shortened by Andrew Salmon, 8-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cbvsbc.1	⊢ Ⅎ𝑦𝜑
cbvsbc.2	⊢ Ⅎ𝑥𝜓
cbvsbc.3	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbvsbc	⊢ ([𝐴 / 𝑥]𝜑 ↔ [𝐴 / 𝑦]𝜓)

Proof of Theorem cbvsbc

Step	Hyp	Ref	Expression
1		cbvsbc.1	. . . 4 ⊢ Ⅎ𝑦𝜑
2		cbvsbc.2	. . . 4 ⊢ Ⅎ𝑥𝜓
3		cbvsbc.3	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
4	1, 2, 3	cbvab 2834	. . 3 ⊢ {𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓}
5	4	eleq2i 2854	. 2 ⊢ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝐴 ∈ {𝑦 ∣ 𝜓})
6		df-sbc 3743	. 2 ⊢ ([𝐴 / 𝑥]𝜑 ↔ 𝐴 ∈ {𝑥 ∣ 𝜑})
7		df-sbc 3743	. 2 ⊢ ([𝐴 / 𝑦]𝜓 ↔ 𝐴 ∈ {𝑦 ∣ 𝜓})
8	5, 6, 7	3bitr4i 306	1 ⊢ ([𝐴 / 𝑥]𝜑 ↔ [𝐴 / 𝑦]𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  Ⅎwnf 1816   ∈ wcel 2145  {cab 2740  [wsbc 3742

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-13 2403  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-sbc 3743

This theorem is used by:  cbvsbcv  3778  cbvcsb  3861