Theorem elabgf 3500

Description: Membership in a class abstraction, using implicit substitution. Compare Theorem 6.13 of [Quine] p. 44. This version has bound-variable hypotheses in place of distinct variable restrictions. (Contributed by NM, 21-Sep-2003.) (Revised by Mario Carneiro, 12-Oct-2016.)

Hypotheses

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

Assertion

Ref	Expression
elabgf	⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓))

Proof of Theorem elabgf

Step	Hyp	Ref	Expression
1		elabgf.1	. 2 ⊢ Ⅎ𝑥𝐴
2		nfab1 2915	. . . 4 ⊢ Ⅎ𝑥{𝑥 ∣ 𝜑}
3	1, 2	nfel 2926	. . 3 ⊢ Ⅎ𝑥 𝐴 ∈ {𝑥 ∣ 𝜑}
4		elabgf.2	. . 3 ⊢ Ⅎ𝑥𝜓
5	3, 4	nfbi 1985	. 2 ⊢ Ⅎ𝑥(𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)
6		eleq1 2838	. . 3 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝐴 ∈ {𝑥 ∣ 𝜑}))
7		elabgf.3	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
8	6, 7	bibi12d 334	. 2 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑) ↔ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)))
9		abid 2759	. 2 ⊢ (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑)
10	1, 5, 8, 9	vtoclgf 3416	1 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓))

Syntax hints:   → wi 4   ↔ wb 196   = wceq 1631  Ⅎwnf 1856   ∈ wcel 2145  {cab 2757  Ⅎwnfc 2900

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751

This theorem depends on definitions:  df-bi 197  df-an 383  df-or 829  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-v 3353

This theorem is referenced by:  elabf  3501  elabg  3503  elab3gf  3508  elrabf  3512