Database
REAL AND COMPLEX NUMBERS
Reflexive and transitive closures of relations
The reflexive and transitive properties of relations
xptrrel
Next ⟩
0trrel
Metamath Proof Explorer
Ascii
Unicode
Theorem
xptrrel
Description:
The cross product is always a transitive relation.
(Contributed by
RP
, 24-Dec-2019)
Ref
Expression
Assertion
xptrrel
⊢
A
×
B
∘
A
×
B
⊆
A
×
B
Proof
Step
Hyp
Ref
Expression
1
inss1
⊢
dom
⁡
A
×
B
∩
ran
⁡
A
×
B
⊆
dom
⁡
A
×
B
2
dmxpss
⊢
dom
⁡
A
×
B
⊆
A
3
1
2
sstri
⊢
dom
⁡
A
×
B
∩
ran
⁡
A
×
B
⊆
A
4
inss2
⊢
dom
⁡
A
×
B
∩
ran
⁡
A
×
B
⊆
ran
⁡
A
×
B
5
rnxpss
⊢
ran
⁡
A
×
B
⊆
B
6
4
5
sstri
⊢
dom
⁡
A
×
B
∩
ran
⁡
A
×
B
⊆
B
7
3
6
ssini
⊢
dom
⁡
A
×
B
∩
ran
⁡
A
×
B
⊆
A
∩
B
8
eqimss
⊢
A
∩
B
=
∅
→
A
∩
B
⊆
∅
9
7
8
sstrid
⊢
A
∩
B
=
∅
→
dom
⁡
A
×
B
∩
ran
⁡
A
×
B
⊆
∅
10
ss0
⊢
dom
⁡
A
×
B
∩
ran
⁡
A
×
B
⊆
∅
→
dom
⁡
A
×
B
∩
ran
⁡
A
×
B
=
∅
11
9
10
syl
⊢
A
∩
B
=
∅
→
dom
⁡
A
×
B
∩
ran
⁡
A
×
B
=
∅
12
11
coemptyd
⊢
A
∩
B
=
∅
→
A
×
B
∘
A
×
B
=
∅
13
0ss
⊢
∅
⊆
A
×
B
14
12
13
eqsstrdi
⊢
A
∩
B
=
∅
→
A
×
B
∘
A
×
B
⊆
A
×
B
15
neqne
⊢
¬
A
∩
B
=
∅
→
A
∩
B
≠
∅
16
15
xpcoidgend
⊢
¬
A
∩
B
=
∅
→
A
×
B
∘
A
×
B
=
A
×
B
17
ssid
⊢
A
×
B
⊆
A
×
B
18
16
17
eqsstrdi
⊢
¬
A
∩
B
=
∅
→
A
×
B
∘
A
×
B
⊆
A
×
B
19
14
18
pm2.61i
⊢
A
×
B
∘
A
×
B
⊆
A
×
B