MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  eq0rdvALT Structured version   Visualization version   GIF version

Theorem eq0rdvALT 4400
Description: Alternate proof of eq0rdv 4399. Shorter, but requiring df-clel 2804, ax-8 2100. (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
StepHypRef Expression
1 eq0rdvALT.1 . . . 4 (𝜑 → ¬ 𝑥𝐴)
21pm2.21d 121 . . 3 (𝜑 → (𝑥𝐴𝑥 ∈ ∅))
32ssrdv 3983 . 2 (𝜑𝐴 ⊆ ∅)
4 ss0 4393 . 2 (𝐴 ⊆ ∅ → 𝐴 = ∅)
53, 4syl 17 1 (𝜑𝐴 = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1533  wcel 2098  wss 3943  c0 4317
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2697
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-v 3470  df-dif 3946  df-in 3950  df-ss 3960  df-nul 4318
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator