Theorem cntzmhm 14167

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 2238	. . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺)
2		eqid 2238	. . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻)
3	1, 2	mhmf 13825	. . 3 ⊢ (𝐹 ∈ (𝐺 MndHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
4		cntzmhm.z	. . . . 5 ⊢ 𝑍 = (Cntz‘𝐺)
5	1, 4	cntzssv 14154	. . . 4 ⊢ (𝑍‘𝑆) ⊆ (Base‘𝐺)
6	5	sseli 3244	. . 3 ⊢ (𝐴 ∈ (𝑍‘𝑆) → 𝐴 ∈ (Base‘𝐺))
7		ffvelcdm 5841	. . 3 ⊢ ((𝐹:(Base‘𝐺)⟶(Base‘𝐻) ∧ 𝐴 ∈ (Base‘𝐺)) → (𝐹‘𝐴) ∈ (Base‘𝐻))
8	3, 6, 7	syl2an 289	. 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹‘𝐴) ∈ (Base‘𝐻))
9		eqid 2238	. . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺)
10	9, 4	cntzi 14156	. . . . . . 7 ⊢ ((𝐴 ∈ (𝑍‘𝑆) ∧ 𝑥 ∈ 𝑆) → (𝐴(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)𝐴))
11	10	adantll 480	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐴(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)𝐴))
12	11	fveq2d 5699	. . . . 5 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = (𝐹‘(𝑥(+g‘𝐺)𝐴)))
13		simpll 531	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐹 ∈ (𝐺 MndHom 𝐻))
14	6	ad2antlr 493	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ (Base‘𝐺))
15	1, 4	cntzrcl 14153	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝑍‘𝑆) → (𝐺 ∈ V ∧ 𝑆 ⊆ (Base‘𝐺)))
16	15	adantl 277	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐺 ∈ V ∧ 𝑆 ⊆ (Base‘𝐺)))
17	16	simprd 114	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝑆 ⊆ (Base‘𝐺))
18	17	sselda 3248	. . . . . 6 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐺))
19		eqid 2238	. . . . . . 7 ⊢ (+g‘𝐻) = (+g‘𝐻)
20	1, 9, 19	mhmlin 13827	. . . . . 6 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (Base‘𝐺) ∧ 𝑥 ∈ (Base‘𝐺)) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
21	13, 14, 18, 20	syl3anc 1278	. . . . 5 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
22	1, 9, 19	mhmlin 13827	. . . . . 6 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝐴 ∈ (Base‘𝐺)) → (𝐹‘(𝑥(+g‘𝐺)𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
23	13, 18, 14, 22	syl3anc 1278	. . . . 5 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝑥(+g‘𝐺)𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
24	12, 21, 23	3eqtr3d 2279	. . . 4 ⊢ (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
25	24	ralrimiva 2623	. . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ∀𝑥 ∈ 𝑆 ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
26	3	adantr 276	. . . . 5 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
27	26	ffnd 5534	. . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝐹 Fn (Base‘𝐺))
28		oveq2 6093	. . . . . 6 ⊢ (𝑦 = (𝐹‘𝑥) → ((𝐹‘𝐴)(+g‘𝐻)𝑦) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
29		oveq1 6092	. . . . . 6 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑦(+g‘𝐻)(𝐹‘𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
30	28, 29	eqeq12d 2253	. . . . 5 ⊢ (𝑦 = (𝐹‘𝑥) → (((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)) ↔ ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴))))
31	30	ralima 5961	. . . 4 ⊢ ((𝐹 Fn (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → (∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)) ↔ ∀𝑥 ∈ 𝑆 ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴))))
32	27, 17, 31	syl2anc 415	. . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)) ↔ ∀𝑥 ∈ 𝑆 ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴))))
33	25, 32	mpbird 167	. 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)))
34		imassrn 5137	. . . 4 ⊢ (𝐹 “ 𝑆) ⊆ ran 𝐹
35	26	frnd 5543	. . . 4 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ran 𝐹 ⊆ (Base‘𝐻))
36	34, 35	sstrid 3259	. . 3 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹 “ 𝑆) ⊆ (Base‘𝐻))
37		cntzmhm.y	. . . 4 ⊢ 𝑌 = (Cntz‘𝐻)
38	2, 19, 37	elcntz 14148	. . 3 ⊢ ((𝐹 “ 𝑆) ⊆ (Base‘𝐻) → ((𝐹‘𝐴) ∈ (𝑌‘(𝐹 “ 𝑆)) ↔ ((𝐹‘𝐴) ∈ (Base‘𝐻) ∧ ∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)))))
39	36, 38	syl 14	. 2 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ((𝐹‘𝐴) ∈ (𝑌‘(𝐹 “ 𝑆)) ↔ ((𝐹‘𝐴) ∈ (Base‘𝐻) ∧ ∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)))))
40	8, 33, 39	mpbir2and 957	1 ⊢ ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹‘𝐴) ∈ (𝑌‘(𝐹 “ 𝑆)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   ⊆ wss 3220  ran crn 4775   “ cima 4777   Fn wfn 5372  ⟶wf 5373  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  +_gcplusg 13484   MndHom cmhm 13817  Cntzccntz 14140

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1re 8274  ax-addrcl 8277

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-inn 9308  df-ndx 13407  df-slot 13408  df-base 13410  df-mhm 13819  df-cntz 14142

This theorem is used by:  cntzmhm2  14168