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

Theorem disjeq2 4999
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 3972 . . . 4 (𝐵 = 𝐶𝐶𝐵)
21ralimi 3128 . . 3 (∀𝑥𝐴 𝐵 = 𝐶 → ∀𝑥𝐴 𝐶𝐵)
3 disjss2 4998 . . 3 (∀𝑥𝐴 𝐶𝐵 → (Disj 𝑥𝐴 𝐵Disj 𝑥𝐴 𝐶))
42, 3syl 17 . 2 (∀𝑥𝐴 𝐵 = 𝐶 → (Disj 𝑥𝐴 𝐵Disj 𝑥𝐴 𝐶))
5 eqimss 3971 . . . 4 (𝐵 = 𝐶𝐵𝐶)
65ralimi 3128 . . 3 (∀𝑥𝐴 𝐵 = 𝐶 → ∀𝑥𝐴 𝐵𝐶)
7 disjss2 4998 . . 3 (∀𝑥𝐴 𝐵𝐶 → (Disj 𝑥𝐴 𝐶Disj 𝑥𝐴 𝐵))
86, 7syl 17 . 2 (∀𝑥𝐴 𝐵 = 𝐶 → (Disj 𝑥𝐴 𝐶Disj 𝑥𝐴 𝐵))
94, 8impbid 215 1 (∀𝑥𝐴 𝐵 = 𝐶 → (Disj 𝑥𝐴 𝐵Disj 𝑥𝐴 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209   = wceq 1538  wral 3106  wss 3881  Disj wdisj 4995
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770
This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782  df-sb 2070  df-mo 2598  df-clab 2777  df-cleq 2791  df-clel 2870  df-ral 3111  df-rmo 3114  df-v 3443  df-in 3888  df-ss 3898  df-disj 4996
This theorem is referenced by:  disjeq2dv  5000  voliun  24158  carsgclctunlem2  31687  mblfinlem2  35095  voliunnfl  35101
  Copyright terms: Public domain W3C validator