Theorem sbabel 2376

Description: Theorem to move a substitution in and out of a class abstraction. (Contributed by NM, 27-Sep-2003.) (Revised by Mario Carneiro, 7-Oct-2016.)

Hypothesis

Ref	Expression
sbabel.1	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
sbabel	⊢ ([𝑦 / 𝑥]{𝑧 ∣ 𝜑} ∈ 𝐴 ↔ {𝑧 ∣ [𝑦 / 𝑥]𝜑} ∈ 𝐴)

Distinct variable groups:   𝑥,𝑧   𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)   𝐴(𝑥,𝑦,𝑧)

Proof of Theorem sbabel

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sbex 2033	. . 3 ⊢ ([𝑦 / 𝑥]∃𝑣(𝑣 = {𝑧 ∣ 𝜑} ∧ 𝑣 ∈ 𝐴) ↔ ∃𝑣[𝑦 / 𝑥](𝑣 = {𝑧 ∣ 𝜑} ∧ 𝑣 ∈ 𝐴))
2		sban 1984	. . . . 5 ⊢ ([𝑦 / 𝑥](𝑣 = {𝑧 ∣ 𝜑} ∧ 𝑣 ∈ 𝐴) ↔ ([𝑦 / 𝑥]𝑣 = {𝑧 ∣ 𝜑} ∧ [𝑦 / 𝑥]𝑣 ∈ 𝐴))
3		nfv 1552	. . . . . . . . . 10 ⊢ Ⅎ𝑥 𝑧 ∈ 𝑣
4	3	sbf 1801	. . . . . . . . 9 ⊢ ([𝑦 / 𝑥]𝑧 ∈ 𝑣 ↔ 𝑧 ∈ 𝑣)
5	4	sbrbis 1990	. . . . . . . 8 ⊢ ([𝑦 / 𝑥](𝑧 ∈ 𝑣 ↔ 𝜑) ↔ (𝑧 ∈ 𝑣 ↔ [𝑦 / 𝑥]𝜑))
6	5	sbalv 2034	. . . . . . 7 ⊢ ([𝑦 / 𝑥]∀𝑧(𝑧 ∈ 𝑣 ↔ 𝜑) ↔ ∀𝑧(𝑧 ∈ 𝑣 ↔ [𝑦 / 𝑥]𝜑))
7		abeq2 2315	. . . . . . . 8 ⊢ (𝑣 = {𝑧 ∣ 𝜑} ↔ ∀𝑧(𝑧 ∈ 𝑣 ↔ 𝜑))
8	7	sbbii 1789	. . . . . . 7 ⊢ ([𝑦 / 𝑥]𝑣 = {𝑧 ∣ 𝜑} ↔ [𝑦 / 𝑥]∀𝑧(𝑧 ∈ 𝑣 ↔ 𝜑))
9		abeq2 2315	. . . . . . 7 ⊢ (𝑣 = {𝑧 ∣ [𝑦 / 𝑥]𝜑} ↔ ∀𝑧(𝑧 ∈ 𝑣 ↔ [𝑦 / 𝑥]𝜑))
10	6, 8, 9	3bitr4i 212	. . . . . 6 ⊢ ([𝑦 / 𝑥]𝑣 = {𝑧 ∣ 𝜑} ↔ 𝑣 = {𝑧 ∣ [𝑦 / 𝑥]𝜑})
11		sbabel.1	. . . . . . . 8 ⊢ Ⅎ𝑥𝐴
12	11	nfcri 2343	. . . . . . 7 ⊢ Ⅎ𝑥 𝑣 ∈ 𝐴
13	12	sbf 1801	. . . . . 6 ⊢ ([𝑦 / 𝑥]𝑣 ∈ 𝐴 ↔ 𝑣 ∈ 𝐴)
14	10, 13	anbi12i 460	. . . . 5 ⊢ (([𝑦 / 𝑥]𝑣 = {𝑧 ∣ 𝜑} ∧ [𝑦 / 𝑥]𝑣 ∈ 𝐴) ↔ (𝑣 = {𝑧 ∣ [𝑦 / 𝑥]𝜑} ∧ 𝑣 ∈ 𝐴))
15	2, 14	bitri 184	. . . 4 ⊢ ([𝑦 / 𝑥](𝑣 = {𝑧 ∣ 𝜑} ∧ 𝑣 ∈ 𝐴) ↔ (𝑣 = {𝑧 ∣ [𝑦 / 𝑥]𝜑} ∧ 𝑣 ∈ 𝐴))
16	15	exbii 1629	. . 3 ⊢ (∃𝑣[𝑦 / 𝑥](𝑣 = {𝑧 ∣ 𝜑} ∧ 𝑣 ∈ 𝐴) ↔ ∃𝑣(𝑣 = {𝑧 ∣ [𝑦 / 𝑥]𝜑} ∧ 𝑣 ∈ 𝐴))
17	1, 16	bitri 184	. 2 ⊢ ([𝑦 / 𝑥]∃𝑣(𝑣 = {𝑧 ∣ 𝜑} ∧ 𝑣 ∈ 𝐴) ↔ ∃𝑣(𝑣 = {𝑧 ∣ [𝑦 / 𝑥]𝜑} ∧ 𝑣 ∈ 𝐴))
18		df-clel 2202	. . 3 ⊢ ({𝑧 ∣ 𝜑} ∈ 𝐴 ↔ ∃𝑣(𝑣 = {𝑧 ∣ 𝜑} ∧ 𝑣 ∈ 𝐴))
19	18	sbbii 1789	. 2 ⊢ ([𝑦 / 𝑥]{𝑧 ∣ 𝜑} ∈ 𝐴 ↔ [𝑦 / 𝑥]∃𝑣(𝑣 = {𝑧 ∣ 𝜑} ∧ 𝑣 ∈ 𝐴))
20		df-clel 2202	. 2 ⊢ ({𝑧 ∣ [𝑦 / 𝑥]𝜑} ∈ 𝐴 ↔ ∃𝑣(𝑣 = {𝑧 ∣ [𝑦 / 𝑥]𝜑} ∧ 𝑣 ∈ 𝐴))
21	17, 19, 20	3bitr4i 212	1 ⊢ ([𝑦 / 𝑥]{𝑧 ∣ 𝜑} ∈ 𝐴 ↔ {𝑧 ∣ [𝑦 / 𝑥]𝜑} ∈ 𝐴)

Syntax hints:   ∧ wa 104   ↔ wb 105  ∀wal 1371   = wceq 1373  ∃wex 1516  [wsb 1786   ∈ wcel 2177  {cab 2192  Ⅎwnfc 2336

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188

This theorem depends on definitions:  df-bi 117  df-nf 1485  df-sb 1787  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338

This theorem is referenced by: (None)