Metamath Proof Explorer


Theorem trclubgNEW

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

Ref Expression
Hypothesis trclubgNEW.rex φ R V
Assertion trclubgNEW φ x | R x x x x R dom R × ran R

Proof

Step Hyp Ref Expression
1 trclubgNEW.rex φ R V
2 1 dmexd φ dom R V
3 rnexg R V ran R V
4 1 3 syl φ ran R V
5 2 4 xpexd φ dom R × ran R V
6 unexg R V dom R × ran R V R dom R × ran R V
7 1 5 6 syl2anc φ R dom R × ran R V
8 id x = R dom R × ran R x = R dom R × ran R
9 8 8 coeq12d x = R dom R × ran R x x = R dom R × ran R R dom R × ran R
10 9 8 sseq12d x = R dom R × ran R x x x R dom R × ran R R dom R × ran R R dom R × ran R
11 ssun1 R R dom R × ran R
12 11 a1i φ R R dom R × ran R
13 cnvssrndm R -1 ran R × dom R
14 coundi R dom R × ran R R dom R × ran R = R dom R × ran R R R dom R × ran R dom R × ran R
15 cnvss R -1 ran R × dom R R -1 -1 ran R × dom R -1
16 coss2 R -1 -1 ran R × dom R -1 R dom R × ran R R -1 -1 R dom R × ran R ran R × dom R -1
17 15 16 syl R -1 ran R × dom R R dom R × ran R R -1 -1 R dom R × ran R ran R × dom R -1
18 cocnvcnv2 R dom R × ran R R -1 -1 = R dom R × ran R R
19 cnvxp ran R × dom R -1 = dom R × ran R
20 19 coeq2i R dom R × ran R ran R × dom R -1 = R dom R × ran R dom R × ran R
21 17 18 20 3sstr3g R -1 ran R × dom R R dom R × ran R R R dom R × ran R dom R × ran R
22 ssequn1 R dom R × ran R R R dom R × ran R dom R × ran R R dom R × ran R R R dom R × ran R dom R × ran R = R dom R × ran R dom R × ran R
23 21 22 sylib R -1 ran R × dom R R dom R × ran R R R dom R × ran R dom R × ran R = R dom R × ran R dom R × ran R
24 coundir R dom R × ran R dom R × ran R = R dom R × ran R dom R × ran R dom R × ran R
25 coss1 R -1 -1 ran R × dom R -1 R -1 -1 dom R × ran R ran R × dom R -1 dom R × ran R
26 15 25 syl R -1 ran R × dom R R -1 -1 dom R × ran R ran R × dom R -1 dom R × ran R
27 cocnvcnv1 R -1 -1 dom R × ran R = R dom R × ran R
28 19 coeq1i ran R × dom R -1 dom R × ran R = dom R × ran R dom R × ran R
29 26 27 28 3sstr3g R -1 ran R × dom R R dom R × ran R dom R × ran R dom R × ran R
30 ssequn1 R dom R × ran R dom R × ran R dom R × ran R R dom R × ran R dom R × ran R dom R × ran R = dom R × ran R dom R × ran R
31 29 30 sylib R -1 ran R × dom R R dom R × ran R dom R × ran R dom R × ran R = dom R × ran R dom R × ran R
32 xptrrel dom R × ran R dom R × ran R dom R × ran R
33 ssun2 dom R × ran R R dom R × ran R
34 32 33 sstri dom R × ran R dom R × ran R R dom R × ran R
35 34 a1i R -1 ran R × dom R dom R × ran R dom R × ran R R dom R × ran R
36 31 35 eqsstrd R -1 ran R × dom R R dom R × ran R dom R × ran R dom R × ran R R dom R × ran R
37 24 36 eqsstrid R -1 ran R × dom R R dom R × ran R dom R × ran R R dom R × ran R
38 23 37 eqsstrd R -1 ran R × dom R R dom R × ran R R R dom R × ran R dom R × ran R R dom R × ran R
39 14 38 eqsstrid R -1 ran R × dom R R dom R × ran R R dom R × ran R R dom R × ran R
40 13 39 mp1i φ R dom R × ran R R dom R × ran R R dom R × ran R
41 7 10 12 40 clublem φ x | R x x x x R dom R × ran R