Theorem resmgmhm2b 18911

Description: Restriction of the codomain of a homomorphism. (Contributed by AV, 26-Feb-2020.)

Hypothesis

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

Assertion

Ref	Expression
resmgmhm2b	⊢ ((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MgmHom 𝑇) ↔ 𝐹 ∈ (𝑆 MgmHom 𝑈)))

Proof of Theorem resmgmhm2b

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

Step	Hyp	Ref	Expression
1		mgmhmrcl 18892	. . . . . 6 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑇) → (𝑆 ∈ Mgm ∧ 𝑇 ∈ Mgm))
2	1	simpld 500	. . . . 5 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑇) → 𝑆 ∈ Mgm)
3	2	adantl 487	. . . 4 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝑆 ∈ Mgm)
4		resmgmhm2.u	. . . . . 6 ⊢ 𝑈 = (𝑇 ↾s 𝑋)
5	4	submgmmgm 18906	. . . . 5 ⊢ (𝑋 ∈ (SubMgm‘𝑇) → 𝑈 ∈ Mgm)
6	5	ad2antrr 739	. . . 4 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝑈 ∈ Mgm)
7	3, 6	jca 521	. . 3 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → (𝑆 ∈ Mgm ∧ 𝑈 ∈ Mgm))
8		eqid 2760	. . . . . . . . 9 ⊢ (Base‘𝑆) = (Base‘𝑆)
9		eqid 2760	. . . . . . . . 9 ⊢ (Base‘𝑇) = (Base‘𝑇)
10	8, 9	mgmhmf 18895	. . . . . . . 8 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
11	10	adantl 487	. . . . . . 7 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
12	11	ffnd 6715	. . . . . 6 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝐹 Fn (Base‘𝑆))
13		simplr 781	. . . . . 6 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → ran 𝐹 ⊆ 𝑋)
14		df-f 6547	. . . . . 6 ⊢ (𝐹:(Base‘𝑆)⟶𝑋 ↔ (𝐹 Fn (Base‘𝑆) ∧ ran 𝐹 ⊆ 𝑋))
15	12, 13, 14	sylanbrc 595	. . . . 5 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝐹:(Base‘𝑆)⟶𝑋)
16	4	submgmbas 18907	. . . . . . 7 ⊢ (𝑋 ∈ (SubMgm‘𝑇) → 𝑋 = (Base‘𝑈))
17	16	ad2antrr 739	. . . . . 6 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝑋 = (Base‘𝑈))
18	17	feq3d 6699	. . . . 5 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → (𝐹:(Base‘𝑆)⟶𝑋 ↔ 𝐹:(Base‘𝑆)⟶(Base‘𝑈)))
19	15, 18	mpbid 235	. . . 4 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑈))
20		eqid 2760	. . . . . . . . 9 ⊢ (+g‘𝑆) = (+g‘𝑆)
21		eqid 2760	. . . . . . . . 9 ⊢ (+g‘𝑇) = (+g‘𝑇)
22	8, 20, 21	mgmhmlin 18897	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑆 MgmHom 𝑇) ∧ 𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆)) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
23	22	3expb 1138	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑆 MgmHom 𝑇) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
24	23	adantll 727	. . . . . 6 ⊢ ((((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)))
25	4, 21	ressplusg 17471	. . . . . . . 8 ⊢ (𝑋 ∈ (SubMgm‘𝑇) → (+g‘𝑇) = (+g‘𝑈))
26	25	ad3antrrr 743	. . . . . . 7 ⊢ ((((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (+g‘𝑇) = (+g‘𝑈))
27	26	oveqd 7441	. . . . . 6 ⊢ ((((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))
28	24, 27	eqtrd 2795	. . . . 5 ⊢ ((((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))
29	28	ralrimivva 3205	. . . 4 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))
30	19, 29	jca 521	. . 3 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → (𝐹:(Base‘𝑆)⟶(Base‘𝑈) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦))))
31		eqid 2760	. . . 4 ⊢ (Base‘𝑈) = (Base‘𝑈)
32		eqid 2760	. . . 4 ⊢ (+g‘𝑈) = (+g‘𝑈)
33	8, 31, 20, 32	ismgmhm 18894	. . 3 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑈) ↔ ((𝑆 ∈ Mgm ∧ 𝑈 ∈ Mgm) ∧ (𝐹:(Base‘𝑆)⟶(Base‘𝑈) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))))
34	7, 30, 33	sylanbrc 595	. 2 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝐹 ∈ (𝑆 MgmHom 𝑈))
35	4	resmgmhm2 18910	. . . 4 ⊢ ((𝐹 ∈ (𝑆 MgmHom 𝑈) ∧ 𝑋 ∈ (SubMgm‘𝑇)) → 𝐹 ∈ (𝑆 MgmHom 𝑇))
36	35	ancoms 464	. . 3 ⊢ ((𝑋 ∈ (SubMgm‘𝑇) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑈)) → 𝐹 ∈ (𝑆 MgmHom 𝑇))
37	36	adantlr 728	. 2 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑈)) → 𝐹 ∈ (𝑆 MgmHom 𝑇))
38	34, 37	impbida 813	1 ⊢ ((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MgmHom 𝑇) ↔ 𝐹 ∈ (𝑆 MgmHom 𝑈)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076   ⊆ wss 3896  ran crn 5652   Fn wfn 6538  ⟶wf 6539  ‘cfv 6543  (class class class)co 7424  Basecbs 17396   ↾_s cress 17417  +_gcplusg 17437  Mgmcmgm 18823   MgmHom cmgmhm 18888  SubMgmcsubmgm 18889

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-cnex 11263  ax-resscn 11264  ax-1cn 11265  ax-icn 11266  ax-addcl 11267  ax-addrcl 11268  ax-mulcl 11269  ax-mulrcl 11270  ax-mulcom 11271  ax-addass 11272  ax-mulass 11273  ax-distr 11274  ax-i2m1 11275  ax-1ne0 11276  ax-1rid 11277  ax-rnegex 11278  ax-rrecex 11279  ax-cnre 11280  ax-pre-lttri 11281  ax-pre-lttrn 11282  ax-pre-ltadd 11283  ax-pre-mulgt0 11284

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-om 7882  df-2nd 8006  df-frecs 8307  df-wrecs 8338  df-recs 8387  df-rdg 8426  df-er 8725  df-map 8857  df-en 8982  df-dom 8983  df-sdom 8984  df-pnf 11352  df-mnf 11353  df-xr 11354  df-ltxr 11355  df-le 11356  df-sub 11550  df-neg 11551  df-nn 12343  df-2 12412  df-sets 17351  df-slot 17369  df-ndx 17381  df-base 17397  df-ress 17418  df-plusg 17450  df-mgm 18825  df-mgmhm 18890  df-submgm 18891

This theorem is used by: (None)