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

Theorem disj4 4392
Description: Two ways of saying that two classes are disjoint. (Contributed by NM, 21-Mar-2004.)
Assertion
Ref Expression
disj4 ((𝐴𝐵) = ∅ ↔ ¬ (𝐴𝐵) ⊊ 𝐴)

Proof of Theorem disj4
StepHypRef Expression
1 disj3 4387 . 2 ((𝐴𝐵) = ∅ ↔ 𝐴 = (𝐴𝐵))
2 eqcom 2745 . 2 (𝐴 = (𝐴𝐵) ↔ (𝐴𝐵) = 𝐴)
3 difss 4066 . . . 4 (𝐴𝐵) ⊆ 𝐴
4 dfpss2 4020 . . . 4 ((𝐴𝐵) ⊊ 𝐴 ↔ ((𝐴𝐵) ⊆ 𝐴 ∧ ¬ (𝐴𝐵) = 𝐴))
53, 4mpbiran 706 . . 3 ((𝐴𝐵) ⊊ 𝐴 ↔ ¬ (𝐴𝐵) = 𝐴)
65con2bii 358 . 2 ((𝐴𝐵) = 𝐴 ↔ ¬ (𝐴𝐵) ⊊ 𝐴)
71, 2, 63bitri 297 1 ((𝐴𝐵) = ∅ ↔ ¬ (𝐴𝐵) ⊊ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 205   = wceq 1539  cdif 3884  cin 3886  wss 3887  wpss 3888  c0 4256
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-v 3434  df-dif 3890  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257
This theorem is referenced by:  marypha1lem  9192  infeq5i  9394  wilthlem2  26218  topdifinffinlem  35518
  Copyright terms: Public domain W3C validator