Database
ZF (ZERMELO-FRAENKEL) SET THEORY
ZF Set Theory - add the Axiom of Power Sets
Relations
xpun
Next ⟩
elvv
Metamath Proof Explorer
Ascii
Unicode
Theorem
xpun
Description:
The Cartesian product of two unions.
(Contributed by
NM
, 12-Aug-2004)
Ref
Expression
Assertion
xpun
⊢
A
∪
B
×
C
∪
D
=
A
×
C
∪
A
×
D
∪
B
×
C
∪
B
×
D
Proof
Step
Hyp
Ref
Expression
1
xpundi
⊢
A
∪
B
×
C
∪
D
=
A
∪
B
×
C
∪
A
∪
B
×
D
2
xpundir
⊢
A
∪
B
×
C
=
A
×
C
∪
B
×
C
3
xpundir
⊢
A
∪
B
×
D
=
A
×
D
∪
B
×
D
4
2
3
uneq12i
⊢
A
∪
B
×
C
∪
A
∪
B
×
D
=
A
×
C
∪
B
×
C
∪
A
×
D
∪
B
×
D
5
un4
⊢
A
×
C
∪
B
×
C
∪
A
×
D
∪
B
×
D
=
A
×
C
∪
A
×
D
∪
B
×
C
∪
B
×
D
6
1
4
5
3eqtri
⊢
A
∪
B
×
C
∪
D
=
A
×
C
∪
A
×
D
∪
B
×
C
∪
B
×
D