Metamath Proof Explorer


Theorem trclfvlb2

Description: The transitive closure of a relation has a lower bound. (Contributed by RP, 8-May-2020)

Ref Expression
Assertion trclfvlb2 RVRRt+R

Proof

Step Hyp Ref Expression
1 trclfvcotr RVt+Rt+Rt+R
2 trclfvlb RVRt+R
3 1 2 2 trrelssd RVRRt+R