Metamath Proof Explorer


Theorem trclub

Description: The Cartesian product of the domain and range of a relation is an upper bound for its transitive closure. (Contributed by RP, 17-May-2020)

Ref Expression
Assertion trclub R V Rel R r | R r r r r dom R × ran R

Proof

Step Hyp Ref Expression
1 relssdmrn Rel R R dom R × ran R
2 ssequn1 R dom R × ran R R dom R × ran R = dom R × ran R
3 1 2 sylib Rel R R dom R × ran R = dom R × ran R
4 trclublem R V R dom R × ran R r | R r r r r
5 eleq1 R dom R × ran R = dom R × ran R R dom R × ran R r | R r r r r dom R × ran R r | R r r r r
6 5 biimpa R dom R × ran R = dom R × ran R R dom R × ran R r | R r r r r dom R × ran R r | R r r r r
7 3 4 6 syl2anr R V Rel R dom R × ran R r | R r r r r
8 intss1 dom R × ran R r | R r r r r r | R r r r r dom R × ran R
9 7 8 syl R V Rel R r | R r r r r dom R × ran R