Theorem resmgmhm2b 18952

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 18933	. . . . . 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 18947	. . . . 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 2763	. . . . . . . . 9 ⊢ (Base‘𝑆) = (Base‘𝑆)
9		eqid 2763	. . . . . . . . 9 ⊢ (Base‘𝑇) = (Base‘𝑇)
10	8, 9	mgmhmf 18936	. . . . . . . 8 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑇) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
11	10	adantl 487	. . . . . . 7 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑇))
12	11	ffnd 6740	. . . . . 6 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝐹 Fn (Base‘𝑆))
13		simplr 781	. . . . . 6 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → ran 𝐹 ⊆ 𝑋)
14		df-f 6570	. . . . . 6 ⊢ (𝐹:(Base‘𝑆)⟶𝑋 ↔ (𝐹 Fn (Base‘𝑆) ∧ ran 𝐹 ⊆ 𝑋))
15	12, 13, 14	sylanbrc 595	. . . . 5 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝐹:(Base‘𝑆)⟶𝑋)
16	4	submgmbas 18948	. . . . . . 7 ⊢ (𝑋 ∈ (SubMgm‘𝑇) → 𝑋 = (Base‘𝑈))
17	16	ad2antrr 739	. . . . . 6 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝑋 = (Base‘𝑈))
18	17	feq3d 6724	. . . . 5 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → (𝐹:(Base‘𝑆)⟶𝑋 ↔ 𝐹:(Base‘𝑆)⟶(Base‘𝑈)))
19	15, 18	mpbid 235	. . . 4 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝐹:(Base‘𝑆)⟶(Base‘𝑈))
20		eqid 2763	. . . . . . . . 9 ⊢ (+g‘𝑆) = (+g‘𝑆)
21		eqid 2763	. . . . . . . . 9 ⊢ (+g‘𝑇) = (+g‘𝑇)
22	8, 20, 21	mgmhmlin 18938	. . . . . . . 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 17508	. . . . . . . 8 ⊢ (𝑋 ∈ (SubMgm‘𝑇) → (+g‘𝑇) = (+g‘𝑈))
26	25	ad3antrrr 743	. . . . . . 7 ⊢ ((((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (+g‘𝑇) = (+g‘𝑈))
27	26	oveqd 7468	. . . . . 6 ⊢ ((((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → ((𝐹‘𝑥)(+g‘𝑇)(𝐹‘𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))
28	24, 27	eqtrd 2798	. . . . 5 ⊢ ((((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) ∧ (𝑥 ∈ (Base‘𝑆) ∧ 𝑦 ∈ (Base‘𝑆))) → (𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))
29	28	ralrimivva 3209	. . . 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 2763	. . . 4 ⊢ (Base‘𝑈) = (Base‘𝑈)
32		eqid 2763	. . . 4 ⊢ (+g‘𝑈) = (+g‘𝑈)
33	8, 31, 20, 32	ismgmhm 18935	. . 3 ⊢ (𝐹 ∈ (𝑆 MgmHom 𝑈) ↔ ((𝑆 ∈ Mgm ∧ 𝑈 ∈ Mgm) ∧ (𝐹:(Base‘𝑆)⟶(Base‘𝑈) ∧ ∀𝑥 ∈ (Base‘𝑆)∀𝑦 ∈ (Base‘𝑆)(𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((𝐹‘𝑥)(+g‘𝑈)(𝐹‘𝑦)))))
34	7, 30, 33	sylanbrc 595	. 2 ⊢ (((𝑋 ∈ (SubMgm‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) ∧ 𝐹 ∈ (𝑆 MgmHom 𝑇)) → 𝐹 ∈ (𝑆 MgmHom 𝑈))
35	4	resmgmhm2 18951	. . . 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 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  ran crn 5659   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  Basecbs 17431   ↾_s cress 17452  +_gcplusg 17472  Mgmcmgm 18864   MgmHom cmgmhm 18929  SubMgmcsubmgm 18930

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-sets 17386  df-slot 17404  df-ndx 17416  df-base 17432  df-ress 17453  df-plusg 17486  df-mgm 18866  df-mgmhm 18931  df-submgm 18932

This theorem is used by: (None)