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

Theorem indi 1676
Description: Distributive law for intersection over union. Exercise 10 of [TakeutiZaring] p. 17.
Assertion
Ref Expression
indi |- (A i^i (B u. C)) = ((A i^i B) u. (A i^i C))

Proof of Theorem indi
StepHypRef Expression
1 andi 456 . . . 4 |- ((x e. A /\ (x e. B \/ x e. C)) <-> ((x e. A /\ x e. B) \/ (x e. A /\ x e. C)))
2 elun 1601 . . . . 5 |- (x e. (B u. C) <-> (x e. B \/ x e. C))
32anbi2i 367 . . . 4 |- ((x e. A /\ x e. (B u. C)) <-> (x e. A /\ (x e. B \/ x e. C)))
4 elin 1635 . . . . 5 |- (x e. (A i^i B) <-> (x e. A /\ x e. B))
5 elin 1635 . . . . 5 |- (x e. (A i^i C) <-> (x e. A /\ x e. C))
64, 5orbi12i 216 . . . 4 |- ((x e. (A i^i B) \/ x e. (A i^i C)) <-> ((x e. A /\ x e. B) \/ (x e. A /\ x e. C)))
71, 3, 63bitr4 158 . . 3 |- ((x e. A /\ x e. (B u. C)) <-> (x e. (A i^i B) \/ x e. (A i^i C)))
8 elin 1635 . . 3 |- (x e. (A i^i (B u. C)) <-> (x e. A /\ x e. (B u. C)))
9 elun 1601 . . 3 |- (x e. ((A i^i B) u. (A i^i C)) <-> (x e. (A i^i B) \/ x e. (A i^i C)))
107, 8, 93bitr4 158 . 2 |- (x e. (A i^i (B u. C)) <-> x e. ((A i^i B) u. (A i^i C)))
1110cleqri 1101 1 |- (A i^i (B u. C)) = ((A i^i B) u. (A i^i C))
Colors of variables: wff set class
Syntax hints:   \/ wo 195   /\ wa 196   = wceq 1091   e. wcel 1092   u. cun 1485   i^i cin 1486
This theorem is referenced by:  indir 1678  difindi 1683  undisj2 1740  difdifdir 1765  resundi 2582  kmlem2 3581
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-v 1349  df-un 1490  df-in 1491
metamath.org