MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  disjeq1 Structured version   Visualization version   GIF version

Theorem disjeq1 5031
Description: Equality theorem for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
Assertion
Ref Expression
disjeq1 (𝐴 = 𝐵 → (Disj 𝑥𝐴 𝐶Disj 𝑥𝐵 𝐶))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem disjeq1
StepHypRef Expression
1 eqimss2 4017 . . 3 (𝐴 = 𝐵𝐵𝐴)
2 disjss1 5030 . . 3 (𝐵𝐴 → (Disj 𝑥𝐴 𝐶Disj 𝑥𝐵 𝐶))
31, 2syl 17 . 2 (𝐴 = 𝐵 → (Disj 𝑥𝐴 𝐶Disj 𝑥𝐵 𝐶))
4 eqimss 4016 . . 3 (𝐴 = 𝐵𝐴𝐵)
5 disjss1 5030 . . 3 (𝐴𝐵 → (Disj 𝑥𝐵 𝐶Disj 𝑥𝐴 𝐶))
64, 5syl 17 . 2 (𝐴 = 𝐵 → (Disj 𝑥𝐵 𝐶Disj 𝑥𝐴 𝐶))
73, 6impbid 214 1 (𝐴 = 𝐵 → (Disj 𝑥𝐴 𝐶Disj 𝑥𝐵 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208   = wceq 1536  wss 3929  Disj wdisj 5024
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-clab 2799  df-cleq 2813  df-clel 2892  df-rmo 3145  df-in 3936  df-ss 3945  df-disj 5025
This theorem is referenced by:  disjeq1d  5032  volfiniun  24143  disjrnmpt  30335  iundisj2cnt  30522  unelldsys  31438  sigapildsys  31442  ldgenpisyslem1  31443  rossros  31460  measvun  31489  pmeasmono  31603  pmeasadd  31604  meadjuni  42813
  Copyright terms: Public domain W3C validator