MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isoeq4 Unicode version

Theorem isoeq4 5835
Description: Equality theorem for isomorphisms. (Contributed by NM, 17-May-2004.)
Assertion
Ref Expression
isoeq4  |-  ( A  =  C  ->  ( H  Isom  R ,  S  ( A ,  B )  <-> 
H  Isom  R ,  S  ( C ,  B ) ) )

Proof of Theorem isoeq4
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f1oeq2 5480 . . 3  |-  ( A  =  C  ->  ( H : A -1-1-onto-> B  <->  H : C -1-1-onto-> B ) )
2 raleq 2749 . . . 4  |-  ( A  =  C  ->  ( A. y  e.  A  ( x R y  <-> 
( H `  x
) S ( H `
 y ) )  <->  A. y  e.  C  ( x R y  <-> 
( H `  x
) S ( H `
 y ) ) ) )
32raleqbi1dv 2757 . . 3  |-  ( A  =  C  ->  ( A. x  e.  A  A. y  e.  A  ( x R y  <-> 
( H `  x
) S ( H `
 y ) )  <->  A. x  e.  C  A. y  e.  C  ( x R y  <-> 
( H `  x
) S ( H `
 y ) ) ) )
41, 3anbi12d 691 . 2  |-  ( A  =  C  ->  (
( H : A -1-1-onto-> B  /\  A. x  e.  A  A. y  e.  A  ( x R y  <-> 
( H `  x
) S ( H `
 y ) ) )  <->  ( H : C
-1-1-onto-> B  /\  A. x  e.  C  A. y  e.  C  ( x R y  <->  ( H `  x ) S ( H `  y ) ) ) ) )
5 df-isom 5280 . 2  |-  ( H 
Isom  R ,  S  ( A ,  B )  <-> 
( H : A -1-1-onto-> B  /\  A. x  e.  A  A. y  e.  A  ( x R y  <-> 
( H `  x
) S ( H `
 y ) ) ) )
6 df-isom 5280 . 2  |-  ( H 
Isom  R ,  S  ( C ,  B )  <-> 
( H : C -1-1-onto-> B  /\  A. x  e.  C  A. y  e.  C  ( x R y  <-> 
( H `  x
) S ( H `
 y ) ) ) )
74, 5, 63bitr4g 279 1  |-  ( A  =  C  ->  ( H  Isom  R ,  S  ( A ,  B )  <-> 
H  Isom  R ,  S  ( C ,  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1632   A.wral 2556   class class class wbr 4039   -1-1-onto->wf1o 5270   ` cfv 5271    Isom wiso 5272
This theorem is referenced by:  oieu  7270  oiid  7272  finnisoeu  7756  iunfictbso  7757  fz1isolem  11415  isercolllem3  12156  summolem2a  12204  erdszelem1  23737  erdsze  23748  erdsze2lem1  23749  erdsze2lem2  23750  prodmolem2a  24157
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ral 2561  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-isom 5280
  Copyright terms: Public domain W3C validator