Theorem elrabf 2884

Description: Membership in a restricted class abstraction, using implicit substitution. This version has bound-variable hypotheses in place of distinct variable restrictions. (Contributed by NM, 21-Sep-2003.)

Hypotheses

Ref	Expression
elrabf.1	⊢ Ⅎ𝑥𝐴
elrabf.2	⊢ Ⅎ𝑥𝐵
elrabf.3	⊢ Ⅎ𝑥𝜓
elrabf.4	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
elrabf	⊢ (𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ (𝐴 ∈ 𝐵 ∧ 𝜓))

Proof of Theorem elrabf

Step	Hyp	Ref	Expression
1		elex 2741	. 2 ⊢ (𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝜑} → 𝐴 ∈ V)
2		elex 2741	. . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V)
3	2	adantr 274	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → 𝐴 ∈ V)
4		df-rab 2457	. . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}
5	4	eleq2i 2237	. . 3 ⊢ (𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ 𝐴 ∈ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)})
6		elrabf.1	. . . 4 ⊢ Ⅎ𝑥𝐴
7		elrabf.2	. . . . . 6 ⊢ Ⅎ𝑥𝐵
8	6, 7	nfel 2321	. . . . 5 ⊢ Ⅎ𝑥 𝐴 ∈ 𝐵
9		elrabf.3	. . . . 5 ⊢ Ⅎ𝑥𝜓
10	8, 9	nfan 1558	. . . 4 ⊢ Ⅎ𝑥(𝐴 ∈ 𝐵 ∧ 𝜓)
11		eleq1 2233	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
12		elrabf.4	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
13	11, 12	anbi12d 470	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝐵 ∧ 𝜑) ↔ (𝐴 ∈ 𝐵 ∧ 𝜓)))
14	6, 10, 13	elabgf 2872	. . 3 ⊢ (𝐴 ∈ V → (𝐴 ∈ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ (𝐴 ∈ 𝐵 ∧ 𝜓)))
15	5, 14	syl5bb 191	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ (𝐴 ∈ 𝐵 ∧ 𝜓)))
16	1, 3, 15	pm5.21nii 699	1 ⊢ (𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ (𝐴 ∈ 𝐵 ∧ 𝜓))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1348  Ⅎwnf 1453   ∈ wcel 2141  {cab 2156  Ⅎwnfc 2299  {crab 2452  Vcvv 2730

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-rab 2457  df-v 2732

This theorem is referenced by:  elrab  2886  frind  4337  rabxfrd  4454  infssuzcldc  11906  nnwosdc  11994