ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cntzmhm2 GIF version

Theorem cntzmhm2 14174
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
cntzmhm2 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → (𝐹 “ 𝑆) ⊆ (𝑌‘(𝐹 “ 𝑇)))

Proof of Theorem cntzmhm2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 cntzmhm.z . . . . 5 𝑍 = (Cntz‘𝐺)
2 cntzmhm.y . . . . 5 𝑌 = (Cntz‘𝐻)
31, 2cntzmhm 14173 . . . 4 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑥 ∈ (𝑍‘𝑇)) → (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)))
43ralrimiva 2623 . . 3 (𝐹 ∈ (𝐺 MndHom 𝐻) → ∀𝑥 ∈ (𝑍‘𝑇)(𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)))
5 ssralv 3312 . . 3 (𝑆 ⊆ (𝑍‘𝑇) → (∀𝑥 ∈ (𝑍‘𝑇)(𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))))
64, 5mpan9 281 . 2 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇)))
7 eqid 2238 . . . . . 6 (Base‘𝐺) = (Base‘𝐺)
8 eqid 2238 . . . . . 6 (Base‘𝐻) = (Base‘𝐻)
97, 8mhmf 13831 . . . . 5 (𝐹 ∈ (𝐺 MndHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
109adantr 276 . . . 4 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
1110ffund 5540 . . 3 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → Fun 𝐹)
12 simpr 110 . . . . 5 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ (𝑍‘𝑇))
137, 1cntzssv 14160 . . . . 5 (𝑍‘𝑇) ⊆ (Base‘𝐺)
1412, 13sstrdi 3260 . . . 4 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ (Base‘𝐺))
1510fdmd 5543 . . . 4 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → dom 𝐹 = (Base‘𝐺))
1614, 15sseqtrrd 3287 . . 3 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → 𝑆 ⊆ dom 𝐹)
17 funimass4 5756 . . 3 ((Fun 𝐹 ∧ 𝑆 ⊆ dom 𝐹) → ((𝐹 “ 𝑆) ⊆ (𝑌‘(𝐹 “ 𝑇)) ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))))
1811, 16, 17syl2anc 415 . 2 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → ((𝐹 “ 𝑆) ⊆ (𝑌‘(𝐹 “ 𝑇)) ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) ∈ (𝑌‘(𝐹 “ 𝑇))))
196, 18mpbird 167 1 ((𝐹 ∈ (𝐺 MndHom 𝐻) ∧ 𝑆 ⊆ (𝑍‘𝑇)) → (𝐹 “ 𝑆) ⊆ (𝑌‘(𝐹 “ 𝑇)))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528   ⊆ wss 3220  dom cdm 4776   “ cima 4779  Fun wfun 5374  ⟶wf 5376  ‘cfv 5380  (class class class)co 6088  Basecbs 13410   MndHom cmhm 13823  Cntzccntz 14146
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 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1re 8279  ax-addrcl 8282
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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-map 6928  df-inn 9314  df-ndx 13413  df-slot 13414  df-base 13416  df-mhm 13825  df-cntz 14148
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator