Theorem elabgt 3663

Description: Membership in a class abstraction, using implicit substitution. (Closed theorem version of elabg 3666.) (Contributed by NM, 7-Nov-2005.) (Proof shortened by Andrew Salmon, 8-Jun-2011.)

Assertion

Ref	Expression
elabgt	⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓))) → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓))

Distinct variable groups:   𝑥,𝐴   𝜓,𝑥

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

Proof of Theorem elabgt

Step	Hyp	Ref	Expression
1		nfcv 2977	. . 3 ⊢ Ⅎ𝑥𝐴
2		nfab1 2979	. . . . 5 ⊢ Ⅎ𝑥{𝑥 ∣ 𝜑}
3	2	nfel2 2996	. . . 4 ⊢ Ⅎ𝑥 𝐴 ∈ {𝑥 ∣ 𝜑}
4		nfv 1911	. . . 4 ⊢ Ⅎ𝑥𝜓
5	3, 4	nfbi 1900	. . 3 ⊢ Ⅎ𝑥(𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)
6		pm5.5 364	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 = 𝐴 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)) ↔ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)))
7	1, 5, 6	spcgf 3590	. 2 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥(𝑥 = 𝐴 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)) → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)))
8		abid 2803	. . . . . . 7 ⊢ (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑)
9		eleq1 2900	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝐴 ∈ {𝑥 ∣ 𝜑}))
10	8, 9	syl5bbr 287	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝐴 ∈ {𝑥 ∣ 𝜑}))
11	10	bibi1d 346	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝜑 ↔ 𝜓) ↔ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)))
12	11	biimpd 231	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝜑 ↔ 𝜓) → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)))
13	12	a2i 14	. . 3 ⊢ ((𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) → (𝑥 = 𝐴 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)))
14	13	alimi 1808	. 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) → ∀𝑥(𝑥 = 𝐴 → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓)))
15	7, 14	impel 508	1 ⊢ ((𝐴 ∈ 𝐵 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓))) → (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ 𝜓))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398  ∀wal 1531   = wceq 1533   ∈ wcel 2110  {cab 2799

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-v 3497

This theorem is referenced by:  elrab3t  3679  dfrtrcl2  14415  abfmpeld  30393  abfmpel  30394  dftrcl3  40058  dfrtrcl3  40071