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

Theorem iunin2 2030
Description: Indexed union of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use uniiun 2026 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(s):   x,A   x,B

Proof of Theorem iunin2
StepHypRef Expression
1 r19.42v 1303 . . . 4 |- (E.x e. A (y e. B /\ y e. C) <-> (y e. B /\ E.x e. A y e. C))
2 elin 1635 . . . . 5 |- (y e. (B i^i C) <-> (y e. B /\ y e. C))
32birex 1224 . . . 4 |- (E.x e. A y e. (B i^i C) <-> E.x e. A (y e. B /\ y e. C))
4 eliun 1998 . . . . 5 |- (y e. U.x e. A C <-> E.x e. A y e. C)
54anbi2i 367 . . . 4 |- ((y e. B /\ y e. U.x e. A C) <-> (y e. B /\ E.x e. A y e. C))
61, 3, 53bitr4 158 . . 3 |- (E.x e. A y e. (B i^i C) <-> (y e. B /\ y e. U.x e. A C))
7 eliun 1998 . . 3 |- (y e. U.x e. A (B i^i C) <-> E.x e. A y e. (B i^i C))
8 elin 1635 . . 3 |- (y e. (B i^i U.x e. A C) <-> (y e. B /\ y e. U.x e. A C))
96, 7, 83bitr4 158 . 2 |- (y e. U.x e. A (B i^i C) <-> y e. (B i^i U.x e. A C))
109cleqri 1101 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 196   = wceq 1091   e. wcel 1092  E.wrex 1202   i^i cin 1486  U.ciun 1994
This theorem is referenced by:  kmlem10 3589
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-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-rex 1206  df-v 1349  df-in 1491  df-iun 1996
metamath.org