ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  relcnvtr Unicode version

Theorem relcnvtr 5098
Description: A relation is transitive iff its converse is transitive. (Contributed by FL, 19-Sep-2011.)
Assertion
Ref Expression
relcnvtr  |-  ( Rel 
R  ->  ( ( R  o.  R )  C_  R  <->  ( `' R  o.  `' R )  C_  `' R ) )

Proof of Theorem relcnvtr
StepHypRef Expression
1 cnvco 4764 . . 3  |-  `' ( R  o.  R )  =  ( `' R  o.  `' R )
2 cnvss 4752 . . 3  |-  ( ( R  o.  R ) 
C_  R  ->  `' ( R  o.  R
)  C_  `' R
)
31, 2eqsstrrid 3171 . 2  |-  ( ( R  o.  R ) 
C_  R  ->  ( `' R  o.  `' R )  C_  `' R )
4 cnvco 4764 . . . 4  |-  `' ( `' R  o.  `' R )  =  ( `' `' R  o.  `' `' R )
5 cnvss 4752 . . . 4  |-  ( ( `' R  o.  `' R )  C_  `' R  ->  `' ( `' R  o.  `' R
)  C_  `' `' R )
6 sseq1 3147 . . . . 5  |-  ( `' ( `' R  o.  `' R )  =  ( `' `' R  o.  `' `' R )  ->  ( `' ( `' R  o.  `' R )  C_  `' `' R  <->  ( `' `' R  o.  `' `' R )  C_  `' `' R ) )
7 dfrel2 5029 . . . . . . 7  |-  ( Rel 
R  <->  `' `' R  =  R
)
8 coeq1 4736 . . . . . . . . . 10  |-  ( `' `' R  =  R  ->  ( `' `' R  o.  `' `' R )  =  ( R  o.  `' `' R ) )
9 coeq2 4737 . . . . . . . . . 10  |-  ( `' `' R  =  R  ->  ( R  o.  `' `' R )  =  ( R  o.  R ) )
108, 9eqtrd 2187 . . . . . . . . 9  |-  ( `' `' R  =  R  ->  ( `' `' R  o.  `' `' R )  =  ( R  o.  R ) )
11 id 19 . . . . . . . . 9  |-  ( `' `' R  =  R  ->  `' `' R  =  R
)
1210, 11sseq12d 3155 . . . . . . . 8  |-  ( `' `' R  =  R  ->  ( ( `' `' R  o.  `' `' R )  C_  `' `' R  <->  ( R  o.  R )  C_  R
) )
1312biimpd 143 . . . . . . 7  |-  ( `' `' R  =  R  ->  ( ( `' `' R  o.  `' `' R )  C_  `' `' R  ->  ( R  o.  R )  C_  R ) )
147, 13sylbi 120 . . . . . 6  |-  ( Rel 
R  ->  ( ( `' `' R  o.  `' `' R )  C_  `' `' R  ->  ( R  o.  R )  C_  R ) )
1514com12 30 . . . . 5  |-  ( ( `' `' R  o.  `' `' R )  C_  `' `' R  ->  ( Rel 
R  ->  ( R  o.  R )  C_  R
) )
166, 15syl6bi 162 . . . 4  |-  ( `' ( `' R  o.  `' R )  =  ( `' `' R  o.  `' `' R )  ->  ( `' ( `' R  o.  `' R )  C_  `' `' R  ->  ( Rel 
R  ->  ( R  o.  R )  C_  R
) ) )
174, 5, 16mpsyl 65 . . 3  |-  ( ( `' R  o.  `' R )  C_  `' R  ->  ( Rel  R  ->  ( R  o.  R
)  C_  R )
)
1817com12 30 . 2  |-  ( Rel 
R  ->  ( ( `' R  o.  `' R )  C_  `' R  ->  ( R  o.  R )  C_  R
) )
193, 18impbid2 142 1  |-  ( Rel 
R  ->  ( ( R  o.  R )  C_  R  <->  ( `' R  o.  `' R )  C_  `' R ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1332    C_ wss 3098   `'ccnv 4578    o. ccom 4583   Rel wrel 4584
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1481  ax-10 1482  ax-11 1483  ax-i12 1484  ax-bndl 1486  ax-4 1487  ax-17 1503  ax-i9 1507  ax-ial 1511  ax-i5r 1512  ax-14 2128  ax-ext 2136  ax-sep 4078  ax-pow 4130  ax-pr 4164
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1740  df-eu 2006  df-mo 2007  df-clab 2141  df-cleq 2147  df-clel 2150  df-nfc 2285  df-ral 2437  df-rex 2438  df-v 2711  df-un 3102  df-in 3104  df-ss 3111  df-pw 3541  df-sn 3562  df-pr 3563  df-op 3565  df-br 3962  df-opab 4022  df-xp 4585  df-rel 4586  df-cnv 4587  df-co 4588
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator