Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  trclubNEW Structured version   Visualization version   Unicode version

Theorem trclubNEW 37926
Description: If a relation exists then the transitive closure has an upper bound. (Contributed by RP, 24-Jul-2020.)
Hypotheses
Ref Expression
trclubNEW.rex  |-  ( ph  ->  R  e.  _V )
trclubNEW.rel  |-  ( ph  ->  Rel  R )
Assertion
Ref Expression
trclubNEW  |-  ( ph  ->  |^| { x  |  ( R  C_  x  /\  ( x  o.  x
)  C_  x ) }  C_  ( dom  R  X.  ran  R ) )
Distinct variable group:    x, R
Allowed substitution hint:    ph( x)

Proof of Theorem trclubNEW
StepHypRef Expression
1 trclubNEW.rex . . 3  |-  ( ph  ->  R  e.  _V )
21trclubgNEW 37925 . 2  |-  ( ph  ->  |^| { x  |  ( R  C_  x  /\  ( x  o.  x
)  C_  x ) }  C_  ( R  u.  ( dom  R  X.  ran  R ) ) )
3 trclubNEW.rel . . . 4  |-  ( ph  ->  Rel  R )
4 relssdmrn 5656 . . . 4  |-  ( Rel 
R  ->  R  C_  ( dom  R  X.  ran  R
) )
53, 4syl 17 . . 3  |-  ( ph  ->  R  C_  ( dom  R  X.  ran  R ) )
6 ssequn1 3783 . . 3  |-  ( R 
C_  ( dom  R  X.  ran  R )  <->  ( R  u.  ( dom  R  X.  ran  R ) )  =  ( dom  R  X.  ran  R ) )
75, 6sylib 208 . 2  |-  ( ph  ->  ( R  u.  ( dom  R  X.  ran  R
) )  =  ( dom  R  X.  ran  R ) )
82, 7sseqtrd 3641 1  |-  ( ph  ->  |^| { x  |  ( R  C_  x  /\  ( x  o.  x
)  C_  x ) }  C_  ( dom  R  X.  ran  R ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   {cab 2608   _Vcvv 3200    u. cun 3572    C_ wss 3574   |^|cint 4475    X. cxp 5112   dom cdm 5114   ran crn 5115    o. ccom 5118   Rel wrel 5119
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-int 4476  df-br 4654  df-opab 4713  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator