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

Theorem disjeq2 5078
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 3971 . . . 4 (𝐵 = 𝐶 → 𝐶 ⊆ 𝐵)
21ralimi 3106 . . 3 (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵)
3 disjss2 5077 . . 3 (∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑥 ∈ 𝐴 𝐶))
42, 3syl 18 . 2 (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑥 ∈ 𝐴 𝐶))
5 eqimss 3970 . . . 4 (𝐵 = 𝐶 → 𝐵 ⊆ 𝐶)
65ralimi 3106 . . 3 (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
7 disjss2 5077 . . 3 (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐴 𝐵))
86, 7syl 18 . 2 (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐴 𝐵))
94, 8impbid 215 1 (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1572  ∀wral 3083   ⊆ wss 3899  Disj wdisj 5074
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1815  df-mo 2570  df-cleq 2758  df-clel 2842  df-ral 3084  df-rmo 3368  df-ss 3900  df-disj 5075
This theorem is used by:  disjeq2dv  5079  voliun  25932  carsgclctunlem2  35063  disjeq12i  37198  mblfinlem2  38846  voliunnfl  38852
  Copyright terms: Public domain W3C validator