Theorem elrabf 2833

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 2692	. 2 ⊢ (𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝜑} → 𝐴 ∈ V)
2		elex 2692	. . 3 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V)
3	2	adantr 274	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → 𝐴 ∈ V)
4		df-rab 2423	. . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}
5	4	eleq2i 2204	. . 3 ⊢ (𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ 𝐴 ∈ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)})
6		elrabf.1	. . . 4 ⊢ Ⅎ𝑥𝐴
7		elrabf.2	. . . . . 6 ⊢ Ⅎ𝑥𝐵
8	6, 7	nfel 2288	. . . . 5 ⊢ Ⅎ𝑥 𝐴 ∈ 𝐵
9		elrabf.3	. . . . 5 ⊢ Ⅎ𝑥𝜓
10	8, 9	nfan 1544	. . . 4 ⊢ Ⅎ𝑥(𝐴 ∈ 𝐵 ∧ 𝜓)
11		eleq1 2200	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
12		elrabf.4	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
13	11, 12	anbi12d 464	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝐵 ∧ 𝜑) ↔ (𝐴 ∈ 𝐵 ∧ 𝜓)))
14	6, 10, 13	elabgf 2821	. . 3 ⊢ (𝐴 ∈ V → (𝐴 ∈ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ (𝐴 ∈ 𝐵 ∧ 𝜓)))
15	5, 14	syl5bb 191	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ (𝐴 ∈ 𝐵 ∧ 𝜓)))
16	1, 3, 15	pm5.21nii 693	1 ⊢ (𝐴 ∈ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ (𝐴 ∈ 𝐵 ∧ 𝜓))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1331  Ⅎwnf 1436   ∈ wcel 1480  {cab 2123  Ⅎwnfc 2266  {crab 2418  Vcvv 2681

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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-rab 2423  df-v 2683

This theorem is referenced by:  elrab  2835  frind  4269  rabxfrd  4385  infssuzcldc  11633