| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mhmima | Structured version Visualization version GIF version | ||
| Description: The homomorphic image of a submonoid is a submonoid. (Contributed by Mario Carneiro, 10-Mar-2015.) (Proof shortened by AV, 8-Mar-2025.) |
| Ref | Expression |
|---|---|
| mhmima | ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹 “ 𝑋) ∈ (SubMnd‘𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imassrn 6030 | . . 3 ⊢ (𝐹 “ 𝑋) ⊆ ran 𝐹 | |
| 2 | eqid 2740 | . . . . . 6 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 3 | eqid 2740 | . . . . . 6 ⊢ (Base‘𝑁) = (Base‘𝑁) | |
| 4 | 2, 3 | mhmf 18755 | . . . . 5 ⊢ (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁)) |
| 5 | 4 | adantr 481 | . . . 4 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁)) |
| 6 | 5 | frnd 6670 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ran 𝐹 ⊆ (Base‘𝑁)) |
| 7 | 1, 6 | sstrid 3933 | . 2 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹 “ 𝑋) ⊆ (Base‘𝑁)) |
| 8 | eqid 2740 | . . . . 5 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 9 | eqid 2740 | . . . . 5 ⊢ (0g‘𝑁) = (0g‘𝑁) | |
| 10 | 8, 9 | mhm0 18760 | . . . 4 ⊢ (𝐹 ∈ (𝑀 MndHom 𝑁) → (𝐹‘(0g‘𝑀)) = (0g‘𝑁)) |
| 11 | 10 | adantr 481 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g‘𝑀)) = (0g‘𝑁)) |
| 12 | 5 | ffnd 6663 | . . . 4 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹 Fn (Base‘𝑀)) |
| 13 | 2 | submss 18775 | . . . . 5 ⊢ (𝑋 ∈ (SubMnd‘𝑀) → 𝑋 ⊆ (Base‘𝑀)) |
| 14 | 13 | adantl 482 | . . . 4 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑋 ⊆ (Base‘𝑀)) |
| 15 | 8 | subm0cl 18777 | . . . . 5 ⊢ (𝑋 ∈ (SubMnd‘𝑀) → (0g‘𝑀) ∈ 𝑋) |
| 16 | 15 | adantl 482 | . . . 4 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (0g‘𝑀) ∈ 𝑋) |
| 17 | fnfvima 7184 | . . . 4 ⊢ ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝑋) → (𝐹‘(0g‘𝑀)) ∈ (𝐹 “ 𝑋)) | |
| 18 | 12, 14, 16, 17 | syl3anc 1379 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g‘𝑀)) ∈ (𝐹 “ 𝑋)) |
| 19 | 11, 18 | eqeltrrd 2841 | . 2 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (0g‘𝑁) ∈ (𝐹 “ 𝑋)) |
| 20 | simpl 483 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹 ∈ (𝑀 MndHom 𝑁)) | |
| 21 | eqidd 2741 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (+g‘𝑀) = (+g‘𝑀)) | |
| 22 | eqidd 2741 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (+g‘𝑁) = (+g‘𝑁)) | |
| 23 | eqid 2740 | . . . . 5 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 24 | 23 | submcl 18778 | . . . 4 ⊢ ((𝑋 ∈ (SubMnd‘𝑀) ∧ 𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑧(+g‘𝑀)𝑥) ∈ 𝑋) |
| 25 | 24 | 3adant1l 1183 | . . 3 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑧(+g‘𝑀)𝑥) ∈ 𝑋) |
| 26 | 20, 14, 21, 22, 25 | mhmimalem 18790 | . 2 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ∀𝑥 ∈ (𝐹 “ 𝑋)∀𝑦 ∈ (𝐹 “ 𝑋)(𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋)) |
| 27 | mhmrcl2 18754 | . . . 4 ⊢ (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝑁 ∈ Mnd) | |
| 28 | 27 | adantr 481 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑁 ∈ Mnd) |
| 29 | eqid 2740 | . . . 4 ⊢ (+g‘𝑁) = (+g‘𝑁) | |
| 30 | 3, 9, 29 | issubm 18769 | . . 3 ⊢ (𝑁 ∈ Mnd → ((𝐹 “ 𝑋) ∈ (SubMnd‘𝑁) ↔ ((𝐹 “ 𝑋) ⊆ (Base‘𝑁) ∧ (0g‘𝑁) ∈ (𝐹 “ 𝑋) ∧ ∀𝑥 ∈ (𝐹 “ 𝑋)∀𝑦 ∈ (𝐹 “ 𝑋)(𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋)))) |
| 31 | 28, 30 | syl 17 | . 2 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ((𝐹 “ 𝑋) ∈ (SubMnd‘𝑁) ↔ ((𝐹 “ 𝑋) ⊆ (Base‘𝑁) ∧ (0g‘𝑁) ∈ (𝐹 “ 𝑋) ∧ ∀𝑥 ∈ (𝐹 “ 𝑋)∀𝑦 ∈ (𝐹 “ 𝑋)(𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋)))) |
| 32 | 7, 19, 26, 31 | mpbir3and 1349 | 1 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹 “ 𝑋) ∈ (SubMnd‘𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ∀wral 3054 ⊆ wss 3890 ran crn 5626 “ cima 5628 Fn wfn 6487 ⟶wf 6488 ‘cfv 6492 (class class class)co 7363 Basecbs 17177 +gcplusg 17218 0gc0g 17400 Mndcmnd 18700 MndHom cmhm 18747 SubMndcsubmnd 18748 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-map 8772 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17178 df-ress 17199 df-plusg 17231 df-0g 17402 df-mgm 18606 df-sgrp 18685 df-mnd 18701 df-mhm 18749 df-submnd 18750 |
| This theorem is referenced by: rhmima 20583 |
| Copyright terms: Public domain | W3C validator |