Theorem resmhm2b 13517

Description: Restriction of the codomain of a homomorphism. (Contributed by Mario Carneiro, 18-Jun-2015.)

Hypothesis

Ref	Expression
resmhm2.u	⊢ 𝑈 = (𝑇 ↾s 𝑋)

Assertion

Ref	Expression
resmhm2b	⊢ ((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈)))

Proof of Theorem resmhm2b

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mhmrcl1 13491	. . . 4 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝑆 ∈ Mnd)
2	1	adantl 277	. . 3 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝑆 ∈ Mnd)
3		resmhm2.u	. . . . 5 ⊢ 𝑈 = (𝑇 ↾s 𝑋)
4	3	submmnd 13508	. . . 4 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → 𝑈 ∈ Mnd)
5	4	ad2antrr 488	. . 3 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝑈 ∈ Mnd)
6		eqid 2229	. . . . . . . . 9 ⊢ (Base‘𝑆) = (Base‘𝑆)
7		eqid 2229	. . . . . . . . 9 ⊢ (Base‘𝑇) = (Base‘𝑇)
8	6, 7	mhmf 13493	. . . . . . . 8 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
9	8	adantl 277	. . . . . . 7 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
10	9	ffnd 5473	. . . . . 6 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝐹 Fn (Base‘𝑆))
11		simplr 528	. . . . . 6 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → ran 𝐹 ⊆ 𝑋)
12		df-f 5321	. . . . . 6 ⊢ (𝐹:(Base‘𝑆)⟶𝑋 ↔ (𝐹 Fn (Base‘𝑆) ∧ ran 𝐹 ⊆ 𝑋))
13	10, 11, 12	sylanbrc 417	. . . . 5 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝐹:(Base‘𝑆)⟶𝑋)
14	3	submbas 13509	. . . . . . 7 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → 𝑋 = (Base‘𝑈))
15	14	ad2antrr 488	. . . . . 6 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝑋 = (Base‘𝑈))
16	15	feq3d 5461	. . . . 5 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → (𝐹:(Base‘𝑆)⟶𝑋 ↔ 𝐹:(Base‘𝑆)⟶(Base‘𝑈)))
17	13, 16	mpbid 147	. . . 4 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑈))
18		eqid 2229	. . . . . . . . 9 ⊢ (+g‘𝑆) = (+g‘𝑆)
19		eqid 2229	. . . . . . . . 9 ⊢ (+g‘𝑇) = (+g‘𝑇)
20	6, 18, 19	mhmlin 13495	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
21	20	3expb 1228	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
22	21	adantll 476	. . . . . 6 ⊢ ((((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
23	3	a1i 9	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → 𝑈 = (𝑇 ↾s 𝑋))
24		eqidd 2230	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → (+g‘𝑇) = (+g‘𝑇))
25		id 19	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → 𝑋 ∈ (SubMnd‘𝑇))
26		submrcl 13499	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → 𝑇 ∈ Mnd)
27	23, 24, 25, 26	ressplusgd 13157	. . . . . . . 8 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → (+g‘𝑇) = (+g‘𝑈))
28	27	ad3antrrr 492	. . . . . . 7 ⊢ ((((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (+g‘𝑇) = (+g‘𝑈))
29	28	oveqd 6017	. . . . . 6 ⊢ ((((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))
30	22, 29	eqtrd 2262	. . . . 5 ⊢ ((((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))
31	30	ralrimivva 2612	. . . 4 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))
32		eqid 2229	. . . . . . 7 ⊢ (0g‘𝑆) = (0g‘𝑆)
33		eqid 2229	. . . . . . 7 ⊢ (0g‘𝑇) = (0g‘𝑇)
34	32, 33	mhm0 13496	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑇) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
35	34	adantl 277	. . . . 5 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(0g‘𝑆)) = (0g‘𝑇))
36	3, 33	subm0 13510	. . . . . 6 ⊢ (𝑋 ∈ (SubMnd‘𝑇) → (0g‘𝑇) = (0g‘𝑈))
37	36	ad2antrr 488	. . . . 5 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → (0g‘𝑇) = (0g‘𝑈))
38	35, 37	eqtrd 2262	. . . 4 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → (𝐹‘(0g‘𝑆)) = (0g‘𝑈))
39	17, 31, 38	3jca 1201	. . 3 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → (𝐹:(Base‘𝑆)⟶(Base‘𝑈) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑈)))
40		eqid 2229	. . . 4 ⊢ (Base‘𝑈) = (Base‘𝑈)
41		eqid 2229	. . . 4 ⊢ (+g‘𝑈) = (+g‘𝑈)
42		eqid 2229	. . . 4 ⊢ (0g‘𝑈) = (0g‘𝑈)
43	6, 40, 18, 41, 32, 42	ismhm 13489	. . 3 ⊢ (𝐹 ∈ (𝑆 MndHom 𝑈) ↔ ((𝑆 ∈ Mnd ∧ 𝑈 ∈ Mnd) ∧ (𝐹:(Base‘𝑆)⟶(Base‘𝑈) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)) ∧ (𝐹‘(0g‘𝑆)) = (0g‘𝑈))))
44	2, 5, 39, 43	syl21anbrc 1206	. 2 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑇)) → 𝐹 ∈ (𝑆 MndHom 𝑈))
45	3	resmhm2 13516	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MndHom 𝑈) ∧ 𝑋 ∈ (SubMnd‘𝑇)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
46	45	ancoms 268	. . 3 ⊢ ((𝑋 ∈ (SubMnd‘𝑇) ∧ 𝐹 ∈ (𝑆 MndHom 𝑈)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
47	46	adantlr 477	. 2 ⊢ (((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MndHom 𝑈)) → 𝐹 ∈ (𝑆 MndHom 𝑇))
48	44, 47	impbida 598	1 ⊢ ((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1002   = wceq 1395   ∈ wcel 2200  ∀wral 2508   ⊆ wss 3197  ran crn 4719   Fn wfn 5312  ⟶wf 5313  ‘cfv 5317  (class class class)co 6000  Basecbs 13027   ↾_s cress 13028  +_gcplusg 13105  0_gc0g 13284  Mndcmnd 13444   MndHom cmhm 13485  SubMndcsubmnd 13486

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 4201  ax-pow 4257  ax-pr 4292  ax-un 4523  ax-setind 4628  ax-cnex 8086  ax-resscn 8087  ax-1cn 8088  ax-1re 8089  ax-icn 8090  ax-addcl 8091  ax-addrcl 8092  ax-mulcl 8093  ax-addcom 8095  ax-addass 8097  ax-i2m1 8100  ax-0lt1 8101  ax-0id 8103  ax-rnegex 8104  ax-pre-ltirr 8107  ax-pre-ltadd 8111

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 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-fv 5325  df-riota 5953  df-ov 6003  df-oprab 6004  df-mpo 6005  df-1st 6284  df-2nd 6285  df-map 6795  df-pnf 8179  df-mnf 8180  df-ltxr 8182  df-inn 9107  df-2 9165  df-ndx 13030  df-slot 13031  df-base 13033  df-sets 13034  df-iress 13035  df-plusg 13118  df-0g 13286  df-mgm 13384  df-sgrp 13430  df-mnd 13445  df-mhm 13487  df-submnd 13488

This theorem is referenced by:  resghm2b  13794  resrhm2b  14207  lgseisenlem4  15746