Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  trpredeq2 Structured version   Unicode version

Theorem trpredeq2 27614
Description: Equality theorem for transitive predecessors. (Contributed by Scott Fenton, 2-Feb-2011.)
Assertion
Ref Expression
trpredeq2  |-  ( A  =  B  ->  TrPred ( R ,  A ,  X
)  =  TrPred ( R ,  B ,  X
) )

Proof of Theorem trpredeq2
Dummy variables  a 
y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 predeq2 27557 . . . . . . 7  |-  ( A  =  B  ->  Pred ( R ,  A , 
y )  =  Pred ( R ,  B , 
y ) )
21iuneq2d 4194 . . . . . 6  |-  ( A  =  B  ->  U_ y  e.  a  Pred ( R ,  A ,  y )  =  U_ y  e.  a  Pred ( R ,  B ,  y ) )
32mpteq2dv 4376 . . . . 5  |-  ( A  =  B  ->  (
a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  A , 
y ) )  =  ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  B , 
y ) ) )
4 predeq2 27557 . . . . 5  |-  ( A  =  B  ->  Pred ( R ,  A ,  X )  =  Pred ( R ,  B ,  X ) )
5 rdgeq12 6865 . . . . . 6  |-  ( ( ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  A , 
y ) )  =  ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  B , 
y ) )  /\  Pred ( R ,  A ,  X )  =  Pred ( R ,  B ,  X ) )  ->  rec ( ( a  e. 
_V  |->  U_ y  e.  a 
Pred ( R ,  A ,  y )
) ,  Pred ( R ,  A ,  X ) )  =  rec ( ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  B ,  y ) ) ,  Pred ( R ,  B ,  X ) ) )
65reseq1d 5105 . . . . 5  |-  ( ( ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  A , 
y ) )  =  ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  B , 
y ) )  /\  Pred ( R ,  A ,  X )  =  Pred ( R ,  B ,  X ) )  -> 
( rec ( ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  A , 
y ) ) , 
Pred ( R ,  A ,  X )
)  |`  om )  =  ( rec ( ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  B , 
y ) ) , 
Pred ( R ,  B ,  X )
)  |`  om ) )
73, 4, 6syl2anc 656 . . . 4  |-  ( A  =  B  ->  ( rec ( ( a  e. 
_V  |->  U_ y  e.  a 
Pred ( R ,  A ,  y )
) ,  Pred ( R ,  A ,  X ) )  |`  om )  =  ( rec ( ( a  e. 
_V  |->  U_ y  e.  a 
Pred ( R ,  B ,  y )
) ,  Pred ( R ,  B ,  X ) )  |`  om ) )
87rneqd 5063 . . 3  |-  ( A  =  B  ->  ran  ( rec ( ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  A ,  y ) ) ,  Pred ( R ,  A ,  X ) )  |`  om )  =  ran  ( rec ( ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  B ,  y ) ) ,  Pred ( R ,  B ,  X ) )  |`  om ) )
98unieqd 4098 . 2  |-  ( A  =  B  ->  U. ran  ( rec ( ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  A ,  y ) ) ,  Pred ( R ,  A ,  X ) )  |`  om )  =  U. ran  ( rec ( ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  B , 
y ) ) , 
Pred ( R ,  B ,  X )
)  |`  om ) )
10 df-trpred 27611 . 2  |-  TrPred ( R ,  A ,  X
)  =  U. ran  ( rec ( ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  A ,  y ) ) ,  Pred ( R ,  A ,  X ) )  |`  om )
11 df-trpred 27611 . 2  |-  TrPred ( R ,  B ,  X
)  =  U. ran  ( rec ( ( a  e.  _V  |->  U_ y  e.  a  Pred ( R ,  B ,  y ) ) ,  Pred ( R ,  B ,  X ) )  |`  om )
129, 10, 113eqtr4g 2498 1  |-  ( A  =  B  ->  TrPred ( R ,  A ,  X
)  =  TrPred ( R ,  B ,  X
) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1364   _Vcvv 2970   U.cuni 4088   U_ciun 4168    e. cmpt 4347   ran crn 4837    |` cres 4838   omcom 6475   reccrdg 6861   Predcpred 27553   TrPredctrpred 27610
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1713  ax-7 1733  ax-10 1780  ax-11 1785  ax-12 1797  ax-13 1948  ax-ext 2422
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 962  df-tru 1367  df-ex 1592  df-nf 1595  df-sb 1706  df-clab 2428  df-cleq 2434  df-clel 2437  df-nfc 2566  df-ral 2718  df-rex 2719  df-rab 2722  df-v 2972  df-dif 3328  df-un 3330  df-in 3332  df-ss 3339  df-nul 3635  df-if 3789  df-sn 3875  df-pr 3877  df-op 3881  df-uni 4089  df-iun 4170  df-br 4290  df-opab 4348  df-mpt 4349  df-xp 4842  df-cnv 4844  df-dm 4846  df-rn 4847  df-res 4848  df-ima 4849  df-iota 5378  df-fv 5423  df-recs 6828  df-rdg 6862  df-pred 27554  df-trpred 27611
This theorem is referenced by:  trpredeq2d  27617
  Copyright terms: Public domain W3C validator