MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cbvrabcsfw Structured version   Visualization version   GIF version

Theorem cbvrabcsfw 3892
Description: Version of cbvrabcsf 3896 with a disjoint variable condition, which does not require ax-13 2404. (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.
StepHypRef Expression
1 nfv 1949 . . . 4 Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝜑)
2 nfcsb1v 3875 . . . . . 6 Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐴
32nfcri 2918 . . . . 5 Ⅎ𝑥 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴
4 nfs1v 2196 . . . . 5 Ⅎ𝑥[𝑧 / 𝑥]𝜑
53, 4nfan 1934 . . . 4 Ⅎ𝑥(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)
6 id 23 . . . . . 6 (𝑥 = 𝑧 → 𝑥 = 𝑧)
7 csbeq1a 3865 . . . . . 6 (𝑥 = 𝑧 → 𝐴 = ⦋𝑧 / 𝑥⦌𝐴)
86, 7eleq12d 2858 . . . . 5 (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴))
9 sbequ12 2290 . . . . 5 (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
108, 9anbi12d 644 . . . 4 (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)))
111, 5, 10cbvabw 2835 . . 3 {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑧 ∣ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)}
12 nfcv 2926 . . . . . . 7 Ⅎ𝑦𝑧
13 cbvrabcsfw.1 . . . . . . 7 Ⅎ𝑦𝐴
1412, 13nfcsbw 3877 . . . . . 6 Ⅎ𝑦⦋𝑧 / 𝑥⦌𝐴
1514nfcri 2918 . . . . 5 Ⅎ𝑦 𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴
16 cbvrabcsfw.3 . . . . . 6 Ⅎ𝑦𝜑
1716nfsbv 2364 . . . . 5 Ⅎ𝑦[𝑧 / 𝑥]𝜑
1815, 17nfan 1934 . . . 4 Ⅎ𝑦(𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)
19 nfv 1949 . . . 4 Ⅎ𝑧(𝑦 ∈ 𝐵 ∧ 𝜓)
20 id 23 . . . . . 6 (𝑧 = 𝑦 → 𝑧 = 𝑦)
21 csbeq1 3854 . . . . . . 7 (𝑧 = 𝑦 → ⦋𝑧 / 𝑥⦌𝐴 = ⦋𝑦 / 𝑥⦌𝐴)
22 vex 3458 . . . . . . . 8 𝑦 ∈ V
23 cbvrabcsfw.2 . . . . . . . 8 Ⅎ𝑥𝐵
24 cbvrabcsfw.5 . . . . . . . 8 (𝑥 = 𝑦 → 𝐴 = 𝐵)
2522, 23, 24csbief 3885 . . . . . . 7 ⦋𝑦 / 𝑥⦌𝐴 = 𝐵
2621, 25eqtrdi 2814 . . . . . 6 (𝑧 = 𝑦 → ⦋𝑧 / 𝑥⦌𝐴 = 𝐵)
2720, 26eleq12d 2858 . . . . 5 (𝑧 = 𝑦 → (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ↔ 𝑦 ∈ 𝐵))
28 cbvrabcsfw.4 . . . . . 6 Ⅎ𝑥𝜓
29 cbvrabcsfw.6 . . . . . 6 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
3028, 29sbhypf 3513 . . . . 5 (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ 𝜓))
3127, 30anbi12d 644 . . . 4 (𝑧 = 𝑦 → ((𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑) ↔ (𝑦 ∈ 𝐵 ∧ 𝜓)))
3218, 19, 31cbvabw 2835 . . 3 {𝑧 ∣ (𝑧 ∈ ⦋𝑧 / 𝑥⦌𝐴 ∧ [𝑧 / 𝑥]𝜑)} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜓)}
3311, 32eqtri 2786 . 2 {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜓)}
34 df-rab 3417 . 2 {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
35 df-rab 3417 . 2 {𝑦 ∈ 𝐵 ∣ 𝜓} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ 𝜓)}
3633, 34, 353eqtr4i 2796 1 {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ 𝜓}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  Ⅎwnf 1816  [wsb 2101   ∈ wcel 2147  {cab 2741  Ⅎwnfc 2911  {crab 3416  ⦋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-ext 2735
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852
This theorem is used by:  smfsup  48097  smfinflem  48100  smfinf  48101
  Copyright terms: Public domain W3C validator