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

Theorem disjss2 5037
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 3964 . . . . 5 (𝐵𝐶 → (𝑦𝐵𝑦𝐶))
21ralimi 3163 . . . 4 (∀𝑥𝐴 𝐵𝐶 → ∀𝑥𝐴 (𝑦𝐵𝑦𝐶))
3 rmoim 3734 . . . 4 (∀𝑥𝐴 (𝑦𝐵𝑦𝐶) → (∃*𝑥𝐴 𝑦𝐶 → ∃*𝑥𝐴 𝑦𝐵))
42, 3syl 17 . . 3 (∀𝑥𝐴 𝐵𝐶 → (∃*𝑥𝐴 𝑦𝐶 → ∃*𝑥𝐴 𝑦𝐵))
54alimdv 1916 . 2 (∀𝑥𝐴 𝐵𝐶 → (∀𝑦∃*𝑥𝐴 𝑦𝐶 → ∀𝑦∃*𝑥𝐴 𝑦𝐵))
6 df-disj 5035 . 2 (Disj 𝑥𝐴 𝐶 ↔ ∀𝑦∃*𝑥𝐴 𝑦𝐶)
7 df-disj 5035 . 2 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑦∃*𝑥𝐴 𝑦𝐵)
85, 6, 73imtr4g 298 1 (∀𝑥𝐴 𝐵𝐶 → (Disj 𝑥𝐴 𝐶Disj 𝑥𝐴 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1534  wcel 2113  wral 3141  ∃*wrmo 3144  wss 3939  Disj wdisj 5034
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-clab 2803  df-cleq 2817  df-clel 2896  df-ral 3146  df-rmo 3149  df-in 3946  df-ss 3955  df-disj 5035
This theorem is referenced by:  disjeq2  5038  0disj  5061  uniioombllem2  24187  uniioombllem4  24190  disjxwwlksn  27685  disjxwwlkn  27695  fusgreghash2wspv  28117  fsumiunss  41862
  Copyright terms: Public domain W3C validator