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

Theorem resmhm2 13370
Description: One direction of resmhm2b 13371. (Contributed by Mario Carneiro, 18-Jun-2015.)
Hypothesis
Ref Expression
resmhm2.u 𝑈 = (𝑇s 𝑋)
Assertion
Ref Expression
resmhm2 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → 𝐹 ∈ (𝑆 MndHom 𝑇))

Proof of Theorem resmhm2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mhmrcl1 13345 . . 3 (𝐹 ∈ (𝑆 MndHom 𝑈) → 𝑆 ∈ Mnd)
2 submrcl 13353 . . 3 (𝑋 ∈ (SubMnd‘𝑇) → 𝑇 ∈ Mnd)
31, 2anim12i 338 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → (𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd))
4 eqid 2206 . . . . 5 (Base‘𝑆) = (Base‘𝑆)
5 eqid 2206 . . . . 5 (Base‘𝑈) = (Base‘𝑈)
64, 5mhmf 13347 . . . 4 (𝐹 ∈ (𝑆 MndHom 𝑈) → 𝐹:(Base‘𝑆)⟶(Base‘𝑈))
7 resmhm2.u . . . . . 6 𝑈 = (𝑇s 𝑋)
87submbas 13363 . . . . 5 (𝑋 ∈ (SubMnd‘𝑇) → 𝑋 = (Base‘𝑈))
9 eqid 2206 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
109submss 13358 . . . . 5 (𝑋 ∈ (SubMnd‘𝑇) → 𝑋 ⊆ (Base‘𝑇))
118, 10eqsstrrd 3232 . . . 4 (𝑋 ∈ (SubMnd‘𝑇) → (Base‘𝑈) ⊆ (Base‘𝑇))
12 fss 5444 . . . 4 ((𝐹:(Base‘𝑆)⟶(Base‘𝑈) ∧ (Base‘𝑈) ⊆ (Base‘𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
136, 11, 12syl2an 289 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
14 eqid 2206 . . . . . . . 8 (+g𝑆) = (+g𝑆)
15 eqid 2206 . . . . . . . 8 (+g𝑈) = (+g𝑈)
164, 14, 15mhmlin 13349 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑈)(𝐹𝑦)))
17163expb 1207 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑈)(𝐹𝑦)))
1817adantlr 477 . . . . 5 (((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑈)(𝐹𝑦)))
197a1i 9 . . . . . . . 8 (𝑋 ∈ (SubMnd‘𝑇) → 𝑈 = (𝑇s 𝑋))
20 eqidd 2207 . . . . . . . 8 (𝑋 ∈ (SubMnd‘𝑇) → (+g𝑇) = (+g𝑇))
21 id 19 . . . . . . . 8 (𝑋 ∈ (SubMnd‘𝑇) → 𝑋 ∈ (SubMnd‘𝑇))
2219, 20, 21, 2ressplusgd 13011 . . . . . . 7 (𝑋 ∈ (SubMnd‘𝑇) → (+g𝑇) = (+g𝑈))
2322ad2antlr 489 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (+g𝑇) = (+g𝑈))
2423oveqd 5971 . . . . 5 (((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹𝑥)(+g𝑇)(𝐹𝑦)) = ((𝐹𝑥)(+g𝑈)(𝐹𝑦)))
2518, 24eqtr4d 2242 . . . 4 (((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2625ralrimivva 2589 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
27 eqid 2206 . . . . . 6 (0g𝑆) = (0g𝑆)
28 eqid 2206 . . . . . 6 (0g𝑈) = (0g𝑈)
2927, 28mhm0 13350 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑈) → (𝐹‘(0g𝑆)) = (0g𝑈))
3029adantr 276 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → (𝐹‘(0g𝑆)) = (0g𝑈))
31 eqid 2206 . . . . . 6 (0g𝑇) = (0g𝑇)
327, 31subm0 13364 . . . . 5 (𝑋 ∈ (SubMnd‘𝑇) → (0g𝑇) = (0g𝑈))
3332adantl 277 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → (0g𝑇) = (0g𝑈))
3430, 33eqtr4d 2242 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → (𝐹‘(0g𝑆)) = (0g𝑇))
3513, 26, 343jca 1180 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → (𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)) ∧ (𝐹‘(0g𝑆)) = (0g𝑇)))
36 eqid 2206 . . 3 (+g𝑇) = (+g𝑇)
374, 9, 14, 36, 27, 31ismhm 13343 . 2 (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ ((𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd) ∧ (𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)) ∧ (𝐹‘(0g𝑆)) = (0g𝑇))))
383, 35, 37sylanbrc 417 1 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 981   = wceq 1373  wcel 2177  wral 2485  wss 3168  wf 5273  cfv 5277  (class class class)co 5954  Basecbs 12882  s cress 12883  +gcplusg 12959  0gc0g 13138  Mndcmnd 13298   MndHom cmhm 13339  SubMndcsubmnd 13340
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4167  ax-pow 4223  ax-pr 4258  ax-un 4485  ax-setind 4590  ax-cnex 8029  ax-resscn 8030  ax-1cn 8031  ax-1re 8032  ax-icn 8033  ax-addcl 8034  ax-addrcl 8035  ax-mulcl 8036  ax-addcom 8038  ax-addass 8040  ax-i2m1 8043  ax-0lt1 8044  ax-0id 8046  ax-rnegex 8047  ax-pre-ltirr 8050  ax-pre-ltadd 8054
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-nel 2473  df-ral 2490  df-rex 2491  df-reu 2492  df-rmo 2493  df-rab 2494  df-v 2775  df-sbc 3001  df-csb 3096  df-dif 3170  df-un 3172  df-in 3174  df-ss 3181  df-nul 3463  df-pw 3620  df-sn 3641  df-pr 3642  df-op 3644  df-uni 3854  df-int 3889  df-iun 3932  df-br 4049  df-opab 4111  df-mpt 4112  df-id 4345  df-xp 4686  df-rel 4687  df-cnv 4688  df-co 4689  df-dm 4690  df-rn 4691  df-res 4692  df-ima 4693  df-iota 5238  df-fun 5279  df-fn 5280  df-f 5281  df-fv 5285  df-riota 5909  df-ov 5957  df-oprab 5958  df-mpo 5959  df-1st 6236  df-2nd 6237  df-map 6747  df-pnf 8122  df-mnf 8123  df-ltxr 8125  df-inn 9050  df-2 9108  df-ndx 12885  df-slot 12886  df-base 12888  df-sets 12889  df-iress 12890  df-plusg 12972  df-0g 13140  df-mgm 13238  df-sgrp 13284  df-mnd 13299  df-mhm 13341  df-submnd 13342
This theorem is referenced by:  resmhm2b  13371  resghm2  13647  lgseisenlem4  15600
  Copyright terms: Public domain W3C validator