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

Theorem resmhm2 13536
Description: One direction of resmhm2b 13537. (Contributed by Mario Carneiro, 18-Jun-2015.)
Hypothesis
Ref Expression
resmhm2.u  |-  U  =  ( Ts  X )
Assertion
Ref Expression
resmhm2  |-  ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T )
)  ->  F  e.  ( S MndHom  T ) )

Proof of Theorem resmhm2
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mhmrcl1 13511 . . 3  |-  ( F  e.  ( S MndHom  U
)  ->  S  e.  Mnd )
2 submrcl 13519 . . 3  |-  ( X  e.  (SubMnd `  T
)  ->  T  e.  Mnd )
31, 2anim12i 338 . 2  |-  ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T )
)  ->  ( S  e.  Mnd  /\  T  e. 
Mnd ) )
4 eqid 2229 . . . . 5  |-  ( Base `  S )  =  (
Base `  S )
5 eqid 2229 . . . . 5  |-  ( Base `  U )  =  (
Base `  U )
64, 5mhmf 13513 . . . 4  |-  ( F  e.  ( S MndHom  U
)  ->  F :
( Base `  S ) --> ( Base `  U )
)
7 resmhm2.u . . . . . 6  |-  U  =  ( Ts  X )
87submbas 13529 . . . . 5  |-  ( X  e.  (SubMnd `  T
)  ->  X  =  ( Base `  U )
)
9 eqid 2229 . . . . . 6  |-  ( Base `  T )  =  (
Base `  T )
109submss 13524 . . . . 5  |-  ( X  e.  (SubMnd `  T
)  ->  X  C_  ( Base `  T ) )
118, 10eqsstrrd 3261 . . . 4  |-  ( X  e.  (SubMnd `  T
)  ->  ( Base `  U )  C_  ( Base `  T ) )
12 fss 5485 . . . 4  |-  ( ( F : ( Base `  S ) --> ( Base `  U )  /\  ( Base `  U )  C_  ( Base `  T )
)  ->  F :
( Base `  S ) --> ( Base `  T )
)
136, 11, 12syl2an 289 . . 3  |-  ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T )
)  ->  F :
( Base `  S ) --> ( Base `  T )
)
14 eqid 2229 . . . . . . . 8  |-  ( +g  `  S )  =  ( +g  `  S )
15 eqid 2229 . . . . . . . 8  |-  ( +g  `  U )  =  ( +g  `  U )
164, 14, 15mhmlin 13515 . . . . . . 7  |-  ( ( F  e.  ( S MndHom  U )  /\  x  e.  ( Base `  S
)  /\  y  e.  ( Base `  S )
)  ->  ( F `  ( x ( +g  `  S ) y ) )  =  ( ( F `  x ) ( +g  `  U
) ( F `  y ) ) )
17163expb 1228 . . . . . 6  |-  ( ( F  e.  ( S MndHom  U )  /\  (
x  e.  ( Base `  S )  /\  y  e.  ( Base `  S
) ) )  -> 
( F `  (
x ( +g  `  S
) y ) )  =  ( ( F `
 x ) ( +g  `  U ) ( F `  y
) ) )
1817adantlr 477 . . . . 5  |-  ( ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T
) )  /\  (
x  e.  ( Base `  S )  /\  y  e.  ( Base `  S
) ) )  -> 
( F `  (
x ( +g  `  S
) y ) )  =  ( ( F `
 x ) ( +g  `  U ) ( F `  y
) ) )
197a1i 9 . . . . . . . 8  |-  ( X  e.  (SubMnd `  T
)  ->  U  =  ( Ts  X ) )
20 eqidd 2230 . . . . . . . 8  |-  ( X  e.  (SubMnd `  T
)  ->  ( +g  `  T )  =  ( +g  `  T ) )
21 id 19 . . . . . . . 8  |-  ( X  e.  (SubMnd `  T
)  ->  X  e.  (SubMnd `  T ) )
2219, 20, 21, 2ressplusgd 13177 . . . . . . 7  |-  ( X  e.  (SubMnd `  T
)  ->  ( +g  `  T )  =  ( +g  `  U ) )
2322ad2antlr 489 . . . . . 6  |-  ( ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T
) )  /\  (
x  e.  ( Base `  S )  /\  y  e.  ( Base `  S
) ) )  -> 
( +g  `  T )  =  ( +g  `  U
) )
2423oveqd 6024 . . . . 5  |-  ( ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T
) )  /\  (
x  e.  ( Base `  S )  /\  y  e.  ( Base `  S
) ) )  -> 
( ( F `  x ) ( +g  `  T ) ( F `
 y ) )  =  ( ( F `
 x ) ( +g  `  U ) ( F `  y
) ) )
2518, 24eqtr4d 2265 . . . 4  |-  ( ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T
) )  /\  (
x  e.  ( Base `  S )  /\  y  e.  ( Base `  S
) ) )  -> 
( F `  (
x ( +g  `  S
) y ) )  =  ( ( F `
 x ) ( +g  `  T ) ( F `  y
) ) )
2625ralrimivva 2612 . . 3  |-  ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T )
)  ->  A. x  e.  ( Base `  S
) A. y  e.  ( Base `  S
) ( F `  ( x ( +g  `  S ) y ) )  =  ( ( F `  x ) ( +g  `  T
) ( F `  y ) ) )
27 eqid 2229 . . . . . 6  |-  ( 0g
`  S )  =  ( 0g `  S
)
28 eqid 2229 . . . . . 6  |-  ( 0g
`  U )  =  ( 0g `  U
)
2927, 28mhm0 13516 . . . . 5  |-  ( F  e.  ( S MndHom  U
)  ->  ( F `  ( 0g `  S
) )  =  ( 0g `  U ) )
3029adantr 276 . . . 4  |-  ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T )
)  ->  ( F `  ( 0g `  S
) )  =  ( 0g `  U ) )
31 eqid 2229 . . . . . 6  |-  ( 0g
`  T )  =  ( 0g `  T
)
327, 31subm0 13530 . . . . 5  |-  ( X  e.  (SubMnd `  T
)  ->  ( 0g `  T )  =  ( 0g `  U ) )
3332adantl 277 . . . 4  |-  ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T )
)  ->  ( 0g `  T )  =  ( 0g `  U ) )
3430, 33eqtr4d 2265 . . 3  |-  ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T )
)  ->  ( F `  ( 0g `  S
) )  =  ( 0g `  T ) )
3513, 26, 343jca 1201 . 2  |-  ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T )
)  ->  ( F : ( Base `  S
) --> ( Base `  T
)  /\  A. x  e.  ( Base `  S
) A. y  e.  ( Base `  S
) ( F `  ( x ( +g  `  S ) y ) )  =  ( ( F `  x ) ( +g  `  T
) ( F `  y ) )  /\  ( F `  ( 0g
`  S ) )  =  ( 0g `  T ) ) )
36 eqid 2229 . . 3  |-  ( +g  `  T )  =  ( +g  `  T )
374, 9, 14, 36, 27, 31ismhm 13509 . 2  |-  ( F  e.  ( S MndHom  T
)  <->  ( ( S  e.  Mnd  /\  T  e.  Mnd )  /\  ( F : ( Base `  S
) --> ( Base `  T
)  /\  A. x  e.  ( Base `  S
) A. y  e.  ( Base `  S
) ( F `  ( x ( +g  `  S ) y ) )  =  ( ( F `  x ) ( +g  `  T
) ( F `  y ) )  /\  ( F `  ( 0g
`  S ) )  =  ( 0g `  T ) ) ) )
383, 35, 37sylanbrc 417 1  |-  ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T )
)  ->  F  e.  ( S MndHom  T ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1002    = wceq 1395    e. wcel 2200   A.wral 2508    C_ wss 3197   -->wf 5314   ` cfv 5318  (class class class)co 6007   Basecbs 13047   ↾s cress 13048   +g cplusg 13125   0gc0g 13304   Mndcmnd 13464   MndHom cmhm 13505  SubMndcsubmnd 13506
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-addcom 8110  ax-addass 8112  ax-i2m1 8115  ax-0lt1 8116  ax-0id 8118  ax-rnegex 8119  ax-pre-ltirr 8122  ax-pre-ltadd 8126
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-map 6805  df-pnf 8194  df-mnf 8195  df-ltxr 8197  df-inn 9122  df-2 9180  df-ndx 13050  df-slot 13051  df-base 13053  df-sets 13054  df-iress 13055  df-plusg 13138  df-0g 13306  df-mgm 13404  df-sgrp 13450  df-mnd 13465  df-mhm 13507  df-submnd 13508
This theorem is referenced by:  resmhm2b  13537  resghm2  13813  lgseisenlem4  15767
  Copyright terms: Public domain W3C validator