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

Theorem resmhm2 13854
Description: One direction of resmhm2b 13855. (Contributed by Mario Carneiro, 18-Jun-2015.)
Hypothesis
Ref Expression
resmhm2.u  |-  U  =  ( T ↾s  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 13829 . . 3  |-  ( F  e.  ( S MndHom  U
)  ->  S  e.  Mnd )
2 submrcl 13837 . . 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 2238 . . . . 5  |-  ( Base `  S )  =  (
Base `  S )
5 eqid 2238 . . . . 5  |-  ( Base `  U )  =  (
Base `  U )
64, 5mhmf 13831 . . . 4  |-  ( F  e.  ( S MndHom  U
)  ->  F :
( Base `  S ) --> ( Base `  U )
)
7 resmhm2.u . . . . . 6  |-  U  =  ( T ↾s  X )
87submbas 13847 . . . . 5  |-  ( X  e.  (SubMnd `  T
)  ->  X  =  ( Base `  U )
)
9 eqid 2238 . . . . . 6  |-  ( Base `  T )  =  (
Base `  T )
109submss 13842 . . . . 5  |-  ( X  e.  (SubMnd `  T
)  ->  X  C_  ( Base `  T ) )
118, 10eqsstrrd 3285 . . . 4  |-  ( X  e.  (SubMnd `  T
)  ->  ( Base `  U )  C_  ( Base `  T ) )
12 fss 5549 . . . 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 2238 . . . . . . . 8  |-  ( +g  `  S )  =  ( +g  `  S )
15 eqid 2238 . . . . . . . 8  |-  ( +g  `  U )  =  ( +g  `  U )
164, 14, 15mhmlin 13833 . . . . . . 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 1235 . . . . . 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 481 . . . . 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  =  ( T ↾s  X ) )
20 eqidd 2239 . . . . . . . 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 13542 . . . . . . 7  |-  ( X  e.  (SubMnd `  T
)  ->  ( +g  `  T )  =  ( +g  `  U ) )
2322ad2antlr 493 . . . . . 6  |-  ( ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T
) )  /\  (
x  e.  ( Base `  S )  /\  y  e.  ( Base `  S
) ) )  -> 
( +g  `  T )  =  ( +g  `  U
) )
2423oveqd 6105 . . . . 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 2274 . . . 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 2632 . . 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 2238 . . . . . 6  |-  ( 0g
`  S )  =  ( 0g `  S
)
28 eqid 2238 . . . . . 6  |-  ( 0g
`  U )  =  ( 0g `  U
)
2927, 28mhm0 13834 . . . . 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 2238 . . . . . 6  |-  ( 0g
`  T )  =  ( 0g `  T
)
327, 31subm0 13848 . . . . 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 2274 . . 3  |-  ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T )
)  ->  ( F `  ( 0g `  S
) )  =  ( 0g `  T ) )
3513, 26, 343jca 1208 . 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 2238 . . 3  |-  ( +g  `  T )  =  ( +g  `  T )
374, 9, 14, 36, 27, 31ismhm 13827 . 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 421 1  |-  ( ( F  e.  ( S MndHom  U )  /\  X  e.  (SubMnd `  T )
)  ->  F  e.  ( S MndHom  T ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    /\ w3a 1009    = wceq 1402    e. wcel 2209   A.wral 2528    C_ wss 3220   -->wf 5376   ` cfv 5380  (class class class)co 6088   Basecbs 13410   ↾s cress 13411   +g cplusg 13490   0gc0g 13669   Mndcmnd 13788   MndHom cmhm 13823  SubMndcsubmnd 13824
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-ltadd 8301
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-map 6928  df-pnf 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-ndx 13413  df-slot 13414  df-base 13416  df-sets 13417  df-iress 13418  df-plusg 13503  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-mhm 13825  df-submnd 13826
This theorem is used by:  resmhm2b  13855  resghm2  14123  lgseisenlem4  16397
  Copyright terms: Public domain W3C validator