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

Theorem disj4 4394
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 4389 . 2 ((𝐴𝐵) = ∅ ↔ 𝐴 = (𝐴𝐵))
2 eqcom 2747 . 2 (𝐴 = (𝐴𝐵) ↔ (𝐴𝐵) = 𝐴)
3 difss 4073 . . . 4 (𝐴𝐵) ⊆ 𝐴
4 dfpss2 4026 . . . 4 ((𝐴𝐵) ⊊ 𝐴 ↔ ((𝐴𝐵) ⊆ 𝐴 ∧ ¬ (𝐴𝐵) = 𝐴))
53, 4mpbiran 715 . . 3 ((𝐴𝐵) ⊊ 𝐴 ↔ ¬ (𝐴𝐵) = 𝐴)
65con2bii 358 . 2 ((𝐴𝐵) = 𝐴 ↔ ¬ (𝐴𝐵) ⊊ 𝐴)
71, 2, 63bitri 298 1 ((𝐴𝐵) = ∅ ↔ ¬ (𝐴𝐵) ⊊ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 207   = wceq 1547  cdif 3887  cin 3889  wss 3890  wpss 3891  c0 4268
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712
This theorem depends on definitions:  df-bi 208  df-an 397  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ne 2936  df-ral 3055  df-v 3434  df-dif 3893  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269
This theorem is referenced by:  marypha1lem  9343  infeq5i  9555  wilthlem2  27057  topdifinffinlem  37716
  Copyright terms: Public domain W3C validator