Metamath Proof Explorer


Theorem trclubNEW

Description: If a relation exists then the transitive closure has an upper bound. (Contributed by RP, 24-Jul-2020)

Ref Expression
Hypotheses trclubNEW.rex φ R V
trclubNEW.rel φ Rel R
Assertion trclubNEW φ x | R x x x x dom R × ran R

Proof

Step Hyp Ref Expression
1 trclubNEW.rex φ R V
2 trclubNEW.rel φ Rel R
3 1 trclubgNEW φ x | R x x x x R dom R × ran R
4 relssdmrn Rel R R dom R × ran R
5 2 4 syl φ R dom R × ran R
6 ssequn1 R dom R × ran R R dom R × ran R = dom R × ran R
7 5 6 sylib φ R dom R × ran R = dom R × ran R
8 3 7 sseqtrd φ x | R x x x x dom R × ran R