Theorem cbvrabcsfw 3888

Description: Version of cbvrabcsf 3892 with a disjoint variable condition, which does not require ax-13 2402. (Contributed by Andrew Salmon, 13-Jul-2011.) (Revised by GG, 26-Jan-2024.)

Hypotheses

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

Assertion

Ref	Expression
cbvrabcsfw	⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ 𝜓}

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦)   𝐴(𝑥, 𝑦)   𝐵(𝑥, 𝑦)

Proof of Theorem cbvrabcsfw

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1947	. . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝜑)
2		nfcsb1v 3871	. . . . . 6 ⊢ Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐴
3	2	nfcri 2915	. . . . 5 ⊢ Ⅎ𝑥 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴
4		nfs1v 2193	. . . . 5 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
5	3, 4	nfan 1932	. . . 4 ⊢ Ⅎ𝑥(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)
6		id 23	. . . . . 6 ⊢ (𝑥 = 𝑧 → 𝑥 = 𝑧)
7		csbeq1a 3861	. . . . . 6 ⊢ (𝑥 = 𝑧 → 𝐴 = ⦋𝑧 / 𝑥⦌𝐴)
8	6, 7	eleq12d 2855	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴))
9		sbequ12 2287	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
10	8, 9	anbi12d 644	. . . 4 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)))
11	1, 5, 10	cbvabw 2832	. . 3 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑧 ∣ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)}
12		nfcv 2923	. . . . . . 7 ⊢ Ⅎ𝑦𝑧
13		cbvrabcsfw.1	. . . . . . 7 ⊢ Ⅎ𝑦𝐴
14	12, 13	nfcsbw 3873	. . . . . 6 ⊢ Ⅎ𝑦⦋𝑧 / 𝑥⦌𝐴
15	14	nfcri 2915	. . . . 5 ⊢ Ⅎ𝑦 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴
16		cbvrabcsfw.3	. . . . . 6 ⊢ Ⅎ𝑦𝜑
17	16	nfsbv 2361	. . . . 5 ⊢ Ⅎ𝑦[𝑧 / 𝑥]𝜑
18	15, 17	nfan 1932	. . . 4 ⊢ Ⅎ𝑦(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)
19		nfv 1947	. . . 4 ⊢ Ⅎ𝑧(𝑦 ∈ 𝐵 ∧ 𝜓)
20		id 23	. . . . . 6 ⊢ (𝑧 = 𝑦 → 𝑧 = 𝑦)
21		csbeq1 3850	. . . . . . 7 ⊢ (𝑧 = 𝑦 → ⦋𝑧 / 𝑥⦌𝐴 = ⦋𝑦 / 𝑥⦌𝐴)
22		vex 3455	. . . . . . . 8 ⊢ 𝑦 ∈ V
23		cbvrabcsfw.2	. . . . . . . 8 ⊢ Ⅎ𝑥𝐵
24		cbvrabcsfw.5	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)
25	22, 23, 24	csbief 3881	. . . . . . 7 ⊢ ⦋𝑦 / 𝑥⦌𝐴 = 𝐵
26	21, 25	eqtrdi 2812	. . . . . 6 ⊢ (𝑧 = 𝑦 → ⦋𝑧 / 𝑥⦌𝐴 = 𝐵)
27	20, 26	eleq12d 2855	. . . . 5 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ↔ 𝑦 ∈ 𝐵))
28		cbvrabcsfw.4	. . . . . 6 ⊢ Ⅎ𝑥𝜓
29		cbvrabcsfw.6	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
30	28, 29	sbhypf 3510	. . . . 5 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ 𝜓))
31	27, 30	anbi12d 644	. . . 4 ⊢ (𝑧 = 𝑦 → ((𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ (𝑦 ∈ 𝐵 ∧ 𝜓)))
32	18, 19, 31	cbvabw 2832	. . 3 ⊢ {𝑧 ∣ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜓)}
33	11, 32	eqtri 2784	. 2 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜓)}
34		df-rab 3414	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
35		df-rab 3414	. 2 ⊢ {𝑦 ∈ 𝐵 ∣ 𝜓} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜓)}
36	33, 34, 35	3eqtr4i 2794	1 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ 𝜓}

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  Ⅎwnf 1816  [wsb 2099   ∈ wcel 2145  {cab 2739  Ⅎwnfc 2908  {crab 3413  ⦋csb 3847

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 2213  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848

This theorem is used by:  smfsup  47823  smfinflem  47826  smfinf  47827