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

Theorem disjeq2 5039
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 3974 . . . 4 (𝐵 = 𝐶𝐶𝐵)
21ralimi 3086 . . 3 (∀𝑥𝐴 𝐵 = 𝐶 → ∀𝑥𝐴 𝐶𝐵)
3 disjss2 5038 . . 3 (∀𝑥𝐴 𝐶𝐵 → (Disj 𝑥𝐴 𝐵Disj 𝑥𝐴 𝐶))
42, 3syl 17 . 2 (∀𝑥𝐴 𝐵 = 𝐶 → (Disj 𝑥𝐴 𝐵Disj 𝑥𝐴 𝐶))
5 eqimss 3973 . . . 4 (𝐵 = 𝐶𝐵𝐶)
65ralimi 3086 . . 3 (∀𝑥𝐴 𝐵 = 𝐶 → ∀𝑥𝐴 𝐵𝐶)
7 disjss2 5038 . . 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 1539  wral 3063  wss 3883  Disj wdisj 5035
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1542  df-ex 1784  df-sb 2069  df-mo 2540  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rmo 3071  df-v 3424  df-in 3890  df-ss 3900  df-disj 5036
This theorem is referenced by:  disjeq2dv  5040  voliun  24623  carsgclctunlem2  32186  mblfinlem2  35742  voliunnfl  35748
  Copyright terms: Public domain W3C validator