Theorem rabxfrd 5383

Description: Membership in a restricted class abstraction after substituting an expression 𝐴 (containing 𝑦) for 𝑥 in the formula defining the class abstraction. (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 418	. . . . . . . . . 10 ⊢ (𝜑 → (𝑦 ∈ 𝐷 → 𝐴 ∈ 𝐷))
3		ibibr 371	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐷 → 𝐴 ∈ 𝐷) ↔ (𝑦 ∈ 𝐷 → (𝐴 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷)))
4	2, 3	sylib 221	. . . . . . . . 9 ⊢ (𝜑 → (𝑦 ∈ 𝐷 → (𝐴 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷)))
5	4	imp 412	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → (𝐴 ∈ 𝐷 ↔ 𝑦 ∈ 𝐷))
6	5	anbi1d 643	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → ((𝐴 ∈ 𝐷 ∧ 𝜒) ↔ (𝑦 ∈ 𝐷 ∧ 𝜒)))
7		rabxfrd.4	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜒))
8	7	elrab 3648	. . . . . . 7 ⊢ (𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ (𝐴 ∈ 𝐷 ∧ 𝜒))
9		rabid 3436	. . . . . . 7 ⊢ (𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒} ↔ (𝑦 ∈ 𝐷 ∧ 𝜒))
10	6, 8, 9	3bitr4g 317	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐷) → (𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ 𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}))
11	10	rabbidva 3422	. . . . 5 ⊢ (𝜑 → {𝑦 ∈ 𝐷 ∣ 𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}} = {𝑦 ∈ 𝐷 ∣ 𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}})
12	11	eleq2d 2850	. . . 4 ⊢ (𝜑 → (𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}} ↔ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}}))
13		rabxfrd.1	. . . . 5 ⊢ Ⅎ𝑦𝐵
14		nfcv 2926	. . . . 5 ⊢ Ⅎ𝑦𝐷
15		rabxfrd.2	. . . . . 6 ⊢ Ⅎ𝑦𝐶
16	15	nfel1 2942	. . . . 5 ⊢ Ⅎ𝑦 𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}
17		rabxfrd.5	. . . . . 6 ⊢ (𝑦 = 𝐵 → 𝐴 = 𝐶)
18	17	eleq1d 2849	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ 𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}))
19	13, 14, 16, 18	elrabf 3645	. . . 4 ⊢ (𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝐴 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}} ↔ (𝐵 ∈ 𝐷 ∧ 𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}))
20		nfrab1 3435	. . . . . 6 ⊢ Ⅎ𝑦{𝑦 ∈ 𝐷 ∣ 𝜒}
21	13, 20	nfel 2940	. . . . 5 ⊢ Ⅎ𝑦 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}
22		eleq1 2852	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒} ↔ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}))
23	13, 14, 21, 22	elrabf 3645	. . . 4 ⊢ (𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝑦 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}} ↔ (𝐵 ∈ 𝐷 ∧ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}))
24	12, 19, 23	3bitr3g 316	. . 3 ⊢ (𝜑 → ((𝐵 ∈ 𝐷 ∧ 𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}) ↔ (𝐵 ∈ 𝐷 ∧ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒})))
25		pm5.32 584	. . 3 ⊢ ((𝐵 ∈ 𝐷 → (𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒})) ↔ ((𝐵 ∈ 𝐷 ∧ 𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓}) ↔ (𝐵 ∈ 𝐷 ∧ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒})))
26	24, 25	sylibr 237	. 2 ⊢ (𝜑 → (𝐵 ∈ 𝐷 → (𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒})))
27	26	imp 412	1 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐷) → (𝐶 ∈ {𝑥 ∈ 𝐷 ∣ 𝜓} ↔ 𝐵 ∈ {𝑦 ∈ 𝐷 ∣ 𝜒}))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Ⅎwnfc 2911  {crab 3416

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-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

This theorem is used by:  rabxfr  5384  riotaxfrd  7434