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

Theorem eq0rdvALT 4373
Description: Alternate proof of eq0rdv 4372. Shorter, but requiring df-clel 2840, ax-8 2148. (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 122 . . 3 (𝜑 → (𝑥𝐴𝑥 ∈ ∅))
32ssrdv 3944 . 2 (𝜑𝐴 ⊆ ∅)
4 ss0 4359 . 2 (𝐴 ⊆ ∅ → 𝐴 = ∅)
53, 4syl 18 1 (𝜑𝐴 = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4   = wceq 1570  wcel 2146  wss 3906  c0 4286
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-dif 3909  df-ss 3923  df-nul 4287
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator