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

Theorem disjeq1 3989
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 3212 . . 3  |-  ( A  =  B  ->  B  C_  A )
2 disjss1 3988 . . 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 3211 . . 3  |-  ( A  =  B  ->  A  C_  B )
5 disjss1 3988 . . 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 129 1  |-  ( A  =  B  ->  (Disj  x  e.  A  C  <-> Disj  x  e.  B  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1353    C_ wss 3131  Disj wdisj 3982
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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-rmo 2463  df-in 3137  df-ss 3144  df-disj 3983
This theorem is referenced by:  disjeq1d  3990
  Copyright terms: Public domain W3C validator