Theorem cleljustALT2 2366

Description: Alternate proof of cleljust 2115. Compared with cleljustALT 2365, it uses nfv 1912 followed by equsexv 2266 instead of ax-5 1908 followed by equsexhv 2291, so it uses the idiom Ⅎ𝑥𝜑 instead of 𝜑 → ∀𝑥𝜑 to express nonfreeness. This style is generally preferred for later theorems. (Contributed by NM, 28-Jan-2004.) (Revised by Mario Carneiro, 21-Dec-2016.) (Revised by BJ, 29-Dec-2020.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
cleljustALT2	⊢ (𝑥 ∈ 𝑦 ↔ ∃𝑧(𝑧 = 𝑥 ∧ 𝑧 ∈ 𝑦))

Distinct variable groups:   𝑥,𝑧   𝑦,𝑧

Proof of Theorem cleljustALT2

Step	Hyp	Ref	Expression
1		nfv 1912	. . 3 ⊢ Ⅎ𝑧 𝑥 ∈ 𝑦
2		elequ1 2113	. . 3 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝑦 ↔ 𝑥 ∈ 𝑦))
3	1, 2	equsexv 2266	. 2 ⊢ (∃𝑧(𝑧 = 𝑥 ∧ 𝑧 ∈ 𝑦) ↔ 𝑥 ∈ 𝑦)
4	3	bicomi 224	1 ⊢ (𝑥 ∈ 𝑦 ↔ ∃𝑧(𝑧 = 𝑥 ∧ 𝑧 ∈ 𝑦))

Syntax hints:   ↔ wb 206   ∧ wa 395  ∃wex 1776

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 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-12 2175

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1777  df-nf 1781

This theorem is referenced by: (None)