Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isrngohom Unicode version

Theorem isrngohom 26596
Description: The predicate "is a ring homomorphism from  R to  S." (Contributed by Jeff Madsen, 19-Jun-2010.)
Hypotheses
Ref Expression
rnghomval.1  |-  G  =  ( 1st `  R
)
rnghomval.2  |-  H  =  ( 2nd `  R
)
rnghomval.3  |-  X  =  ran  G
rnghomval.4  |-  U  =  (GId `  H )
rnghomval.5  |-  J  =  ( 1st `  S
)
rnghomval.6  |-  K  =  ( 2nd `  S
)
rnghomval.7  |-  Y  =  ran  J
rnghomval.8  |-  V  =  (GId `  K )
Assertion
Ref Expression
isrngohom  |-  ( ( R  e.  RingOps  /\  S  e.  RingOps )  ->  ( F  e.  ( R  RngHom  S )  <->  ( F : X --> Y  /\  ( F `  U )  =  V  /\  A. x  e.  X  A. y  e.  X  ( ( F `  ( x G y ) )  =  ( ( F `
 x ) J ( F `  y
) )  /\  ( F `  ( x H y ) )  =  ( ( F `
 x ) K ( F `  y
) ) ) ) ) )
Distinct variable groups:    x, y, F    y, Y    x, R, y    x, S, y    x, X, y
Allowed substitution hints:    U( x, y)    G( x, y)    H( x, y)    J( x, y)    K( x, y)    V( x, y)    Y( x)

Proof of Theorem isrngohom
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 rnghomval.1 . . . 4  |-  G  =  ( 1st `  R
)
2 rnghomval.2 . . . 4  |-  H  =  ( 2nd `  R
)
3 rnghomval.3 . . . 4  |-  X  =  ran  G
4 rnghomval.4 . . . 4  |-  U  =  (GId `  H )
5 rnghomval.5 . . . 4  |-  J  =  ( 1st `  S
)
6 rnghomval.6 . . . 4  |-  K  =  ( 2nd `  S
)
7 rnghomval.7 . . . 4  |-  Y  =  ran  J
8 rnghomval.8 . . . 4  |-  V  =  (GId `  K )
91, 2, 3, 4, 5, 6, 7, 8rngohomval 26595 . . 3  |-  ( ( R  e.  RingOps  /\  S  e.  RingOps )  ->  ( R  RngHom  S )  =  { f  e.  ( Y  ^m  X )  |  ( ( f `
 U )  =  V  /\  A. x  e.  X  A. y  e.  X  ( (
f `  ( x G y ) )  =  ( ( f `
 x ) J ( f `  y
) )  /\  (
f `  ( x H y ) )  =  ( ( f `
 x ) K ( f `  y
) ) ) ) } )
109eleq2d 2350 . 2  |-  ( ( R  e.  RingOps  /\  S  e.  RingOps )  ->  ( F  e.  ( R  RngHom  S )  <->  F  e.  { f  e.  ( Y  ^m  X )  |  ( ( f `  U )  =  V  /\  A. x  e.  X  A. y  e.  X  ( ( f `
 ( x G y ) )  =  ( ( f `  x ) J ( f `  y ) )  /\  ( f `
 ( x H y ) )  =  ( ( f `  x ) K ( f `  y ) ) ) ) } ) )
11 fvex 5539 . . . . . . . 8  |-  ( 1st `  S )  e.  _V
125, 11eqeltri 2353 . . . . . . 7  |-  J  e. 
_V
1312rnex 4942 . . . . . 6  |-  ran  J  e.  _V
147, 13eqeltri 2353 . . . . 5  |-  Y  e. 
_V
15 fvex 5539 . . . . . . . 8  |-  ( 1st `  R )  e.  _V
161, 15eqeltri 2353 . . . . . . 7  |-  G  e. 
_V
1716rnex 4942 . . . . . 6  |-  ran  G  e.  _V
183, 17eqeltri 2353 . . . . 5  |-  X  e. 
_V
1914, 18elmap 6796 . . . 4  |-  ( F  e.  ( Y  ^m  X )  <->  F : X
--> Y )
2019anbi1i 676 . . 3  |-  ( ( F  e.  ( Y  ^m  X )  /\  ( ( F `  U )  =  V  /\  A. x  e.  X  A. y  e.  X  ( ( F `
 ( x G y ) )  =  ( ( F `  x ) J ( F `  y ) )  /\  ( F `
 ( x H y ) )  =  ( ( F `  x ) K ( F `  y ) ) ) ) )  <-> 
( F : X --> Y  /\  ( ( F `
 U )  =  V  /\  A. x  e.  X  A. y  e.  X  ( ( F `  ( x G y ) )  =  ( ( F `
 x ) J ( F `  y
) )  /\  ( F `  ( x H y ) )  =  ( ( F `
 x ) K ( F `  y
) ) ) ) ) )
21 fveq1 5524 . . . . . 6  |-  ( f  =  F  ->  (
f `  U )  =  ( F `  U ) )
2221eqeq1d 2291 . . . . 5  |-  ( f  =  F  ->  (
( f `  U
)  =  V  <->  ( F `  U )  =  V ) )
23 fveq1 5524 . . . . . . . 8  |-  ( f  =  F  ->  (
f `  ( x G y ) )  =  ( F `  ( x G y ) ) )
24 fveq1 5524 . . . . . . . . 9  |-  ( f  =  F  ->  (
f `  x )  =  ( F `  x ) )
25 fveq1 5524 . . . . . . . . 9  |-  ( f  =  F  ->  (
f `  y )  =  ( F `  y ) )
2624, 25oveq12d 5876 . . . . . . . 8  |-  ( f  =  F  ->  (
( f `  x
) J ( f `
 y ) )  =  ( ( F `
 x ) J ( F `  y
) ) )
2723, 26eqeq12d 2297 . . . . . . 7  |-  ( f  =  F  ->  (
( f `  (
x G y ) )  =  ( ( f `  x ) J ( f `  y ) )  <->  ( F `  ( x G y ) )  =  ( ( F `  x
) J ( F `
 y ) ) ) )
28 fveq1 5524 . . . . . . . 8  |-  ( f  =  F  ->  (
f `  ( x H y ) )  =  ( F `  ( x H y ) ) )
2924, 25oveq12d 5876 . . . . . . . 8  |-  ( f  =  F  ->  (
( f `  x
) K ( f `
 y ) )  =  ( ( F `
 x ) K ( F `  y
) ) )
3028, 29eqeq12d 2297 . . . . . . 7  |-  ( f  =  F  ->  (
( f `  (
x H y ) )  =  ( ( f `  x ) K ( f `  y ) )  <->  ( F `  ( x H y ) )  =  ( ( F `  x
) K ( F `
 y ) ) ) )
3127, 30anbi12d 691 . . . . . 6  |-  ( f  =  F  ->  (
( ( f `  ( x G y ) )  =  ( ( f `  x
) J ( f `
 y ) )  /\  ( f `  ( x H y ) )  =  ( ( f `  x
) K ( f `
 y ) ) )  <->  ( ( F `
 ( x G y ) )  =  ( ( F `  x ) J ( F `  y ) )  /\  ( F `
 ( x H y ) )  =  ( ( F `  x ) K ( F `  y ) ) ) ) )
32312ralbidv 2585 . . . . 5  |-  ( f  =  F  ->  ( A. x  e.  X  A. y  e.  X  ( ( f `  ( x G y ) )  =  ( ( f `  x
) J ( f `
 y ) )  /\  ( f `  ( x H y ) )  =  ( ( f `  x
) K ( f `
 y ) ) )  <->  A. x  e.  X  A. y  e.  X  ( ( F `  ( x G y ) )  =  ( ( F `  x
) J ( F `
 y ) )  /\  ( F `  ( x H y ) )  =  ( ( F `  x
) K ( F `
 y ) ) ) ) )
3322, 32anbi12d 691 . . . 4  |-  ( f  =  F  ->  (
( ( f `  U )  =  V  /\  A. x  e.  X  A. y  e.  X  ( ( f `
 ( x G y ) )  =  ( ( f `  x ) J ( f `  y ) )  /\  ( f `
 ( x H y ) )  =  ( ( f `  x ) K ( f `  y ) ) ) )  <->  ( ( F `  U )  =  V  /\  A. x  e.  X  A. y  e.  X  ( ( F `  ( x G y ) )  =  ( ( F `
 x ) J ( F `  y
) )  /\  ( F `  ( x H y ) )  =  ( ( F `
 x ) K ( F `  y
) ) ) ) ) )
3433elrab 2923 . . 3  |-  ( F  e.  { f  e.  ( Y  ^m  X
)  |  ( ( f `  U )  =  V  /\  A. x  e.  X  A. y  e.  X  (
( f `  (
x G y ) )  =  ( ( f `  x ) J ( f `  y ) )  /\  ( f `  (
x H y ) )  =  ( ( f `  x ) K ( f `  y ) ) ) ) }  <->  ( F  e.  ( Y  ^m  X
)  /\  ( ( F `  U )  =  V  /\  A. x  e.  X  A. y  e.  X  ( ( F `  ( x G y ) )  =  ( ( F `
 x ) J ( F `  y
) )  /\  ( F `  ( x H y ) )  =  ( ( F `
 x ) K ( F `  y
) ) ) ) ) )
35 3anass 938 . . 3  |-  ( ( F : X --> Y  /\  ( F `  U )  =  V  /\  A. x  e.  X  A. y  e.  X  (
( F `  (
x G y ) )  =  ( ( F `  x ) J ( F `  y ) )  /\  ( F `  ( x H y ) )  =  ( ( F `
 x ) K ( F `  y
) ) ) )  <-> 
( F : X --> Y  /\  ( ( F `
 U )  =  V  /\  A. x  e.  X  A. y  e.  X  ( ( F `  ( x G y ) )  =  ( ( F `
 x ) J ( F `  y
) )  /\  ( F `  ( x H y ) )  =  ( ( F `
 x ) K ( F `  y
) ) ) ) ) )
3620, 34, 353bitr4i 268 . 2  |-  ( F  e.  { f  e.  ( Y  ^m  X
)  |  ( ( f `  U )  =  V  /\  A. x  e.  X  A. y  e.  X  (
( f `  (
x G y ) )  =  ( ( f `  x ) J ( f `  y ) )  /\  ( f `  (
x H y ) )  =  ( ( f `  x ) K ( f `  y ) ) ) ) }  <->  ( F : X --> Y  /\  ( F `  U )  =  V  /\  A. x  e.  X  A. y  e.  X  ( ( F `  ( x G y ) )  =  ( ( F `
 x ) J ( F `  y
) )  /\  ( F `  ( x H y ) )  =  ( ( F `
 x ) K ( F `  y
) ) ) ) )
3710, 36syl6bb 252 1  |-  ( ( R  e.  RingOps  /\  S  e.  RingOps )  ->  ( F  e.  ( R  RngHom  S )  <->  ( F : X --> Y  /\  ( F `  U )  =  V  /\  A. x  e.  X  A. y  e.  X  ( ( F `  ( x G y ) )  =  ( ( F `
 x ) J ( F `  y
) )  /\  ( F `  ( x H y ) )  =  ( ( F `
 x ) K ( F `  y
) ) ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934    = wceq 1623    e. wcel 1684   A.wral 2543   {crab 2547   _Vcvv 2788   ran crn 4690   -->wf 5251   ` cfv 5255  (class class class)co 5858   1stc1st 6120   2ndc2nd 6121    ^m cmap 6772  GIdcgi 20854   RingOpscrngo 21042    RngHom crnghom 26591
This theorem is referenced by:  rngohomf  26597  rngohom1  26599  rngohomadd  26600  rngohommul  26601  rngohomco  26605  rngoisocnv  26612
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-map 6774  df-rngohom 26594
  Copyright terms: Public domain W3C validator