Theorem cntzmhm 19555

Description: Centralizers in a monoid are preserved by monoid homomorphisms. (Contributed by Mario Carneiro, 24-Apr-2016.)

Hypotheses

Ref	Expression
cntzmhm.z	⊢ 𝑍 = (Cntz‘𝐺)
cntzmhm.y	⊢ 𝑌 = (Cntz‘𝐻)

Assertion

Ref	Expression
cntzmhm	⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹‘𝐴) ∈ (𝑌‘(𝐹 “ 𝑆)))

Proof of Theorem cntzmhm

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

Step	Hyp	Ref	Expression
1		eqid 2760	. . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺)
2		eqid 2760	. . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻)
3	1, 2	mhmf 18984	. . 3 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
4		cntzmhm.z	. . . . 5 ⊢ 𝑍 = (Cntz‘𝐺)
5	1, 4	cntzssv 19542	. . . 4 ⊢ (𝑍‘𝑆) ⊆ (Base‘𝐺)
6	5	sseli 3904	. . 3 ⊢ (𝐴 ∈ (𝑍‘𝑆) → 𝐴 ∈ (Base‘𝐺))
7		ffvelcdm 7081	. . 3 ⊢ ((𝐹:(Base‘𝐺)⟶(Base‘𝐻) ∧ 𝐴 ∈ (Base‘𝐺)) → (𝐹‘𝐴) ∈ (Base‘𝐻))
8	3, 6, 7	syl2an 608	. 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹‘𝐴) ∈ (Base‘𝐻))
9		eqid 2760	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
10	9, 4	cntzi 19543	. . . . . . 7 ⊢ ((𝐴 ∈ (𝑍‘𝑆) ∧ 𝑥 ∈ 𝑆) → (𝐴(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)𝐴))
11	10	adantll 727	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐴(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)𝐴))
12	11	fveq2d 6889	. . . . 5 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = (𝐹‘(𝑥(+g‘𝐺)𝐴)))
13		simpll 779	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐹 ∈ (𝐺 MndHom 𝐻))
14	6	ad2antlr 740	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ (Base‘𝐺))
15	1, 4	cntzrcl 19541	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝑍‘𝑆) → (𝐺 ∈ V ∧ 𝑆 ⊆ (Base‘𝐺)))
16	15	adantl 487	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐺 ∈ V ∧ 𝑆 ⊆ (Base‘𝐺)))
17	16	simprd 501	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝑆 ⊆ (Base‘𝐺))
18	17	sselda 3908	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐺))
19		eqid 2760	. . . . . . 7 ⊢ (+g‘𝐻) = (+g‘𝐻)
20	1, 9, 19	mhmlin 18988	. . . . . 6 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (Base‘𝐺) ∧ 𝑥 ∈ (Base‘𝐺)) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
21	13, 14, 18, 20	syl3anc 1398	. . . . 5 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
22	1, 9, 19	mhmlin 18988	. . . . . 6 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝐴 ∈ (Base‘𝐺)) → (𝐹‘(𝑥(+g‘𝐺)𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
23	13, 18, 14, 22	syl3anc 1398	. . . . 5 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝑥(+g‘𝐺)𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
24	12, 21, 23	3eqtr3d 2803	. . . 4 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
25	24	ralrimiva 3154	. . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ∀𝑥 ∈ 𝑆 ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
26	3	adantr 486	. . . . 5 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
27	26	ffnd 6710	. . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝐹 Fn (Base‘𝐺))
28		oveq2 7428	. . . . . 6 ⊢ (𝑦 = (𝐹‘𝑥) → ((𝐹‘𝐴)(+g‘𝐻)𝑦) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
29		oveq1 7427	. . . . . 6 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑦(+g‘𝐻)(𝐹‘𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
30	28, 29	eqeq12d 2776	. . . . 5 ⊢ (𝑦 = (𝐹‘𝑥) → (((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)) ↔ ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴))))
31	30	ralima 7243	. . . 4 ⊢ ((𝐹 Fn (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → (∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)) ↔ ∀𝑥 ∈ 𝑆 ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴))))
32	27, 17, 31	syl2anc 596	. . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)) ↔ ∀𝑥 ∈ 𝑆 ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴))))
33	25, 32	mpbird 260	. 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)))
34		imassrn 6197	. . . 4 ⊢ (𝐹 “ 𝑆) ⊆ ran 𝐹
35	26	frnd 6718	. . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ran 𝐹 ⊆ (Base‘𝐻))
36	34, 35	sstrid 3919	. . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹 “ 𝑆) ⊆ (Base‘𝐻))
37		cntzmhm.y	. . . 4 ⊢ 𝑌 = (Cntz‘𝐻)
38	2, 19, 37	elcntz 19536	. . 3 ⊢ ((𝐹 “ 𝑆) ⊆ (Base‘𝐻) → ((𝐹‘𝐴) ∈ (𝑌‘(𝐹 “ 𝑆)) ↔ ((𝐹‘𝐴) ∈ (Base‘𝐻) ∧ ∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)))))
39	36, 38	syl 18	. 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ((𝐹‘𝐴) ∈ (𝑌‘(𝐹 “ 𝑆)) ↔ ((𝐹‘𝐴) ∈ (Base‘𝐻) ∧ ∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)))))
40	8, 33, 39	mpbir2and 726	1 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹‘𝐴) ∈ (𝑌‘(𝐹 “ 𝑆)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  Vcvv 3450   ⊆ wss 3895  ran crn 5651   “ cima 5653   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  +_gcplusg 17428   MndHom cmhm 18976  Cntzccntz 19529

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-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-mhm 18978  df-cntz 19531

This theorem is used by:  cntzmhm2  19556