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

Theorem disj1 4458
Description: Two ways of saying that two classes are disjoint (have no members in common). (Contributed by NM, 19-Aug-1993.)
Assertion
Ref Expression
disj1 ((𝐴𝐵) = ∅ ↔ ∀𝑥(𝑥𝐴 → ¬ 𝑥𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem disj1
StepHypRef Expression
1 disj 4456 . 2 ((𝐴𝐵) = ∅ ↔ ∀𝑥𝐴 ¬ 𝑥𝐵)
2 df-ral 3060 . 2 (∀𝑥𝐴 ¬ 𝑥𝐵 ↔ ∀𝑥(𝑥𝐴 → ¬ 𝑥𝐵))
31, 2bitri 275 1 ((𝐴𝐵) = ∅ ↔ ∀𝑥(𝑥𝐴 → ¬ 𝑥𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wal 1535   = wceq 1537  wcel 2106  wral 3059  cin 3962  c0 4339
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-dif 3966  df-in 3970  df-nul 4340
This theorem is referenced by:  reldisj  4459  disj3  4460  undif4  4473  disjsn  4716  funun  6614  zfregs2  9771  dfac5lem4  10164  dfac5lem4OLD  10166  isf32lem9  10399  fzodisj  13730  fzodisjsn  13734  inpr0  32558  bnj1280  35013  ecin0  38334  zfregs2VD  44839
  Copyright terms: Public domain W3C validator