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

Theorem iunss1 4960
Description: Subclass theorem for indexed union. (Contributed by NM, 10-Dec-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
iunss1 (𝐴𝐵 𝑥𝐴 𝐶 𝑥𝐵 𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem iunss1
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ssrexv 4002 . . 3 (𝐴𝐵 → (∃𝑥𝐴 𝑦𝐶 → ∃𝑥𝐵 𝑦𝐶))
2 eliun 4949 . . 3 (𝑦 𝑥𝐴 𝐶 ↔ ∃𝑥𝐴 𝑦𝐶)
3 eliun 4949 . . 3 (𝑦 𝑥𝐵 𝐶 ↔ ∃𝑥𝐵 𝑦𝐶)
41, 2, 33imtr4g 296 . 2 (𝐴𝐵 → (𝑦 𝑥𝐴 𝐶𝑦 𝑥𝐵 𝐶))
54ssrdv 3938 1 (𝐴𝐵 𝑥𝐴 𝐶 𝑥𝐵 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2114  wrex 3059  wss 3900   ciun 4945
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2707
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2714  df-cleq 2727  df-clel 2810  df-rex 3060  df-v 3441  df-ss 3917  df-iun 4947
This theorem is referenced by:  iuneq1  4962  iunxdif2  5008  oelim2  8523  fsumiun  15746  ovolfiniun  25460  uniioovol  25538  fusgreghash2wspv  30391  ssdifidllem  33516  esum2dlem  34228  esum2d  34229  carsgclctunlem2  34455  bnj1413  35170  bnj1408  35171  volsupnfl  37835  corclrcl  43985  cotrcltrcl  44003  iuneqfzuzlem  45616  fsumiunss  45858  sge0iunmptlemfi  46694  sge0iunmptlemre  46696  carageniuncllem1  46802  carageniuncllem2  46803  caratheodorylem2  46808  ovnsubaddlem1  46851
  Copyright terms: Public domain W3C validator