Theorem rabxfrd 4615

Description: Class builder membership after substituting an expression 𝐴 (containing 𝑦) for 𝑥 in the class expression 𝜒. (Contributed by NM, 16-Jan-2012.)

Hypotheses

Ref	Expression
rabxfrd.1	⊢ Ⅎ𝑦𝐵
rabxfrd.2	⊢ Ⅎ𝑦𝐶
rabxfrd.3	⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → 𝐴 ∈ 𝐷)
rabxfrd.4	⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜒))
rabxfrd.5	⊢ (𝑦 = 𝐵 → 𝐴 = 𝐶)

Assertion

Ref	Expression
rabxfrd	⊢ ((𝜑 ∧ 𝐵 ∈ 𝐷) → (𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}))

Distinct variable groups:   𝑥,𝐴   𝑥,𝑦,𝐷   𝜑,𝑦   𝜓,𝑦   𝜒,𝑥

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

Proof of Theorem rabxfrd

Step	Hyp	Ref	Expression
1		rabxfrd.3	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → 𝐴 ∈ 𝐷)
2	1	ex 115	. . . . . . . . . 10 ⊢ (𝜑 → (𝑦 ∈ 𝐷 → 𝐴 ∈ 𝐷))
3		ibibr 246	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐷 → 𝐴 ∈ 𝐷) ↔ (𝑦 ∈ 𝐷 → (𝐴 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷)))
4	2, 3	sylib 122	. . . . . . . . 9 ⊢ (𝜑 → (𝑦 ∈ 𝐷 → (𝐴 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷)))
5	4	imp 124	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → (𝐴 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷))
6	5	anbi1d 469	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → ((𝐴 ∈ 𝐷 ∧ 𝜒) ↔ (𝑦 ∈ 𝐷 ∧ 𝜒)))
7		rabxfrd.4	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜒))
8	7	elrab 2982	. . . . . . 7 ⊢ (𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ (𝐴 ∈ 𝐷 ∧ 𝜒))
9		rabid 2727	. . . . . . 7 ⊢ (𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒} ↔ (𝑦 ∈ 𝐷 ∧ 𝜒))
10	6, 8, 9	3bitr4g 223	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → (𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ 𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}))
11	10	rabbidva 2809	. . . . 5 ⊢ (𝜑 → {𝑦 ∈ 𝐷 ∣ 𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}} = {𝑦 ∈ 𝐷 ∣ 𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}})
12	11	eleq2d 2308	. . . 4 ⊢ (𝜑 → (𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}} ↔ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}}))
13		rabxfrd.1	. . . . 5 ⊢ Ⅎ𝑦𝐵
14		nfcv 2392	. . . . 5 ⊢ Ⅎ𝑦𝐷
15		rabxfrd.2	. . . . . 6 ⊢ Ⅎ𝑦𝐶
16	15	nfel1 2403	. . . . 5 ⊢ Ⅎ𝑦 𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}
17		rabxfrd.5	. . . . . 6 ⊢ (𝑦 = 𝐵 → 𝐴 = 𝐶)
18	17	eleq1d 2307	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ 𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}))
19	13, 14, 16, 18	elrabf 2980	. . . 4 ⊢ (𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}} ↔ (𝐵 ∈ 𝐷 ∧ 𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}))
20		nfrab1 2732	. . . . . 6 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐷 ∣ 𝜒}
21	13, 20	nfel 2401	. . . . 5 ⊢ Ⅎ𝑦 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}
22		eleq1 2301	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒} ↔ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}))
23	13, 14, 21, 22	elrabf 2980	. . . 4 ⊢ (𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}} ↔ (𝐵 ∈ 𝐷 ∧ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}))
24	12, 19, 23	3bitr3g 222	. . 3 ⊢ (𝜑 → ((𝐵 ∈ 𝐷 ∧ 𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}) ↔ (𝐵 ∈ 𝐷 ∧ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒})))
25		pm5.32 457	. . 3 ⊢ ((𝐵 ∈ 𝐷 → (𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒})) ↔ ((𝐵 ∈ 𝐷 ∧ 𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}) ↔ (𝐵 ∈ 𝐷 ∧ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒})))
26	24, 25	sylibr 134	. 2 ⊢ (𝜑 → (𝐵 ∈ 𝐷 → (𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒})))
27	26	imp 124	1 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐷) → (𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  Ⅎwnfc 2379  {crab 2532

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-ral 2533  df-rab 2537  df-v 2823

This theorem is used by:  rabxfr  4616