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

Theorem uniss2 4902
Description: A subclass condition on the members of two classes that implies a subclass relation on their unions. Proposition 8.6 of [TakeutiZaring] p. 59. See iunss2 5009 for a generalization to indexed unions. (Contributed by NM, 22-Mar-2004.)
Assertion
Ref Expression
uniss2 (∀𝑥𝐴𝑦𝐵 𝑥𝑦 𝐴 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝑦,𝐵
Allowed substitution hint:   𝐴(𝑦)

Proof of Theorem uniss2
StepHypRef Expression
1 ssuni 4893 . . . . 5 ((𝑥𝑦𝑦𝐵) → 𝑥 𝐵)
21expcom 418 . . . 4 (𝑦𝐵 → (𝑥𝑦𝑥 𝐵))
32rexlimiv 3159 . . 3 (∃𝑦𝐵 𝑥𝑦𝑥 𝐵)
43ralimi 3102 . 2 (∀𝑥𝐴𝑦𝐵 𝑥𝑦 → ∀𝑥𝐴 𝑥 𝐵)
5 unissb 4901 . 2 ( 𝐴 𝐵 ↔ ∀𝑥𝐴 𝑥 𝐵)
64, 5sylibr 237 1 (∀𝑥𝐴𝑦𝐵 𝑥𝑦 𝐴 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2145  wral 3079  wrex 3089  wss 3907   cuni 4867
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1566  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-v 3459  df-ss 3924  df-uni 4868
This theorem is referenced by:  unidif  4903  coflim  10233  onsssupeqcond  43864
  Copyright terms: Public domain W3C validator