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

Theorem disjeq1 3908
Description: Equality theorem for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
Assertion
Ref Expression
disjeq1  |-  ( A  =  B  ->  (Disj  x  e.  A  C  <-> Disj  x  e.  B  C ) )
Distinct variable groups:    x, A    x, B
Allowed substitution hint:    C( x)

Proof of Theorem disjeq1
StepHypRef Expression
1 eqimss2 3147 . . 3  |-  ( A  =  B  ->  B  C_  A )
2 disjss1 3907 . . 3  |-  ( B 
C_  A  ->  (Disj  x  e.  A  C  -> Disj  x  e.  B  C ) )
31, 2syl 14 . 2  |-  ( A  =  B  ->  (Disj  x  e.  A  C  -> Disj  x  e.  B  C ) )
4 eqimss 3146 . . 3  |-  ( A  =  B  ->  A  C_  B )
5 disjss1 3907 . . 3  |-  ( A 
C_  B  ->  (Disj  x  e.  B  C  -> Disj  x  e.  A  C ) )
64, 5syl 14 . 2  |-  ( A  =  B  ->  (Disj  x  e.  B  C  -> Disj  x  e.  A  C ) )
73, 6impbid 128 1  |-  ( A  =  B  ->  (Disj  x  e.  A  C  <-> Disj  x  e.  B  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1331    C_ wss 3066  Disj wdisj 3901
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-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-rmo 2422  df-in 3072  df-ss 3079  df-disj 3902
This theorem is referenced by:  disjeq1d  3909
  Copyright terms: Public domain W3C validator