Theorem elabf 3668

Description: Membership in a class abstraction, using implicit substitution. (Contributed by NM, 1-Aug-1994.) (Revised by Mario Carneiro, 12-Oct-2016.)

Hypotheses

Ref	Expression
elabf.1	⊢ Ⅎ𝑥𝜓
elabf.2	⊢ 𝐴 ∈ V
elabf.3	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
elabf	⊢ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem elabf

Step	Hyp	Ref	Expression
1		elabf.2	. 2 ⊢ 𝐴 ∈ V
2		nfcv 2980	. . 3 ⊢ Ⅎ𝑥𝐴
3		elabf.1	. . 3 ⊢ Ⅎ𝑥𝜓
4		elabf.3	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
5	2, 3, 4	elabgf 3667	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓))
6	1, 5	ax-mp 5	1 ⊢ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)

Syntax hints:   → wi 4   ↔ wb 208   = wceq 1536  Ⅎwnf 1783   ∈ wcel 2113  {cab 2802  Vcvv 3497

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-v 3499

This theorem is referenced by:  elab  3670  dfon2lem1  33032  sdclem2  35021  sdclem1  35022  scottabf  40582