Theorem eq0rdvALT 4358

Description: Alternate proof of eq0rdv 4357. Shorter, but requiring df-clel 2809, ax-8 2115. (Contributed by NM, 11-Jul-2014.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypothesis

Ref	Expression
eq0rdvALT.1	⊢ (𝜑 → ¬ 𝑥 ∈ 𝐴)

Assertion

Ref	Expression
eq0rdvALT	⊢ (𝜑 → 𝐴 = ∅)

Distinct variable groups:   𝑥,𝐴   𝜑,𝑥

Proof of Theorem eq0rdvALT

Step	Hyp	Ref	Expression
1		eq0rdvALT.1	. . . 4 ⊢ (𝜑 → ¬ 𝑥 ∈ 𝐴)
2	1	pm2.21d 121	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝑥 ∈ ∅))
3	2	ssrdv 3937	. 2 ⊢ (𝜑 → 𝐴 ⊆ ∅)
4		ss0 4352	. 2 ⊢ (𝐴 ⊆ ∅ → 𝐴 = ∅)
5	3, 4	syl 17	1 ⊢ (𝜑 → 𝐴 = ∅)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1541   ∈ wcel 2113   ⊆ wss 3899  ∅c0 4283

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-dif 3902  df-ss 3916  df-nul 4284

This theorem is referenced by: (None)