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

Theorem disjeq2 3749
Description: Equality theorem for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
Assertion
Ref Expression
disjeq2  |-  ( A. x  e.  A  B  =  C  ->  (Disj  x  e.  A  B  <-> Disj  x  e.  A  C ) )

Proof of Theorem disjeq2
StepHypRef Expression
1 eqimss2 2998 . . . 4  |-  ( B  =  C  ->  C  C_  B )
21ralimi 2384 . . 3  |-  ( A. x  e.  A  B  =  C  ->  A. x  e.  A  C  C_  B
)
3 disjss2 3748 . . 3  |-  ( A. x  e.  A  C  C_  B  ->  (Disj  x  e.  A  B  -> Disj  x  e.  A  C ) )
42, 3syl 14 . 2  |-  ( A. x  e.  A  B  =  C  ->  (Disj  x  e.  A  B  -> Disj  x  e.  A  C )
)
5 eqimss 2997 . . . 4  |-  ( B  =  C  ->  B  C_  C )
65ralimi 2384 . . 3  |-  ( A. x  e.  A  B  =  C  ->  A. x  e.  A  B  C_  C
)
7 disjss2 3748 . . 3  |-  ( A. x  e.  A  B  C_  C  ->  (Disj  x  e.  A  C  -> Disj  x  e.  A  B ) )
86, 7syl 14 . 2  |-  ( A. x  e.  A  B  =  C  ->  (Disj  x  e.  A  C  -> Disj  x  e.  A  B )
)
94, 8impbid 120 1  |-  ( A. x  e.  A  B  =  C  ->  (Disj  x  e.  A  B  <-> Disj  x  e.  A  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 98    = wceq 1243   A.wral 2306    C_ wss 2917  Disj wdisj 3745
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-ral 2311  df-rmo 2314  df-in 2924  df-ss 2931  df-disj 3746
This theorem is referenced by:  disjeq2dv  3750
  Copyright terms: Public domain W3C validator