Theorem cbvralf 3349

Description: Rule used to change bound variables, using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2404. Use the weaker cbvralfw 3305 when possible. (Contributed by NM, 7-Mar-2004.) (Revised by Mario Carneiro, 9-Oct-2016.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cbvralf.1	⊢ Ⅎ𝑥𝐴
cbvralf.2	⊢ Ⅎ𝑦𝐴
cbvralf.3	⊢ Ⅎ𝑦𝜑
cbvralf.4	⊢ Ⅎ𝑥𝜓
cbvralf.5	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbvralf	⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑦 ∈ 𝐴 𝜓)

Proof of Theorem cbvralf

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1944	. . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 → 𝜑)
2		cbvralf.1	. . . . . 6 ⊢ Ⅎ𝑥𝐴
3	2	nfcri 2917	. . . . 5 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐴
4		nfs1v 2191	. . . . 5 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
5	3, 4	nfim 1926	. . . 4 ⊢ Ⅎ𝑥(𝑧 ∈ 𝐴 → [𝑧 / 𝑥]𝜑)
6		eleq1w 2846	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
7		sbequ12 2287	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
8	6, 7	imbi12d 347	. . . 4 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 → 𝜑) ↔ (𝑧 ∈ 𝐴 → [𝑧 / 𝑥]𝜑)))
9	1, 5, 8	cbvalv1 2373	. . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀𝑧(𝑧 ∈ 𝐴 → [𝑧 / 𝑥]𝜑))
10		cbvralf.2	. . . . . 6 ⊢ Ⅎ𝑦𝐴
11	10	nfcri 2917	. . . . 5 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐴
12		cbvralf.3	. . . . . 6 ⊢ Ⅎ𝑦𝜑
13	12	nfsb 2555	. . . . 5 ⊢ Ⅎ𝑦[𝑧 / 𝑥]𝜑
14	11, 13	nfim 1926	. . . 4 ⊢ Ⅎ𝑦(𝑧 ∈ 𝐴 → [𝑧 / 𝑥]𝜑)
15		nfv 1944	. . . 4 ⊢ Ⅎ𝑧(𝑦 ∈ 𝐴 → 𝜓)
16		eleq1w 2846	. . . . 5 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
17		sbequ 2117	. . . . . 6 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
18		cbvralf.4	. . . . . . 7 ⊢ Ⅎ𝑥𝜓
19		cbvralf.5	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
20	18, 19	sbie 2534	. . . . . 6 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
21	17, 20	bitrdi 290	. . . . 5 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ 𝜓))
22	16, 21	imbi12d 347	. . . 4 ⊢ (𝑧 = 𝑦 → ((𝑧 ∈ 𝐴 → [𝑧 / 𝑥]𝜑) ↔ (𝑦 ∈ 𝐴 → 𝜓)))
23	14, 15, 22	cbvalv1 2373	. . 3 ⊢ (∀𝑧(𝑧 ∈ 𝐴 → [𝑧 / 𝑥]𝜑) ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜓))
24	9, 23	bitri 278	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜓))
25		df-ral 3080	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
26		df-ral 3080	. 2 ⊢ (∀𝑦 ∈ 𝐴 𝜓 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜓))
27	24, 25, 26	3bitr4i 306	1 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑦 ∈ 𝐴 𝜓)

Syntax hints:   → wi 4   ↔ wb 209  ∀wal 1568  Ⅎwnf 1813  [wsb 2096   ∈ wcel 2143  Ⅎwnfc 2910  ∀wral 3079

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-10 2176  ax-11 2192  ax-12 2213  ax-13 2404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-ex 1810  df-nf 1814  df-sb 2097  df-clel 2838  df-nfc 2912  df-ral 3080

This theorem is referenced by:  cbvrexf  3350  cbvral  3351