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

Theorem ertr 6121
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 6115 . . . . . . 7  |-  ( R  Er  X  ->  Rel  R )
31, 2syl 14 . . . . . 6  |-  ( ph  ->  Rel  R )
4 simpr 103 . . . . . 6  |-  ( ( A R B  /\  B R C )  ->  B R C )
5 brrelex 4382 . . . . . 6  |-  ( ( Rel  R  /\  B R C )  ->  B  e.  _V )
63, 4, 5syl2an 273 . . . . 5  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  ->  B  e.  _V )
7 simpr 103 . . . . 5  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  -> 
( A R B  /\  B R C ) )
8 breq2 3768 . . . . . . 7  |-  ( x  =  B  ->  ( A R x  <->  A R B ) )
9 breq1 3767 . . . . . . 7  |-  ( x  =  B  ->  (
x R C  <->  B R C ) )
108, 9anbi12d 442 . . . . . 6  |-  ( x  =  B  ->  (
( A R x  /\  x R C )  <->  ( A R B  /\  B R C ) ) )
1110spcegv 2641 . . . . 5  |-  ( B  e.  _V  ->  (
( A R B  /\  B R C )  ->  E. x
( A R x  /\  x R C ) ) )
126, 7, 11sylc 56 . . . 4  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  ->  E. x ( A R x  /\  x R C ) )
13 simpl 102 . . . . . 6  |-  ( ( A R B  /\  B R C )  ->  A R B )
14 brrelex 4382 . . . . . 6  |-  ( ( Rel  R  /\  A R B )  ->  A  e.  _V )
153, 13, 14syl2an 273 . . . . 5  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  ->  A  e.  _V )
16 brrelex2 4383 . . . . . 6  |-  ( ( Rel  R  /\  B R C )  ->  C  e.  _V )
173, 4, 16syl2an 273 . . . . 5  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  ->  C  e.  _V )
18 brcog 4502 . . . . 5  |-  ( ( A  e.  _V  /\  C  e.  _V )  ->  ( A ( R  o.  R ) C  <->  E. x ( A R x  /\  x R C ) ) )
1915, 17, 18syl2anc 391 . . . 4  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  -> 
( A ( R  o.  R ) C  <->  E. x ( A R x  /\  x R C ) ) )
2012, 19mpbird 156 . . 3  |-  ( (
ph  /\  ( A R B  /\  B R C ) )  ->  A ( R  o.  R ) C )
2120ex 108 . 2  |-  ( ph  ->  ( ( A R B  /\  B R C )  ->  A
( R  o.  R
) C ) )
22 df-er 6106 . . . . . 6  |-  ( R  Er  X  <->  ( Rel  R  /\  dom  R  =  X  /\  ( `' R  u.  ( R  o.  R ) ) 
C_  R ) )
2322simp3bi 921 . . . . 5  |-  ( R  Er  X  ->  ( `' R  u.  ( R  o.  R )
)  C_  R )
241, 23syl 14 . . . 4  |-  ( ph  ->  ( `' R  u.  ( R  o.  R
) )  C_  R
)
2524unssbd 3121 . . 3  |-  ( ph  ->  ( R  o.  R
)  C_  R )
2625ssbrd 3805 . 2  |-  ( ph  ->  ( A ( R  o.  R ) C  ->  A R C ) )
2721, 26syld 40 1  |-  ( ph  ->  ( ( A R B  /\  B R C )  ->  A R C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98    = wceq 1243   E.wex 1381    e. wcel 1393   _Vcvv 2557    u. cun 2915    C_ wss 2917   class class class wbr 3764   `'ccnv 4344   dom cdm 4345    o. ccom 4349   Rel wrel 4350    Er wer 6103
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-opab 3819  df-xp 4351  df-rel 4352  df-co 4354  df-er 6106
This theorem is referenced by:  ertrd  6122  erth  6150  iinerm  6178  entr  6264
  Copyright terms: Public domain W3C validator