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

Theorem disj2 3470
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 3169 . 2  |-  A  C_  _V
2 reldisj 3466 . 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 104    = wceq 1348   _Vcvv 2730    \ cdif 3118    i^i cin 3120    C_ wss 3121   (/)c0 3414
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-v 2732  df-dif 3123  df-in 3127  df-ss 3134  df-nul 3415
This theorem is referenced by:  ssindif0im  3474  intirr  4997  setsresg  12454  setscom  12456
  Copyright terms: Public domain W3C validator