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

Theorem mhmima 18463
Description: The homomorphic image of a submonoid is a submonoid. (Contributed by Mario Carneiro, 10-Mar-2015.)
Assertion
Ref Expression
mhmima ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹𝑋) ∈ (SubMnd‘𝑁))

Proof of Theorem mhmima
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 imassrn 5980 . . 3 (𝐹𝑋) ⊆ ran 𝐹
2 eqid 2738 . . . . . 6 (Base‘𝑀) = (Base‘𝑀)
3 eqid 2738 . . . . . 6 (Base‘𝑁) = (Base‘𝑁)
42, 3mhmf 18435 . . . . 5 (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
54adantr 481 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁))
65frnd 6608 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ran 𝐹 ⊆ (Base‘𝑁))
71, 6sstrid 3932 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹𝑋) ⊆ (Base‘𝑁))
8 eqid 2738 . . . . 5 (0g𝑀) = (0g𝑀)
9 eqid 2738 . . . . 5 (0g𝑁) = (0g𝑁)
108, 9mhm0 18438 . . . 4 (𝐹 ∈ (𝑀 MndHom 𝑁) → (𝐹‘(0g𝑀)) = (0g𝑁))
1110adantr 481 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g𝑀)) = (0g𝑁))
125ffnd 6601 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹 Fn (Base‘𝑀))
132submss 18448 . . . . 5 (𝑋 ∈ (SubMnd‘𝑀) → 𝑋 ⊆ (Base‘𝑀))
1413adantl 482 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑋 ⊆ (Base‘𝑀))
158subm0cl 18450 . . . . 5 (𝑋 ∈ (SubMnd‘𝑀) → (0g𝑀) ∈ 𝑋)
1615adantl 482 . . . 4 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (0g𝑀) ∈ 𝑋)
17 fnfvima 7109 . . . 4 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀) ∧ (0g𝑀) ∈ 𝑋) → (𝐹‘(0g𝑀)) ∈ (𝐹𝑋))
1812, 14, 16, 17syl3anc 1370 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g𝑀)) ∈ (𝐹𝑋))
1911, 18eqeltrrd 2840 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (0g𝑁) ∈ (𝐹𝑋))
20 simpll 764 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝐹 ∈ (𝑀 MndHom 𝑁))
2114adantr 481 . . . . . . . . . 10 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑋 ⊆ (Base‘𝑀))
22 simprl 768 . . . . . . . . . 10 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑧𝑋)
2321, 22sseldd 3922 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑧 ∈ (Base‘𝑀))
24 simprr 770 . . . . . . . . . 10 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑥𝑋)
2521, 24sseldd 3922 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝑥 ∈ (Base‘𝑀))
26 eqid 2738 . . . . . . . . . 10 (+g𝑀) = (+g𝑀)
27 eqid 2738 . . . . . . . . . 10 (+g𝑁) = (+g𝑁)
282, 26, 27mhmlin 18437 . . . . . . . . 9 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑧 ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝐹‘(𝑧(+g𝑀)𝑥)) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
2920, 23, 25, 28syl3anc 1370 . . . . . . . 8 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝐹‘(𝑧(+g𝑀)𝑥)) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
3012adantr 481 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → 𝐹 Fn (Base‘𝑀))
3126submcl 18451 . . . . . . . . . . 11 ((𝑋 ∈ (SubMnd‘𝑀) ∧ 𝑧𝑋𝑥𝑋) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
32313expb 1119 . . . . . . . . . 10 ((𝑋 ∈ (SubMnd‘𝑀) ∧ (𝑧𝑋𝑥𝑋)) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
3332adantll 711 . . . . . . . . 9 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝑧(+g𝑀)𝑥) ∈ 𝑋)
34 fnfvima 7109 . . . . . . . . 9 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀) ∧ (𝑧(+g𝑀)𝑥) ∈ 𝑋) → (𝐹‘(𝑧(+g𝑀)𝑥)) ∈ (𝐹𝑋))
3530, 21, 33, 34syl3anc 1370 . . . . . . . 8 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → (𝐹‘(𝑧(+g𝑀)𝑥)) ∈ (𝐹𝑋))
3629, 35eqeltrrd 2840 . . . . . . 7 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ (𝑧𝑋𝑥𝑋)) → ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
3736anassrs 468 . . . . . 6 ((((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) ∧ 𝑥𝑋) → ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
3837ralrimiva 3103 . . . . 5 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) → ∀𝑥𝑋 ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋))
39 oveq2 7283 . . . . . . . . 9 (𝑦 = (𝐹𝑥) → ((𝐹𝑧)(+g𝑁)𝑦) = ((𝐹𝑧)(+g𝑁)(𝐹𝑥)))
4039eleq1d 2823 . . . . . . . 8 (𝑦 = (𝐹𝑥) → (((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋)))
4140ralima 7114 . . . . . . 7 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀)) → (∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑥𝑋 ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋)))
4212, 14, 41syl2anc 584 . . . . . 6 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑥𝑋 ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋)))
4342adantr 481 . . . . 5 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) → (∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑥𝑋 ((𝐹𝑧)(+g𝑁)(𝐹𝑥)) ∈ (𝐹𝑋)))
4438, 43mpbird 256 . . . 4 (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧𝑋) → ∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋))
4544ralrimiva 3103 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋))
46 oveq1 7282 . . . . . . 7 (𝑥 = (𝐹𝑧) → (𝑥(+g𝑁)𝑦) = ((𝐹𝑧)(+g𝑁)𝑦))
4746eleq1d 2823 . . . . . 6 (𝑥 = (𝐹𝑧) → ((𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
4847ralbidv 3112 . . . . 5 (𝑥 = (𝐹𝑧) → (∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
4948ralima 7114 . . . 4 ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀)) → (∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
5012, 14, 49syl2anc 584 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋) ↔ ∀𝑧𝑋𝑦 ∈ (𝐹𝑋)((𝐹𝑧)(+g𝑁)𝑦) ∈ (𝐹𝑋)))
5145, 50mpbird 256 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋))
52 mhmrcl2 18434 . . . 4 (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝑁 ∈ Mnd)
5352adantr 481 . . 3 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑁 ∈ Mnd)
543, 9, 27issubm 18442 . . 3 (𝑁 ∈ Mnd → ((𝐹𝑋) ∈ (SubMnd‘𝑁) ↔ ((𝐹𝑋) ⊆ (Base‘𝑁) ∧ (0g𝑁) ∈ (𝐹𝑋) ∧ ∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋))))
5553, 54syl 17 . 2 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ((𝐹𝑋) ∈ (SubMnd‘𝑁) ↔ ((𝐹𝑋) ⊆ (Base‘𝑁) ∧ (0g𝑁) ∈ (𝐹𝑋) ∧ ∀𝑥 ∈ (𝐹𝑋)∀𝑦 ∈ (𝐹𝑋)(𝑥(+g𝑁)𝑦) ∈ (𝐹𝑋))))
567, 19, 51, 55mpbir3and 1341 1 ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹𝑋) ∈ (SubMnd‘𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086   = wceq 1539  wcel 2106  wral 3064  wss 3887  ran crn 5590  cima 5592   Fn wfn 6428  wf 6429  cfv 6433  (class class class)co 7275  Basecbs 16912  +gcplusg 16962  0gc0g 17150  Mndcmnd 18385   MndHom cmhm 18428  SubMndcsubmnd 18429
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-er 8498  df-map 8617  df-en 8734  df-dom 8735  df-sdom 8736  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-nn 11974  df-2 12036  df-sets 16865  df-slot 16883  df-ndx 16895  df-base 16913  df-ress 16942  df-plusg 16975  df-0g 17152  df-mgm 18326  df-sgrp 18375  df-mnd 18386  df-mhm 18430  df-submnd 18431
This theorem is referenced by:  rhmima  20055
  Copyright terms: Public domain W3C validator