Metamath Proof Explorer


Theorem trclfvlb

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

Ref Expression
Assertion trclfvlb RVRt+R

Proof

Step Hyp Ref Expression
1 ssmin Rr|Rrrrr
2 trclfv RVt+R=r|Rrrrr
3 1 2 sseqtrrid RVRt+R