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

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

Proof of Theorem isoeq1
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f1oeq1 5324 . . 3  |-  ( H  =  G  ->  ( H : A -1-1-onto-> B  <->  G : A -1-1-onto-> B ) )
2 fveq1 5386 . . . . . 6  |-  ( H  =  G  ->  ( H `  x )  =  ( G `  x ) )
3 fveq1 5386 . . . . . 6  |-  ( H  =  G  ->  ( H `  y )  =  ( G `  y ) )
42, 3breq12d 3910 . . . . 5  |-  ( H  =  G  ->  (
( H `  x
) S ( H `
 y )  <->  ( G `  x ) S ( G `  y ) ) )
54bibi2d 231 . . . 4  |-  ( H  =  G  ->  (
( x R y  <-> 
( H `  x
) S ( H `
 y ) )  <-> 
( x R y  <-> 
( G `  x
) S ( G `
 y ) ) ) )
652ralbidv 2434 . . 3  |-  ( H  =  G  ->  ( A. x  e.  A  A. y  e.  A  ( x R y  <-> 
( H `  x
) S ( H `
 y ) )  <->  A. x  e.  A  A. y  e.  A  ( x R y  <-> 
( G `  x
) S ( G `
 y ) ) ) )
71, 6anbi12d 462 . 2  |-  ( H  =  G  ->  (
( H : A -1-1-onto-> B  /\  A. x  e.  A  A. y  e.  A  ( x R y  <-> 
( H `  x
) S ( H `
 y ) ) )  <->  ( G : A
-1-1-onto-> B  /\  A. x  e.  A  A. y  e.  A  ( x R y  <->  ( G `  x ) S ( G `  y ) ) ) ) )
8 df-isom 5100 . 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 ) ) ) )
9 df-isom 5100 . 2  |-  ( G 
Isom  R ,  S  ( A ,  B )  <-> 
( G : A -1-1-onto-> B  /\  A. x  e.  A  A. y  e.  A  ( x R y  <-> 
( G `  x
) S ( G `
 y ) ) ) )
107, 8, 93bitr4g 222 1  |-  ( H  =  G  ->  ( H  Isom  R ,  S  ( A ,  B )  <-> 
G  Isom  R ,  S  ( A ,  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1314   A.wral 2391   class class class wbr 3897   -1-1-onto->wf1o 5090   ` cfv 5091    Isom wiso 5092
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 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097
This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-nf 1420  df-sb 1719  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-ral 2396  df-rex 2397  df-v 2660  df-un 3043  df-in 3045  df-ss 3052  df-sn 3501  df-pr 3502  df-op 3504  df-uni 3705  df-br 3898  df-opab 3958  df-rel 4514  df-cnv 4515  df-co 4516  df-dm 4517  df-rn 4518  df-iota 5056  df-fun 5093  df-fn 5094  df-f 5095  df-f1 5096  df-fo 5097  df-f1o 5098  df-fv 5099  df-isom 5100
This theorem is referenced by:  isores1  5681  ordiso  6887  infrenegsupex  9338  zfz1isolem1  10523  zfz1iso  10524  infxrnegsupex  10972
  Copyright terms: Public domain W3C validator