Theorem cbvab 2832

Description: Rule used to change bound variables, using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2401. Usage of the weaker cbvabw 2831 and cbvabv 2830 are preferred. (Contributed by Andrew Salmon, 11-Jul-2011.) (Proof shortened by Wolf Lammen, 16-Nov-2019.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
cbvab	⊢ {𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓}

Proof of Theorem cbvab

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbvab.1	. . . . 5 ⊢ Ⅎ𝑦𝜑
2	1	sbco2 2540	. . . 4 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑)
3		cbvab.2	. . . . . 6 ⊢ Ⅎ𝑥𝜓
4		cbvab.3	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
5	3, 4	sbie 2531	. . . . 5 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
6	5	sbbii 2112	. . . 4 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑦]𝜓)
7	2, 6	bitr3i 280	. . 3 ⊢ ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑦]𝜓)
8		df-clab 2739	. . 3 ⊢ (𝑧 ∈ {𝑥 ∣ 𝜑} ↔ [𝑧 / 𝑥]𝜑)
9		df-clab 2739	. . 3 ⊢ (𝑧 ∈ {𝑦 ∣ 𝜓} ↔ [𝑧 / 𝑦]𝜓)
10	7, 8, 9	3bitr4i 306	. 2 ⊢ (𝑧 ∈ {𝑥 ∣ 𝜑} ↔ 𝑧 ∈ {𝑦 ∣ 𝜓})
11	10	eqriv 2757	1 ⊢ {𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓}

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569  Ⅎwnf 1815  [wsb 2098   ∈ wcel 2144  {cab 2738

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-13 2401  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752

This theorem is used by:  cbvrab  3449  cdeqab1  3729  cbvsbc  3773  cbvrabcsf  3891