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

Theorem disjr 4403
Description: Two ways of saying that two classes are disjoint. (Contributed by Jeff Madsen, 19-Jun-2011.)
Assertion
Ref Expression
disjr ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥 ∈ 𝐵 ¬ 𝑥 ∈ 𝐴)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem disjr
StepHypRef Expression
1 ineqcom 4107 . 2 ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐵 ∩ 𝐴) = ∅)
2 disj 4402 . 2 ((𝐵 ∩ 𝐴) = ∅ ↔ ∀𝑥 ∈ 𝐵 ¬ 𝑥 ∈ 𝐴)
31, 2bitri 278 1 ((𝐴 ∩ 𝐵) = ∅ ↔ ∀𝑥 ∈ 𝐵 ¬ 𝑥 ∈ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ∀wral 3076   ∩ cin 4089  ∅c0 4278
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-dif 4047  df-in 4091  df-nul 4279
This theorem is used by:  kqdisj  24057  iccntr  25147  numedglnl  29728  fmlasucdisj  36251  ntrneicls11  45184  iooinlbub  46607  stoweidlem57  47161
  Copyright terms: Public domain W3C validator