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

Theorem dfss6 3906
Description: Alternate definition of subclass relationship. (Contributed by RP, 16-Apr-2020.)
Assertion
Ref Expression
dfss6 (𝐴𝐵 ↔ ¬ ∃𝑥(𝑥𝐴 ∧ ¬ 𝑥𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem dfss6
StepHypRef Expression
1 dfss2 3903 . . 3 (𝐴𝐵 ↔ ∀𝑥(𝑥𝐴𝑥𝐵))
2 notnotb 314 . . 3 (∀𝑥(𝑥𝐴𝑥𝐵) ↔ ¬ ¬ ∀𝑥(𝑥𝐴𝑥𝐵))
31, 2bitri 274 . 2 (𝐴𝐵 ↔ ¬ ¬ ∀𝑥(𝑥𝐴𝑥𝐵))
4 exanali 1863 . 2 (∃𝑥(𝑥𝐴 ∧ ¬ 𝑥𝐵) ↔ ¬ ∀𝑥(𝑥𝐴𝑥𝐵))
53, 4xchbinxr 334 1 (𝐴𝐵 ↔ ¬ ∃𝑥(𝑥𝐴 ∧ ¬ 𝑥𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395  wal 1537  wex 1783  wcel 2108  wss 3883
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1542  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-v 3424  df-in 3890  df-ss 3900
This theorem is referenced by:  dfssr2  36544
  Copyright terms: Public domain W3C validator