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

Theorem disjss2 5070
Description: If each element of a collection is contained in a disjoint collection, the original collection is also disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.)
Assertion
Ref Expression
disjss2 (∀𝑥𝐴 𝐵𝐶 → (Disj 𝑥𝐴 𝐶Disj 𝑥𝐴 𝐵))

Proof of Theorem disjss2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ssel 3930 . . . . 5 (𝐵𝐶 → (𝑦𝐵𝑦𝐶))
21ralimi 3099 . . . 4 (∀𝑥𝐴 𝐵𝐶 → ∀𝑥𝐴 (𝑦𝐵𝑦𝐶))
3 rmoim 3703 . . . 4 (∀𝑥𝐴 (𝑦𝐵𝑦𝐶) → (∃*𝑥𝐴 𝑦𝐶 → ∃*𝑥𝐴 𝑦𝐵))
42, 3syl 17 . . 3 (∀𝑥𝐴 𝐵𝐶 → (∃*𝑥𝐴 𝑦𝐶 → ∃*𝑥𝐴 𝑦𝐵))
54alimdv 1936 . 2 (∀𝑥𝐴 𝐵𝐶 → (∀𝑦∃*𝑥𝐴 𝑦𝐶 → ∀𝑦∃*𝑥𝐴 𝑦𝐵))
6 df-disj 5068 . 2 (Disj 𝑥𝐴 𝐶 ↔ ∀𝑦∃*𝑥𝐴 𝑦𝐶)
7 df-disj 5068 . 2 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑦∃*𝑥𝐴 𝑦𝐵)
85, 6, 73imtr4g 298 1 (∀𝑥𝐴 𝐵𝐶 → (Disj 𝑥𝐴 𝐶Disj 𝑥𝐴 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1558  wcel 2142  wral 3076  ∃*wrmo 3366  wss 3904  Disj wdisj 5067
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144
This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1800  df-mo 2566  df-clel 2837  df-ral 3077  df-rmo 3367  df-ss 3921  df-disj 5068
This theorem is referenced by:  disjeq2  5071  0disj  5093  uniioombllem2  25645  uniioombllem4  25648  disjxwwlksn  30104  disjxwwlkn  30113  fusgreghash2wspv  30537  fsumiunss  46151
  Copyright terms: Public domain W3C validator