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

Theorem iunin2 2613
Description: Indexed union of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use uniiun 2605 to recover Enderton's theorem.
Assertion
Ref Expression
iunin2 |- U_x e. A (B i^i C) = (B i^i U_x e. A C)
Distinct variable group:   x,B

Proof of Theorem iunin2
StepHypRef Expression
1 r19.42v 1767 . . . 4 |- (E.x e. A (y e. B /\ y e. C) <-> (y e. B /\ E.x e. A y e. C))
2 elin 2210 . . . . 5 |- (y e. (B i^i C) <-> (y e. B /\ y e. C))
32rexbii 1671 . . . 4 |- (E.x e. A y e. (B i^i C) <-> E.x e. A (y e. B /\ y e. C))
4 eliun 2574 . . . . 5 |- (y e. U_x e. A C <-> E.x e. A y e. C)
54anbi2i 482 . . . 4 |- ((y e. B /\ y e. U_x e. A C) <-> (y e. B /\ E.x e. A y e. C))
61, 3, 53bitr4 183 . . 3 |- (E.x e. A y e. (B i^i C) <-> (y e. B /\ y e. U_x e. A C))
7 eliun 2574 . . 3 |- (y e. U_x e. A (B i^i C) <-> E.x e. A y e. (B i^i C))
8 elin 2210 . . 3 |- (y e. (B i^i U_x e. A C) <-> (y e. B /\ y e. U_x e. A C))
96, 7, 83bitr4 183 . 2 |- (y e. U_x e. A (B i^i C) <-> y e. (B i^i U_x e. A C))
109eqriv 1477 1 |- U_x e. A (B i^i C) = (B i^i U_x e. A C)
Colors of variables: wff set class
Syntax hints:   /\ wa 223   = wceq 958   e. wcel 960  E.wrex 1649   i^i cin 2049  U_ciun 2570
This theorem is referenced by:  kmlem11 4785  subtop 7643
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-clab 1467  df-cleq 1472  df-clel 1475  df-rex 1653  df-v 1815  df-in 2054  df-iun 2572
Copyright terms: Public domain