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

Theorem disjeq2 5107
Description: Equality theorem for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
Assertion
Ref Expression
disjeq2 (∀𝑥𝐴 𝐵 = 𝐶 → (Disj 𝑥𝐴 𝐵Disj 𝑥𝐴 𝐶))

Proof of Theorem disjeq2
StepHypRef Expression
1 eqimss2 4033 . . . 4 (𝐵 = 𝐶𝐶𝐵)
21ralimi 3075 . . 3 (∀𝑥𝐴 𝐵 = 𝐶 → ∀𝑥𝐴 𝐶𝐵)
3 disjss2 5106 . . 3 (∀𝑥𝐴 𝐶𝐵 → (Disj 𝑥𝐴 𝐵Disj 𝑥𝐴 𝐶))
42, 3syl 17 . 2 (∀𝑥𝐴 𝐵 = 𝐶 → (Disj 𝑥𝐴 𝐵Disj 𝑥𝐴 𝐶))
5 eqimss 4032 . . . 4 (𝐵 = 𝐶𝐵𝐶)
65ralimi 3075 . . 3 (∀𝑥𝐴 𝐵 = 𝐶 → ∀𝑥𝐴 𝐵𝐶)
7 disjss2 5106 . . 3 (∀𝑥𝐴 𝐵𝐶 → (Disj 𝑥𝐴 𝐶Disj 𝑥𝐴 𝐵))
86, 7syl 17 . 2 (∀𝑥𝐴 𝐵 = 𝐶 → (Disj 𝑥𝐴 𝐶Disj 𝑥𝐴 𝐵))
94, 8impbid 211 1 (∀𝑥𝐴 𝐵 = 𝐶 → (Disj 𝑥𝐴 𝐵Disj 𝑥𝐴 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1533  wral 3053  wss 3940  Disj wdisj 5103
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2695
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1536  df-ex 1774  df-sb 2060  df-mo 2526  df-clab 2702  df-cleq 2716  df-clel 2802  df-ral 3054  df-rmo 3368  df-v 3468  df-in 3947  df-ss 3957  df-disj 5104
This theorem is referenced by:  disjeq2dv  5108  voliun  25404  carsgclctunlem2  33773  mblfinlem2  36982  voliunnfl  36988
  Copyright terms: Public domain W3C validator