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

Theorem disj2 3502
Description: Two ways of saying that two classes are disjoint. (Contributed by NM, 17-May-1998.)
Assertion
Ref Expression
disj2  |-  ( ( A  i^i  B )  =  (/)  <->  A  C_  ( _V 
\  B ) )

Proof of Theorem disj2
StepHypRef Expression
1 ssv 3201 . 2  |-  A  C_  _V
2 reldisj 3498 . 2  |-  ( A 
C_  _V  ->  ( ( A  i^i  B )  =  (/)  <->  A  C_  ( _V 
\  B ) ) )
31, 2ax-mp 5 1  |-  ( ( A  i^i  B )  =  (/)  <->  A  C_  ( _V 
\  B ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    = wceq 1364   _Vcvv 2760    \ cdif 3150    i^i cin 3152    C_ wss 3153   (/)c0 3446
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-v 2762  df-dif 3155  df-in 3159  df-ss 3166  df-nul 3447
This theorem is referenced by:  ssindif0im  3506  intirr  5052  setsresg  12656  setscom  12658
  Copyright terms: Public domain W3C validator