Database
REAL AND COMPLEX NUMBERS
Reflexive and transitive closures of relations
Basic properties of closures
cleq1
Next ⟩
clsslem
Metamath Proof Explorer
Ascii
Unicode
Theorem
cleq1
Description:
Equality of relations implies equality of closures.
(Contributed by
RP
, 9-May-2020)
Ref
Expression
Assertion
cleq1
⊢
R
=
S
→
⋂
r
|
R
⊆
r
∧
φ
=
⋂
r
|
S
⊆
r
∧
φ
Proof
Step
Hyp
Ref
Expression
1
cleq1lem
⊢
R
=
S
→
R
⊆
r
∧
φ
↔
S
⊆
r
∧
φ
2
1
abbidv
⊢
R
=
S
→
r
|
R
⊆
r
∧
φ
=
r
|
S
⊆
r
∧
φ
3
2
inteqd
⊢
R
=
S
→
⋂
r
|
R
⊆
r
∧
φ
=
⋂
r
|
S
⊆
r
∧
φ