Theorem cbvralcsf 3893

Description: A more general version of cbvralf 3349 that doesn't require 𝐴 and 𝐵 to be distinct from 𝑥 or 𝑦. Changes bound variables using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2404. (Contributed by Andrew Salmon, 13-Jul-2011.) (New usage is discouraged.)

Hypotheses

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

Assertion

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

Proof of Theorem cbvralcsf

Dummy variables 𝑣 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1949	. . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 → 𝜑)
2		nfcsb1v 3875	. . . . . 6 ⊢ Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐴
3	2	nfcri 2918	. . . . 5 ⊢ Ⅎ𝑥 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴
4		nfsbc1v 3762	. . . . 5 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
5	3, 4	nfim 1931	. . . 4 ⊢ Ⅎ𝑥(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 → [𝑧 / 𝑥]𝜑)
6		id 23	. . . . . 6 ⊢ (𝑥 = 𝑧 → 𝑥 = 𝑧)
7		csbeq1a 3865	. . . . . 6 ⊢ (𝑥 = 𝑧 → 𝐴 = ⦋𝑧 / 𝑥⦌𝐴)
8	6, 7	eleq12d 2858	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴))
9		sbceq1a 3753	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
10	8, 9	imbi12d 347	. . . 4 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 → 𝜑) ↔ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 → [𝑧 / 𝑥]𝜑)))
11	1, 5, 10	cbvalv1 2374	. . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 → [𝑧 / 𝑥]𝜑))
12		nfcv 2926	. . . . . . 7 ⊢ Ⅎ𝑦𝑧
13		cbvralcsf.1	. . . . . . 7 ⊢ Ⅎ𝑦𝐴
14	12, 13	nfcsb 3878	. . . . . 6 ⊢ Ⅎ𝑦⦋𝑧 / 𝑥⦌𝐴
15	14	nfcri 2918	. . . . 5 ⊢ Ⅎ𝑦 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴
16		cbvralcsf.3	. . . . . 6 ⊢ Ⅎ𝑦𝜑
17	12, 16	nfsbc 3767	. . . . 5 ⊢ Ⅎ𝑦[𝑧 / 𝑥]𝜑
18	15, 17	nfim 1931	. . . 4 ⊢ Ⅎ𝑦(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 → [𝑧 / 𝑥]𝜑)
19		nfv 1949	. . . 4 ⊢ Ⅎ𝑧(𝑦 ∈ 𝐵 → 𝜓)
20		id 23	. . . . . 6 ⊢ (𝑧 = 𝑦 → 𝑧 = 𝑦)
21		csbeq1 3854	. . . . . . 7 ⊢ (𝑧 = 𝑦 → ⦋𝑧 / 𝑥⦌𝐴 = ⦋𝑦 / 𝑥⦌𝐴)
22		df-csb 3852	. . . . . . . 8 ⊢ ⦋𝑦 / 𝑥⦌𝐴 = {𝑣 ∣ [𝑦 / 𝑥]𝑣 ∈ 𝐴}
23		cbvralcsf.2	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝐵
24	23	nfcri 2918	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑣 ∈ 𝐵
25		cbvralcsf.5	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)
26	25	eleq2d 2850	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (𝑣 ∈ 𝐴 ↔ 𝑣 ∈ 𝐵))
27	24, 26	sbie 2534	. . . . . . . . . 10 ⊢ ([𝑦 / 𝑥]𝑣 ∈ 𝐴 ↔ 𝑣 ∈ 𝐵)
28		sbsbc 3746	. . . . . . . . . 10 ⊢ ([𝑦 / 𝑥]𝑣 ∈ 𝐴 ↔ [𝑦 / 𝑥]𝑣 ∈ 𝐴)
29	27, 28	bitr3i 280	. . . . . . . . 9 ⊢ (𝑣 ∈ 𝐵 ↔ [𝑦 / 𝑥]𝑣 ∈ 𝐴)
30	29	eqabi 2899	. . . . . . . 8 ⊢ 𝐵 = {𝑣 ∣ [𝑦 / 𝑥]𝑣 ∈ 𝐴}
31	22, 30	eqtr4i 2789	. . . . . . 7 ⊢ ⦋𝑦 / 𝑥⦌𝐴 = 𝐵
32	21, 31	eqtrdi 2814	. . . . . 6 ⊢ (𝑧 = 𝑦 → ⦋𝑧 / 𝑥⦌𝐴 = 𝐵)
33	20, 32	eleq12d 2858	. . . . 5 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ↔ 𝑦 ∈ 𝐵))
34		dfsbcq 3744	. . . . . 6 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
35		sbsbc 3746	. . . . . . 7 ⊢ ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)
36		cbvralcsf.4	. . . . . . . 8 ⊢ Ⅎ𝑥𝜓
37		cbvralcsf.6	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
38	36, 37	sbie 2534	. . . . . . 7 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
39	35, 38	bitr3i 280	. . . . . 6 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
40	34, 39	bitrdi 290	. . . . 5 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ 𝜓))
41	33, 40	imbi12d 347	. . . 4 ⊢ (𝑧 = 𝑦 → ((𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 → [𝑧 / 𝑥]𝜑) ↔ (𝑦 ∈ 𝐵 → 𝜓)))
42	18, 19, 41	cbvalv1 2374	. . 3 ⊢ (∀𝑧(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 → [𝑧 / 𝑥]𝜑) ↔ ∀𝑦(𝑦 ∈ 𝐵 → 𝜓))
43	11, 42	bitri 278	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀𝑦(𝑦 ∈ 𝐵 → 𝜓))
44		df-ral 3081	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
45		df-ral 3081	. 2 ⊢ (∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑦(𝑦 ∈ 𝐵 → 𝜓))
46	43, 44, 45	3bitr4i 306	1 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑦 ∈ 𝐵 𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570  Ⅎwnf 1816  [wsb 2101   ∈ wcel 2147  {cab 2741  Ⅎwnfc 2911  ∀wral 3080  [wsbc 3742  ⦋csb 3851

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-13 2404  ax-ext 2735

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-sbc 3743  df-csb 3852

This theorem is used by:  cbvrexcsf  3894  cbvralv2  3897