ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cbvrabcsf GIF version

Theorem cbvrabcsf 3213
Description: A more general version of cbvrab 2819 with no distinct variable restrictions. (Contributed by Andrew Salmon, 13-Jul-2011.)
Hypotheses
Ref Expression
cbvralcsf.1 Ⅎ𝑦𝐴
cbvralcsf.2 Ⅎ𝑥𝐵
cbvralcsf.3 Ⅎ𝑦𝜑
cbvralcsf.4 Ⅎ𝑥𝜓
cbvralcsf.5 (𝑥 = 𝑦 → 𝐴 = 𝐵)
cbvralcsf.6 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
cbvrabcsf {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ 𝜓}

Proof of Theorem cbvrabcsf
Dummy variables 𝑣 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfv 1581 . . . 4 Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝜑)
2 nfcsb1v 3180 . . . . . 6 Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐴
32nfcri 2386 . . . . 5 Ⅎ𝑥 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴
4 nfs1v 1999 . . . . 5 Ⅎ𝑥[𝑧 / 𝑥]𝜑
53, 4nfan 1618 . . . 4 Ⅎ𝑥(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)
6 id 19 . . . . . 6 (𝑥 = 𝑧 → 𝑥 = 𝑧)
7 csbeq1a 3156 . . . . . 6 (𝑥 = 𝑧 → 𝐴 = ⦋𝑧 / 𝑥⦌𝐴)
86, 7eleq12d 2309 . . . . 5 (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴))
9 sbequ12 1824 . . . . 5 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
108, 9anbi12d 477 . . . 4 (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)))
111, 5, 10cbvab 2364 . . 3 {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑧 ∣ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)}
12 nfcv 2392 . . . . . . 7 Ⅎ𝑦𝑧
13 cbvralcsf.1 . . . . . . 7 Ⅎ𝑦𝐴
1412, 13nfcsb 3185 . . . . . 6 Ⅎ𝑦⦋𝑧 / 𝑥⦌𝐴
1514nfcri 2386 . . . . 5 Ⅎ𝑦 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴
16 cbvralcsf.3 . . . . . 6 Ⅎ𝑦𝜑
1716nfsb 2006 . . . . 5 Ⅎ𝑦[𝑧 / 𝑥]𝜑
1815, 17nfan 1618 . . . 4 Ⅎ𝑦(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)
19 nfv 1581 . . . 4 Ⅎ𝑧(𝑦 ∈ 𝐵 ∧ 𝜓)
20 id 19 . . . . . 6 (𝑧 = 𝑦 → 𝑧 = 𝑦)
21 csbeq1 3150 . . . . . . 7 (𝑧 = 𝑦 → ⦋𝑧 / 𝑥⦌𝐴 = ⦋𝑦 / 𝑥⦌𝐴)
22 df-csb 3148 . . . . . . . 8 ⦋𝑦 / 𝑥⦌𝐴 = {𝑣 ∣ [𝑦 / 𝑥]𝑣 ∈ 𝐴}
23 cbvralcsf.2 . . . . . . . . . . . 12 Ⅎ𝑥𝐵
2423nfcri 2386 . . . . . . . . . . 11 Ⅎ𝑥 𝑣 ∈ 𝐵
25 cbvralcsf.5 . . . . . . . . . . . 12 (𝑥 = 𝑦 → 𝐴 = 𝐵)
2625eleq2d 2308 . . . . . . . . . . 11 (𝑥 = 𝑦 → (𝑣 ∈ 𝐴 ↔ 𝑣 ∈ 𝐵))
2724, 26sbie 1844 . . . . . . . . . 10 ([𝑦 / 𝑥]𝑣 ∈ 𝐴 ↔ 𝑣 ∈ 𝐵)
28 sbsbc 3055 . . . . . . . . . 10 ([𝑦 / 𝑥]𝑣 ∈ 𝐴 ↔ [𝑦 / 𝑥]𝑣 ∈ 𝐴)
2927, 28bitr3i 186 . . . . . . . . 9 (𝑣 ∈ 𝐵 ↔ [𝑦 / 𝑥]𝑣 ∈ 𝐴)
3029abbi2i 2353 . . . . . . . 8 𝐵 = {𝑣 ∣ [𝑦 / 𝑥]𝑣 ∈ 𝐴}
3122, 30eqtr4i 2262 . . . . . . 7 ⦋𝑦 / 𝑥⦌𝐴 = 𝐵
3221, 31eqtrdi 2287 . . . . . 6 (𝑧 = 𝑦 → ⦋𝑧 / 𝑥⦌𝐴 = 𝐵)
3320, 32eleq12d 2309 . . . . 5 (𝑧 = 𝑦 → (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ↔ 𝑦 ∈ 𝐵))
34 sbequ 1893 . . . . . 6 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
35 cbvralcsf.4 . . . . . . 7 Ⅎ𝑥𝜓
36 cbvralcsf.6 . . . . . . 7 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
3735, 36sbie 1844 . . . . . 6 ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
3834, 37bitrdi 196 . . . . 5 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ 𝜓))
3933, 38anbi12d 477 . . . 4 (𝑧 = 𝑦 → ((𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ (𝑦 ∈ 𝐵 ∧ 𝜓)))
4018, 19, 39cbvab 2364 . . 3 {𝑧 ∣ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜓)}
4111, 40eqtri 2259 . 2 {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜓)}
42 df-rab 2537 . 2 {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
43 df-rab 2537 . 2 {𝑦 ∈ 𝐵 ∣ 𝜓} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜓)}
4441, 42, 433eqtr4i 2269 1 {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ 𝜓}
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402  Ⅎwnf 1513  [wsb 1815   ∈ wcel 2209  {cab 2224  Ⅎwnfc 2379  {crab 2532  [wsbc 3051  ⦋csb 3147
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rab 2537  df-sbc 3052  df-csb 3148
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator