ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  disj1 Unicode version

Theorem disj1 3459
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  |-  ( ( A  i^i  B )  =  (/)  <->  A. x ( x  e.  A  ->  -.  x  e.  B )
)
Distinct variable groups:    x, A    x, B

Proof of Theorem disj1
StepHypRef Expression
1 disj 3457 . 2  |-  ( ( A  i^i  B )  =  (/)  <->  A. x  e.  A  -.  x  e.  B
)
2 df-ral 2449 . 2  |-  ( A. x  e.  A  -.  x  e.  B  <->  A. x
( x  e.  A  ->  -.  x  e.  B
) )
31, 2bitri 183 1  |-  ( ( A  i^i  B )  =  (/)  <->  A. x ( x  e.  A  ->  -.  x  e.  B )
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 104   A.wal 1341    = wceq 1343    e. wcel 2136   A.wral 2444    i^i cin 3115   (/)c0 3409
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-v 2728  df-dif 3118  df-in 3122  df-nul 3410
This theorem is referenced by:  reldisj  3460  disj3  3461  undif4  3471  disjsn  3638  funun  5232  fzodisj  10113
  Copyright terms: Public domain W3C validator