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

Theorem relcnvtr 5053
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 4719 . . 3  |-  `' ( R  o.  R )  =  ( `' R  o.  `' R )
2 cnvss 4707 . . 3  |-  ( ( R  o.  R ) 
C_  R  ->  `' ( R  o.  R
)  C_  `' R
)
31, 2eqsstrrid 3139 . 2  |-  ( ( R  o.  R ) 
C_  R  ->  ( `' R  o.  `' R )  C_  `' R )
4 cnvco 4719 . . . 4  |-  `' ( `' R  o.  `' R )  =  ( `' `' R  o.  `' `' R )
5 cnvss 4707 . . . 4  |-  ( ( `' R  o.  `' R )  C_  `' R  ->  `' ( `' R  o.  `' R
)  C_  `' `' R )
6 sseq1 3115 . . . . 5  |-  ( `' ( `' R  o.  `' R )  =  ( `' `' R  o.  `' `' R )  ->  ( `' ( `' R  o.  `' R )  C_  `' `' R  <->  ( `' `' R  o.  `' `' R )  C_  `' `' R ) )
7 dfrel2 4984 . . . . . . 7  |-  ( Rel 
R  <->  `' `' R  =  R
)
8 coeq1 4691 . . . . . . . . . 10  |-  ( `' `' R  =  R  ->  ( `' `' R  o.  `' `' R )  =  ( R  o.  `' `' R ) )
9 coeq2 4692 . . . . . . . . . 10  |-  ( `' `' R  =  R  ->  ( R  o.  `' `' R )  =  ( R  o.  R ) )
108, 9eqtrd 2170 . . . . . . . . 9  |-  ( `' `' R  =  R  ->  ( `' `' R  o.  `' `' R )  =  ( R  o.  R ) )
11 id 19 . . . . . . . . 9  |-  ( `' `' R  =  R  ->  `' `' R  =  R
)
1210, 11sseq12d 3123 . . . . . . . 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 1331    C_ wss 3066   `'ccnv 4533    o. ccom 4538   Rel wrel 4539
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-opab 3985  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator