Metamath Proof Explorer


Theorem trclfvub

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

Ref Expression
Assertion trclfvub RVt+RRdomR×ranR

Proof

Step Hyp Ref Expression
1 trclfv RVt+R=r|Rrrrr
2 trclubg RVr|RrrrrRdomR×ranR
3 1 2 eqsstrd RVt+RRdomR×ranR