Theorem cntzmhm 19469

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 2762	. . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺)
2		eqid 2762	. . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻)
3	1, 2	mhmf 18898	. . 3 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
4		cntzmhm.z	. . . . 5 ⊢ 𝑍 = (Cntz‘𝐺)
5	1, 4	cntzssv 19456	. . . 4 ⊢ (𝑍‘𝑆) ⊆ (Base‘𝐺)
6	5	sseli 3930	. . 3 ⊢ (𝐴 ∈ (𝑍‘𝑆) → 𝐴 ∈ (Base‘𝐺))
7		ffvelcdm 7077	. . 3 ⊢ ((𝐹:(Base‘𝐺)⟶(Base‘𝐻) ∧ 𝐴 ∈ (Base‘𝐺)) → (𝐹‘𝐴) ∈ (Base‘𝐻))
8	3, 6, 7	syl2an 608	. 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹‘𝐴) ∈ (Base‘𝐻))
9		eqid 2762	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
10	9, 4	cntzi 19457	. . . . . . 7 ⊢ ((𝐴 ∈ (𝑍‘𝑆) ∧ 𝑥 ∈ 𝑆) → (𝐴(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)𝐴))
11	10	adantll 727	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐴(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)𝐴))
12	11	fveq2d 6886	. . . . 5 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = (𝐹‘(𝑥(+g‘𝐺)𝐴)))
13		simpll 779	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐹 ∈ (𝐺 MndHom 𝐻))
14	6	ad2antlr 740	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ (Base‘𝐺))
15	1, 4	cntzrcl 19455	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝑍‘𝑆) → (𝐺 ∈ V ∧ 𝑆 ⊆ (Base‘𝐺)))
16	15	adantl 487	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐺 ∈ V ∧ 𝑆 ⊆ (Base‘𝐺)))
17	16	simprd 501	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝑆 ⊆ (Base‘𝐺))
18	17	sselda 3934	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐺))
19		eqid 2762	. . . . . . 7 ⊢ (+g‘𝐻) = (+g‘𝐻)
20	1, 9, 19	mhmlin 18902	. . . . . 6 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (Base‘𝐺) ∧ 𝑥 ∈ (Base‘𝐺)) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
21	13, 14, 18, 20	syl3anc 1398	. . . . 5 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
22	1, 9, 19	mhmlin 18902	. . . . . 6 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝐴 ∈ (Base‘𝐺)) → (𝐹‘(𝑥(+g‘𝐺)𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
23	13, 18, 14, 22	syl3anc 1398	. . . . 5 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝑥(+g‘𝐺)𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
24	12, 21, 23	3eqtr3d 2805	. . . 4 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
25	24	ralrimiva 3156	. . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ∀𝑥 ∈ 𝑆 ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
26	3	adantr 486	. . . . 5 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
27	26	ffnd 6707	. . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝐹 Fn (Base‘𝐺))
28		oveq2 7424	. . . . . 6 ⊢ (𝑦 = (𝐹‘𝑥) → ((𝐹‘𝐴)(+g‘𝐻)𝑦) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
29		oveq1 7423	. . . . . 6 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑦(+g‘𝐻)(𝐹‘𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
30	28, 29	eqeq12d 2778	. . . . 5 ⊢ (𝑦 = (𝐹‘𝑥) → (((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)) ↔ ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴))))
31	30	ralima 7239	. . . 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 6071	. . . 4 ⊢ (𝐹 “ 𝑆) ⊆ ran 𝐹
35	26	frnd 6715	. . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ran 𝐹 ⊆ (Base‘𝐻))
36	34, 35	sstrid 3945	. . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹 “ 𝑆) ⊆ (Base‘𝐻))
37		cntzmhm.y	. . . 4 ⊢ 𝑌 = (Cntz‘𝐻)
38	2, 19, 37	elcntz 19450	. . 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 1570   ∈ wcel 2145  ∀wral 3078  Vcvv 3453   ⊆ wss 3902  ran crn 5660   “ cima 5662   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7416  Basecbs 17305  +_gcplusg 17346   MndHom cmhm 18890  Cntzccntz 19443

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-map 8831  df-mhm 18892  df-cntz 19445

This theorem is used by:  cntzmhm2  19470