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

Theorem uniss2 4897
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 5004 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 4888 . . . . 5 ((𝑥𝑦𝑦𝐵) → 𝑥 𝐵)
21expcom 417 . . . 4 (𝑦𝐵 → (𝑥𝑦𝑥 𝐵))
32rexlimiv 3155 . . 3 (∃𝑦𝐵 𝑥𝑦𝑥 𝐵)
43ralimi 3098 . 2 (∀𝑥𝐴𝑦𝐵 𝑥𝑦 → ∀𝑥𝐴 𝑥 𝐵)
5 unissb 4896 . 2 ( 𝐴 𝐵 ↔ ∀𝑥𝐴 𝑥 𝐵)
64, 5sylibr 236 1 (∀𝑥𝐴𝑦𝐵 𝑥𝑦 𝐴 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2141  wral 3075  wrex 3085  wss 3902   cuni 4862
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733
This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1562  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-v 3455  df-ss 3919  df-uni 4863
This theorem is referenced by:  unidif  4898  coflim  10211  onsssupeqcond  43817
  Copyright terms: Public domain W3C validator