Theorem elabf 2737

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 2219	. . 3 ⊢ Ⅎ𝑥𝐴
3		elabf.1	. . 3 ⊢ Ⅎ𝑥𝜓
4		elabf.3	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
5	2, 3, 4	elabgf 2736	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓))
6	1, 5	ax-mp 7	1 ⊢ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)

Syntax hints:   → wi 4   ↔ wb 103   = wceq 1284  Ⅎwnf 1389   ∈ wcel 1433  {cab 2067  Vcvv 2601

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603

This theorem is referenced by:  elab  2738  indpi  6532