HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem ss2iun 3271
Description: Subclass theorem for indexed union. (The proof was shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
ss2iun |- (A.x e. A B C_ C -> U_x e. A B C_ U_x e. A C)

Proof of Theorem ss2iun
StepHypRef Expression
1 ssel 2615 . . . . 5 |- (B C_ C -> (y e. B -> y e. C))
21ralimi 2168 . . . 4 |- (A.x e. A B C_ C -> A.x e. A (y e. B -> y e. C))
3 rexim 2194 . . . 4 |- (A.x e. A (y e. B -> y e. C) -> (E.x e. A y e. B -> E.x e. A y e. C))
42, 3syl 12 . . 3 |- (A.x e. A B C_ C -> (E.x e. A y e. B -> E.x e. A y e. C))
5 eliun 3259 . . 3 |- (y e. U_x e. A B <-> E.x e. A y e. B)
6 eliun 3259 . . 3 |- (y e. U_x e. A C <-> E.x e. A y e. C)
74, 5, 63imtr4g 612 . 2 |- (A.x e. A B C_ C -> (y e. U_x e. A B -> y e. U_x e. A C))
87ssrdv 2622 1 |- (A.x e. A B C_ C -> U_x e. A B C_ U_x e. A C)
Colors of variables: wff set class
Syntax hints:   -> wi 3   e. wcel 1300  A.wral 2105  E.wrex 2106   C_ wss 2593  U_ciun 3255
This theorem is referenced by:  iuneq2 3273  oawordri 5232  omwordri 5251  oewordri 5267  oeworde 5268  r1val1 5769  bnj1145 13431  bnj1137 13433  bnj1136 13435  neibastop2lem2 15520  smoge 16454
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-clab 1872  df-cleq 1877  df-clel 1880  df-ral 2109  df-rex 2110  df-v 2294  df-in 2603  df-ss 2605  df-iun 3257
Copyright terms: Public domain