Theorem cleljustab 2751

Description: Extension of cleljust 2159 from formulas of the form "setvar ∈ setvar" to formulas of the form "setvar ∈ class abstraction". This is an instance of dfclel 2846 where the containing class is a class abstraction. The same remarks as for eleq1ab 2750 apply. (Contributed by BJ, 8-Nov-2021.) (Proof shortened by Steven Nguyen, 19-May-2023.)

Assertion

Ref	Expression
cleljustab	⊢ (𝑥 ∈ {𝑦 ∣ 𝜑} ↔ ∃𝑧(𝑧 = 𝑥 ∧ 𝑧 ∈ {𝑦 ∣ 𝜑}))

Distinct variable groups:   𝑥,𝑧   𝑦,𝑧   𝜑,𝑧

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem cleljustab

Step	Hyp	Ref	Expression
1		eleq1ab 2750	. . 3 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ {𝑦 ∣ 𝜑} ↔ 𝑥 ∈ {𝑦 ∣ 𝜑}))
2	1	equsexvw 2033	. 2 ⊢ (∃𝑧(𝑧 = 𝑥 ∧ 𝑧 ∈ {𝑦 ∣ 𝜑}) ↔ 𝑥 ∈ {𝑦 ∣ 𝜑})
3	2	bicomi 227	1 ⊢ (𝑥 ∈ {𝑦 ∣ 𝜑} ↔ ∃𝑧(𝑧 = 𝑥 ∧ 𝑧 ∈ {𝑦 ∣ 𝜑}))

Syntax hints:   ↔ wb 209   ∧ wa 400  ∃wex 1807   ∈ wcel 2150  {cab 2748

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1808  df-sb 2099  df-clab 2749

This theorem is referenced by: (None)