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

Theorem iunss1 4970
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 3982 . . 3 (𝐴 ⊆ 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 → ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐶))
2 eliun 4959 . . 3 (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)
3 eliun 4959 . . 3 (𝑦 ∈ ∪ 𝑥 ∈ 𝐵 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐶)
41, 2, 33imtr4g 299 . 2 (𝐴 ⊆ 𝐵 → (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐶 → 𝑦 ∈ ∪ 𝑥 ∈ 𝐵 𝐶))
54ssrdv 3918 1 (𝐴 ⊆ 𝐵 → ∪ 𝑥 ∈ 𝐴 𝐶 ⊆ ∪ 𝑥 ∈ 𝐵 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∈ wcel 2150  ∃wrex 3093   ⊆ wss 3899  ∪ ciun 4955
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1575  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-rex 3094  df-v 3455  df-ss 3900  df-iun 4957
This theorem is used by:  iuneq1  4972  iunxdif2  5016  oelim2  8641  fsumiun  16031  ssdifidllem  21693  ovolfiniun  25879  uniioovol  25957  fusgreghash2wspv  30995  esum2dlem  34836  esum2d  34837  carsgclctunlem2  35063  bnj1413  35777  bnj1408  35778  volsupnfl  38853  corclrcl  45028  cotrcltrcl  45046  iuneqfzuzlem  46679  fsumiunss  46920  sge0iunmptlemfi  47756  sge0iunmptlemre  47758  carageniuncllem1  47864  carageniuncllem2  47865  caratheodorylem2  47870  ovnsubaddlem1  47913
  Copyright terms: Public domain W3C validator