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

Theorem n0el 4319
Description: Negated membership of the empty set in another class. (Contributed by Rodolfo Medina, 25-Sep-2010.)
Assertion
Ref Expression
n0el (¬ ∅ ∈ 𝐴 ↔ ∀𝑥𝐴𝑢 𝑢𝑥)
Distinct variable groups:   𝑥,𝐴   𝑥,𝑢
Allowed substitution hint:   𝐴(𝑢)

Proof of Theorem n0el
StepHypRef Expression
1 df-ral 3082 . 2 (∀𝑥𝐴 ¬ ∀𝑢 ¬ 𝑢𝑥 ↔ ∀𝑥(𝑥𝐴 → ¬ ∀𝑢 ¬ 𝑢𝑥))
2 df-ex 1813 . . 3 (∃𝑢 𝑢𝑥 ↔ ¬ ∀𝑢 ¬ 𝑢𝑥)
32ralbii 3113 . 2 (∀𝑥𝐴𝑢 𝑢𝑥 ↔ ∀𝑥𝐴 ¬ ∀𝑢 ¬ 𝑢𝑥)
4 alnex 1814 . . 3 (∀𝑥 ¬ (𝑥𝐴 ∧ ∀𝑢 ¬ 𝑢𝑥) ↔ ¬ ∃𝑥(𝑥𝐴 ∧ ∀𝑢 ¬ 𝑢𝑥))
5 imnang 1875 . . 3 (∀𝑥(𝑥𝐴 → ¬ ∀𝑢 ¬ 𝑢𝑥) ↔ ∀𝑥 ¬ (𝑥𝐴 ∧ ∀𝑢 ¬ 𝑢𝑥))
6 0el 4318 . . . . 5 (∅ ∈ 𝐴 ↔ ∃𝑥𝐴𝑢 ¬ 𝑢𝑥)
7 df-rex 3092 . . . . 5 (∃𝑥𝐴𝑢 ¬ 𝑢𝑥 ↔ ∃𝑥(𝑥𝐴 ∧ ∀𝑢 ¬ 𝑢𝑥))
86, 7bitri 278 . . . 4 (∅ ∈ 𝐴 ↔ ∃𝑥(𝑥𝐴 ∧ ∀𝑢 ¬ 𝑢𝑥))
98notbii 323 . . 3 (¬ ∅ ∈ 𝐴 ↔ ¬ ∃𝑥(𝑥𝐴 ∧ ∀𝑢 ¬ 𝑢𝑥))
104, 5, 93bitr4ri 307 . 2 (¬ ∅ ∈ 𝐴 ↔ ∀𝑥(𝑥𝐴 → ¬ ∀𝑢 ¬ 𝑢𝑥))
111, 3, 103bitr4ri 307 1 (¬ ∅ ∈ 𝐴 ↔ ∀𝑥𝐴𝑢 𝑢𝑥)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  wal 1568  wex 1812  wcel 2146  wral 3081  wrex 3091  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-ral 3082  df-rex 3092  df-dif 3909  df-nul 4287
This theorem is used by:  n0el2  39042  prter2  39713
  Copyright terms: Public domain W3C validator