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

Theorem resmhm2 13576
Description: One direction of resmhm2b 13577. (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 13551 . . 3 (𝐹 ∈ (𝑆 MndHom 𝑈) → 𝑆 ∈ Mnd)
2 submrcl 13559 . . 3 (𝑋 ∈ (SubMnd‘𝑇) → 𝑇 ∈ Mnd)
31, 2anim12i 338 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → (𝑆 ∈ Mnd ∧ 𝑇 ∈ Mnd))
4 eqid 2231 . . . . 5 (Base‘𝑆) = (Base‘𝑆)
5 eqid 2231 . . . . 5 (Base‘𝑈) = (Base‘𝑈)
64, 5mhmf 13553 . . . 4 (𝐹 ∈ (𝑆 MndHom 𝑈) → 𝐹:(Base‘𝑆)⟶(Base‘𝑈))
7 resmhm2.u . . . . . 6 𝑈 = (𝑇s 𝑋)
87submbas 13569 . . . . 5 (𝑋 ∈ (SubMnd‘𝑇) → 𝑋 = (Base‘𝑈))
9 eqid 2231 . . . . . 6 (Base‘𝑇) = (Base‘𝑇)
109submss 13564 . . . . 5 (𝑋 ∈ (SubMnd‘𝑇) → 𝑋 ⊆ (Base‘𝑇))
118, 10eqsstrrd 3264 . . . 4 (𝑋 ∈ (SubMnd‘𝑇) → (Base‘𝑈) ⊆ (Base‘𝑇))
12 fss 5494 . . . 4 ((𝐹:(Base‘𝑆)⟶(Base‘𝑈) ∧ (Base‘𝑈) ⊆ (Base‘𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
136, 11, 12syl2an 289 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
14 eqid 2231 . . . . . . . 8 (+g𝑆) = (+g𝑆)
15 eqid 2231 . . . . . . . 8 (+g𝑈) = (+g𝑈)
164, 14, 15mhmlin 13555 . . . . . . 7 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑈)(𝐹𝑦)))
17163expb 1230 . . . . . 6 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑈)(𝐹𝑦)))
1817adantlr 477 . . . . 5 (((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑈)(𝐹𝑦)))
197a1i 9 . . . . . . . 8 (𝑋 ∈ (SubMnd‘𝑇) → 𝑈 = (𝑇s 𝑋))
20 eqidd 2232 . . . . . . . 8 (𝑋 ∈ (SubMnd‘𝑇) → (+g𝑇) = (+g𝑇))
21 id 19 . . . . . . . 8 (𝑋 ∈ (SubMnd‘𝑇) → 𝑋 ∈ (SubMnd‘𝑇))
2219, 20, 21, 2ressplusgd 13217 . . . . . . 7 (𝑋 ∈ (SubMnd‘𝑇) → (+g𝑇) = (+g𝑈))
2322ad2antlr 489 . . . . . 6 (((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (+g𝑇) = (+g𝑈))
2423oveqd 6035 . . . . 5 (((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹𝑥)(+g𝑇)(𝐹𝑦)) = ((𝐹𝑥)(+g𝑈)(𝐹𝑦)))
2518, 24eqtr4d 2267 . . . 4 (((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
2625ralrimivva 2614 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)))
27 eqid 2231 . . . . . 6 (0g𝑆) = (0g𝑆)
28 eqid 2231 . . . . . 6 (0g𝑈) = (0g𝑈)
2927, 28mhm0 13556 . . . . 5 (𝐹 ∈ (𝑆 MndHom 𝑈) → (𝐹‘(0g𝑆)) = (0g𝑈))
3029adantr 276 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → (𝐹‘(0g𝑆)) = (0g𝑈))
31 eqid 2231 . . . . . 6 (0g𝑇) = (0g𝑇)
327, 31subm0 13570 . . . . 5 (𝑋 ∈ (SubMnd‘𝑇) → (0g𝑇) = (0g𝑈))
3332adantl 277 . . . 4 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → (0g𝑇) = (0g𝑈))
3430, 33eqtr4d 2267 . . 3 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → (𝐹‘(0g𝑆)) = (0g𝑇))
3513, 26, 343jca 1203 . 2 ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → (𝐹:(Base‘𝑆)⟶(Base‘𝑇) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g𝑆)𝑦)) = ((𝐹𝑥)(+g𝑇)(𝐹𝑦)) ∧ (𝐹‘(0g𝑆)) = (0g𝑇)))
36 eqid 2231 . . 3 (+g𝑇) = (+g𝑇)
374, 9, 14, 36, 27, 31ismhm 13549 . 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 1004   = wceq 1397  wcel 2202  wral 2510  wss 3200  wf 5322  cfv 5326  (class class class)co 6018  Basecbs 13087  s cress 13088  +gcplusg 13165  0gc0g 13344  Mndcmnd 13504   MndHom cmhm 13545  SubMndcsubmnd 13546
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-ltadd 8148
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-map 6819  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-ndx 13090  df-slot 13091  df-base 13093  df-sets 13094  df-iress 13095  df-plusg 13178  df-0g 13346  df-mgm 13444  df-sgrp 13490  df-mnd 13505  df-mhm 13547  df-submnd 13548
This theorem is referenced by:  resmhm2b  13577  resghm2  13853  lgseisenlem4  15808
  Copyright terms: Public domain W3C validator