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

Theorem ertr 6437
Description: An equivalence relation is transitive. (Contributed by NM, 4-Jun-1995.) (Revised by Mario Carneiro, 12-Aug-2015.)
Hypothesis
Ref Expression
ersymb.1  |-  ( ph  ->  R  Er  X )
Assertion
Ref Expression
ertr  |-  ( ph  ->  ( ( A R B  /\  B R C )  ->  A R C ) )

Proof of Theorem ertr
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ersymb.1 . . . . . . 7  |-  ( ph  ->  R  Er  X )
2 errel 6431 . . . . . . 7  |-  ( R  Er  X  ->  Rel  R )
31, 2syl 14 . . . . . 6  |-  ( ph  ->  Rel  R )
4 simpr 109 . . . . . 6  |-  ( ( A R B  /\  B R C )  ->  B R C )
5 brrelex 4574 . . . . . 6  |-  ( ( Rel  R  /\  B R C )  ->  B  e.  _V )
63, 4, 5syl2an 287 . . . . 5  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  ->  B  e.  _V )
7 simpr 109 . . . . 5  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  -> 
( A R B  /\  B R C ) )
8 breq2 3928 . . . . . . 7  |-  ( x  =  B  ->  ( A R x  <->  A R B ) )
9 breq1 3927 . . . . . . 7  |-  ( x  =  B  ->  (
x R C  <->  B R C ) )
108, 9anbi12d 464 . . . . . 6  |-  ( x  =  B  ->  (
( A R x  /\  x R C )  <->  ( A R B  /\  B R C ) ) )
1110spcegv 2769 . . . . 5  |-  ( B  e.  _V  ->  (
( A R B  /\  B R C )  ->  E. x
( A R x  /\  x R C ) ) )
126, 7, 11sylc 62 . . . 4  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  ->  E. x ( A R x  /\  x R C ) )
13 simpl 108 . . . . . 6  |-  ( ( A R B  /\  B R C )  ->  A R B )
14 brrelex 4574 . . . . . 6  |-  ( ( Rel  R  /\  A R B )  ->  A  e.  _V )
153, 13, 14syl2an 287 . . . . 5  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  ->  A  e.  _V )
16 brrelex2 4575 . . . . . 6  |-  ( ( Rel  R  /\  B R C )  ->  C  e.  _V )
173, 4, 16syl2an 287 . . . . 5  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  ->  C  e.  _V )
18 brcog 4701 . . . . 5  |-  ( ( A  e.  _V  /\  C  e.  _V )  ->  ( A ( R  o.  R ) C  <->  E. x ( A R x  /\  x R C ) ) )
1915, 17, 18syl2anc 408 . . . 4  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  -> 
( A ( R  o.  R ) C  <->  E. x ( A R x  /\  x R C ) ) )
2012, 19mpbird 166 . . 3  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  ->  A ( R  o.  R ) C )
2120ex 114 . 2  |-  ( ph  ->  ( ( A R B  /\  B R C )  ->  A
( R  o.  R
) C ) )
22 df-er 6422 . . . . . 6  |-  ( R  Er  X  <->  ( Rel  R  /\  dom  R  =  X  /\  ( `' R  u.  ( R  o.  R ) ) 
C_  R ) )
2322simp3bi 998 . . . . 5  |-  ( R  Er  X  ->  ( `' R  u.  ( R  o.  R )
)  C_  R )
241, 23syl 14 . . . 4  |-  ( ph  ->  ( `' R  u.  ( R  o.  R
) )  C_  R
)
2524unssbd 3249 . . 3  |-  ( ph  ->  ( R  o.  R
)  C_  R )
2625ssbrd 3966 . 2  |-  ( ph  ->  ( A ( R  o.  R ) C  ->  A R C ) )
2721, 26syld 45 1  |-  ( ph  ->  ( ( A R B  /\  B R C )  ->  A R C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331   E.wex 1468    e. wcel 1480   _Vcvv 2681    u. cun 3064    C_ wss 3066   class class class wbr 3924   `'ccnv 4533   dom cdm 4534    o. ccom 4538   Rel wrel 4539    Er wer 6419
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-co 4543  df-er 6422
This theorem is referenced by:  ertrd  6438  erth  6466  iinerm  6494  entr  6671
  Copyright terms: Public domain W3C validator