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

Theorem iunss1 2002
Description: Subclass theorem for indexed union.
Assertion
Ref Expression
iunss1 |- (A (_ B -> U.x e. A C (_ U.x e. B C)
Distinct variable group(s):   x,A   x,B

Proof of Theorem iunss1
StepHypRef Expression
1 ssel 1502 . . . . . 6 |- (A (_ B -> (x e. A -> x e. B))
21anim1d 432 . . . . 5 |- (A (_ B -> ((x e. A /\ y e. C) -> (x e. B /\ y e. C)))
32r19.22dv2 1277 . . . 4 |- (A (_ B -> (E.x e. A y e. C -> E.x e. B y e. C))
4319.21aiv 943 . . 3 |- (A (_ B -> A.y(E.x e. A y e. C -> E.x e. B y e. C))
5 ss2ab 1551 . . 3 |- ({y | E.x e. A y e. C} (_ {y | E.x e. B y e. C} <-> A.y(E.x e. A y e. C -> E.x e. B y e. C))
64, 5sylibr 175 . 2 |- (A (_ B -> {y | E.x e. A y e. C} (_ {y | E.x e. B y e. C})
7 df-iun 1996 . 2 |- U.x e. A C = {y | E.x e. A y e. C}
8 df-iun 1996 . 2 |- U.x e. B C = {y | E.x e. B y e. C}
96, 7, 83sstr4g 1541 1 |- (A (_ B -> U.x e. A C (_ U.x e. B C)
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672  {cab 1090   e. wcel 1092  E.wrex 1202   (_ wss 1487  U.ciun 1994
This theorem is referenced by:  iuneq1 2003
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-rex 1206  df-in 1491  df-ss 1492  df-iun 1996
metamath.org