Database
REAL AND COMPLEX NUMBERS
Reflexive and transitive closures of relations
Definitions and basic properties of transitive closures
reltrclfv
Next ⟩
dmtrclfv
Metamath Proof Explorer
Ascii
Unicode
Theorem
reltrclfv
Description:
The transitive closure of a relation is a relation.
(Contributed by
RP
, 9-May-2020)
Ref
Expression
Assertion
reltrclfv
⊢
R
∈
V
∧
Rel
⁡
R
→
Rel
⁡
t+
⁡
R
Proof
Step
Hyp
Ref
Expression
1
trclfvub
⊢
R
∈
V
→
t+
⁡
R
⊆
R
∪
dom
⁡
R
×
ran
⁡
R
2
1
adantr
⊢
R
∈
V
∧
Rel
⁡
R
→
t+
⁡
R
⊆
R
∪
dom
⁡
R
×
ran
⁡
R
3
simpr
⊢
R
∈
V
∧
Rel
⁡
R
→
Rel
⁡
R
4
relssdmrn
⊢
Rel
⁡
R
→
R
⊆
dom
⁡
R
×
ran
⁡
R
5
ssequn1
⊢
R
⊆
dom
⁡
R
×
ran
⁡
R
↔
R
∪
dom
⁡
R
×
ran
⁡
R
=
dom
⁡
R
×
ran
⁡
R
6
5
biimpi
⊢
R
⊆
dom
⁡
R
×
ran
⁡
R
→
R
∪
dom
⁡
R
×
ran
⁡
R
=
dom
⁡
R
×
ran
⁡
R
7
3
4
6
3syl
⊢
R
∈
V
∧
Rel
⁡
R
→
R
∪
dom
⁡
R
×
ran
⁡
R
=
dom
⁡
R
×
ran
⁡
R
8
2
7
sseqtrd
⊢
R
∈
V
∧
Rel
⁡
R
→
t+
⁡
R
⊆
dom
⁡
R
×
ran
⁡
R
9
xpss
⊢
dom
⁡
R
×
ran
⁡
R
⊆
V
×
V
10
8
9
sstrdi
⊢
R
∈
V
∧
Rel
⁡
R
→
t+
⁡
R
⊆
V
×
V
11
df-rel
⊢
Rel
⁡
t+
⁡
R
↔
t+
⁡
R
⊆
V
×
V
12
10
11
sylibr
⊢
R
∈
V
∧
Rel
⁡
R
→
Rel
⁡
t+
⁡
R