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

Theorem disj1 3519
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 3517 . 2  |-  ( ( A  i^i  B )  =  (/)  <->  A. x  e.  A  -.  x  e.  B
)
2 df-ral 2491 . 2  |-  ( A. x  e.  A  -.  x  e.  B  <->  A. x
( x  e.  A  ->  -.  x  e.  B
) )
31, 2bitri 184 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 105   A.wal 1371    = wceq 1373    e. wcel 2178   A.wral 2486    i^i cin 3173   (/)c0 3468
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-v 2778  df-dif 3176  df-in 3180  df-nul 3469
This theorem is referenced by:  reldisj  3520  disj3  3521  undif4  3531  disjsn  3705  funun  5334  fzodisj  10337  fzodisjsn  10341
  Copyright terms: Public domain W3C validator