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

Theorem eq0rdvALT 4336
Description: Alternate proof of eq0rdv 4335. Shorter, but requiring df-clel 2817, ax-8 2110. (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 3923 . 2 (𝜑𝐴 ⊆ ∅)
4 ss0 4329 . 2 (𝐴 ⊆ ∅ → 𝐴 = ∅)
53, 4syl 17 1 (𝜑𝐴 = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1539  wcel 2108  wss 3883  c0 4253
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-v 3424  df-dif 3886  df-in 3890  df-ss 3900  df-nul 4254
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator