MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cntzmhm Structured version   Visualization version   GIF version

Theorem cntzmhm 19608
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.
StepHypRef Expression
1 eqid 2766 . . . 4 (Base‘𝐺) = (Base‘𝐺)
2 eqid 2766 . . . 4 (Base‘𝐻) = (Base‘𝐻)
31, 2mhmf 19036 . . 3 (𝐹 ∈ (𝐺 MndHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
4 cntzmhm.z . . . . 5 𝑍 = (Cntz‘𝐺)
51, 4cntzssv 19595 . . . 4 (𝑍‘𝑆) ⊆ (Base‘𝐺)
65sseli 3908 . . 3 (𝐴 ∈ (𝑍‘𝑆) → 𝐴 ∈ (Base‘𝐺))
7 ffvelcdm 7112 . . 3 ((𝐹:(Base‘𝐺)⟶(Base‘𝐻) ∧ 𝐴 ∈ (Base‘𝐺)) → (𝐹‘𝐴) ∈ (Base‘𝐻))
83, 6, 7syl2an 608 . 2 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹‘𝐴) ∈ (Base‘𝐻))
9 eqid 2766 . . . . . . . 8 (+g‘𝐺) = (+g‘𝐺)
109, 4cntzi 19596 . . . . . . 7 ((𝐴 ∈ (𝑍‘𝑆) ∧ 𝑥 ∈ 𝑆) → (𝐴(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)𝐴))
1110adantll 727 . . . . . 6 (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐴(+g‘𝐺)𝑥) = (𝑥(+g‘𝐺)𝐴))
1211fveq2d 6919 . . . . 5 (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = (𝐹‘(𝑥(+g‘𝐺)𝐴)))
13 simpll 779 . . . . . 6 (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐹 ∈ (𝐺 MndHom 𝐻))
146ad2antlr 740 . . . . . 6 (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ (Base‘𝐺))
151, 4cntzrcl 19594 . . . . . . . . 9 (𝐴 ∈ (𝑍‘𝑆) → (𝐺 ∈ V ∧ 𝑆 ⊆ (Base‘𝐺)))
1615adantl 487 . . . . . . . 8 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐺 ∈ V ∧ 𝑆 ⊆ (Base‘𝐺)))
1716simprd 501 . . . . . . 7 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝑆 ⊆ (Base‘𝐺))
1817sselda 3912 . . . . . 6 (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐺))
19 eqid 2766 . . . . . . 7 (+g‘𝐻) = (+g‘𝐻)
201, 9, 19mhmlin 19040 . . . . . 6 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (Base‘𝐺) ∧ 𝑥 ∈ (Base‘𝐺)) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
2113, 14, 18, 20syl3anc 1401 . . . . 5 (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝐴(+g‘𝐺)𝑥)) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
221, 9, 19mhmlin 19040 . . . . . 6 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑥 ∈ (Base‘𝐺) ∧ 𝐴 ∈ (Base‘𝐺)) → (𝐹‘(𝑥(+g‘𝐺)𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
2313, 18, 14, 22syl3anc 1401 . . . . 5 (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → (𝐹‘(𝑥(+g‘𝐺)𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
2412, 21, 233eqtr3d 2809 . . . 4 (((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) ∧ 𝑥 ∈ 𝑆) → ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
2524ralrimiva 3161 . . 3 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ∀𝑥 ∈ 𝑆 ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
263adantr 486 . . . . 5 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
2726ffnd 6739 . . . 4 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → 𝐹 Fn (Base‘𝐺))
28 oveq2 7458 . . . . . 6 (𝑦 = (𝐹‘𝑥) → ((𝐹‘𝐴)(+g‘𝐻)𝑦) = ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)))
29 oveq1 7457 . . . . . 6 (𝑦 = (𝐹‘𝑥) → (𝑦(+g‘𝐻)(𝐹‘𝐴)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴)))
3028, 29eqeq12d 2782 . . . . 5 (𝑦 = (𝐹‘𝑥) → (((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)) ↔ ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴))))
3130ralima 7273 . . . 4 ((𝐹 Fn (Base‘𝐺) ∧ 𝑆 ⊆ (Base‘𝐺)) → (∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)) ↔ ∀𝑥 ∈ 𝑆 ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴))))
3227, 17, 31syl2anc 596 . . 3 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)) ↔ ∀𝑥 ∈ 𝑆 ((𝐹‘𝐴)(+g‘𝐻)(𝐹‘𝑥)) = ((𝐹‘𝑥)(+g‘𝐻)(𝐹‘𝐴))))
3325, 32mpbird 260 . 2 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)))
34 imassrn 6215 . . . 4 (𝐹 “ 𝑆) ⊆ ran 𝐹
3526frnd 6747 . . . 4 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ran 𝐹 ⊆ (Base‘𝐻))
3634, 35sstrid 3923 . . 3 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹 “ 𝑆) ⊆ (Base‘𝐻))
37 cntzmhm.y . . . 4 𝑌 = (Cntz‘𝐻)
382, 19, 37elcntz 19589 . . 3 ((𝐹 “ 𝑆) ⊆ (Base‘𝐻) → ((𝐹‘𝐴) ∈ (𝑌‘(𝐹 “ 𝑆)) ↔ ((𝐹‘𝐴) ∈ (Base‘𝐻) ∧ ∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)))))
3936, 38syl 18 . 2 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → ((𝐹‘𝐴) ∈ (𝑌‘(𝐹 “ 𝑆)) ↔ ((𝐹‘𝐴) ∈ (Base‘𝐻) ∧ ∀𝑦 ∈ (𝐹 “ 𝑆)((𝐹‘𝐴)(+g‘𝐻)𝑦) = (𝑦(+g‘𝐻)(𝐹‘𝐴)))))
408, 33, 39mpbir2and 726 1 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝐴 ∈ (𝑍‘𝑆)) → (𝐹‘𝐴) ∈ (𝑌‘(𝐹 “ 𝑆)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∀wral 3083  Vcvv 3453   ⊆ wss 3899  ran crn 5658   “ cima 5660   Fn wfn 6560  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450  Basecbs 17433  +gcplusg 17474   MndHom cmhm 19028  Cntzccntz 19582
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ov 7453  df-oprab 7454  df-mpo 7455  df-map 8886  df-mhm 19030  df-cntz 19584
This theorem is used by:  cntzmhm2  19609
  Copyright terms: Public domain W3C validator