| 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 6017 | . . 3 ⊢ (𝐹 “ 𝑋) ⊆ ran 𝐹 | |
| 2 | eqid 2730 | . . . . . 6 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
| 3 | eqid 2730 | . . . . . 6 ⊢ (Base‘𝑁) = (Base‘𝑁) | |
| 4 | 2, 3 | mhmf 18689 | . . . . 5 ⊢ (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁)) |
| 5 | 4 | adantr 480 | . . . 4 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹:(Base‘𝑀)⟶(Base‘𝑁)) |
| 6 | 5 | frnd 6655 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ran 𝐹 ⊆ (Base‘𝑁)) |
| 7 | 1, 6 | sstrid 3944 | . 2 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹 “ 𝑋) ⊆ (Base‘𝑁)) |
| 8 | eqid 2730 | . . . . 5 ⊢ (0g‘𝑀) = (0g‘𝑀) | |
| 9 | eqid 2730 | . . . . 5 ⊢ (0g‘𝑁) = (0g‘𝑁) | |
| 10 | 8, 9 | mhm0 18694 | . . . 4 ⊢ (𝐹 ∈ (𝑀 MndHom 𝑁) → (𝐹‘(0g‘𝑀)) = (0g‘𝑁)) |
| 11 | 10 | adantr 480 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g‘𝑀)) = (0g‘𝑁)) |
| 12 | 5 | ffnd 6648 | . . . 4 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹 Fn (Base‘𝑀)) |
| 13 | 2 | submss 18709 | . . . . 5 ⊢ (𝑋 ∈ (SubMnd‘𝑀) → 𝑋 ⊆ (Base‘𝑀)) |
| 14 | 13 | adantl 481 | . . . 4 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑋 ⊆ (Base‘𝑀)) |
| 15 | 8 | subm0cl 18711 | . . . . 5 ⊢ (𝑋 ∈ (SubMnd‘𝑀) → (0g‘𝑀) ∈ 𝑋) |
| 16 | 15 | adantl 481 | . . . 4 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (0g‘𝑀) ∈ 𝑋) |
| 17 | fnfvima 7162 | . . . 4 ⊢ ((𝐹 Fn (Base‘𝑀) ∧ 𝑋 ⊆ (Base‘𝑀) ∧ (0g‘𝑀) ∈ 𝑋) → (𝐹‘(0g‘𝑀)) ∈ (𝐹 “ 𝑋)) | |
| 18 | 12, 14, 16, 17 | syl3anc 1373 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹‘(0g‘𝑀)) ∈ (𝐹 “ 𝑋)) |
| 19 | 11, 18 | eqeltrrd 2830 | . 2 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (0g‘𝑁) ∈ (𝐹 “ 𝑋)) |
| 20 | simpl 482 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝐹 ∈ (𝑀 MndHom 𝑁)) | |
| 21 | eqidd 2731 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (+g‘𝑀) = (+g‘𝑀)) | |
| 22 | eqidd 2731 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (+g‘𝑁) = (+g‘𝑁)) | |
| 23 | eqid 2730 | . . . . 5 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
| 24 | 23 | submcl 18712 | . . . 4 ⊢ ((𝑋 ∈ (SubMnd‘𝑀) ∧ 𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑧(+g‘𝑀)𝑥) ∈ 𝑋) |
| 25 | 24 | 3adant1l 1177 | . . 3 ⊢ (((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) ∧ 𝑧 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑧(+g‘𝑀)𝑥) ∈ 𝑋) |
| 26 | 20, 14, 21, 22, 25 | mhmimalem 18724 | . 2 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ∀𝑥 ∈ (𝐹 “ 𝑋)∀𝑦 ∈ (𝐹 “ 𝑋)(𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋)) |
| 27 | mhmrcl2 18688 | . . . 4 ⊢ (𝐹 ∈ (𝑀 MndHom 𝑁) → 𝑁 ∈ Mnd) | |
| 28 | 27 | adantr 480 | . . 3 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → 𝑁 ∈ Mnd) |
| 29 | eqid 2730 | . . . 4 ⊢ (+g‘𝑁) = (+g‘𝑁) | |
| 30 | 3, 9, 29 | issubm 18703 | . . 3 ⊢ (𝑁 ∈ Mnd → ((𝐹 “ 𝑋) ∈ (SubMnd‘𝑁) ↔ ((𝐹 “ 𝑋) ⊆ (Base‘𝑁) ∧ (0g‘𝑁) ∈ (𝐹 “ 𝑋) ∧ ∀𝑥 ∈ (𝐹 “ 𝑋)∀𝑦 ∈ (𝐹 “ 𝑋)(𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋)))) |
| 31 | 28, 30 | syl 17 | . 2 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → ((𝐹 “ 𝑋) ∈ (SubMnd‘𝑁) ↔ ((𝐹 “ 𝑋) ⊆ (Base‘𝑁) ∧ (0g‘𝑁) ∈ (𝐹 “ 𝑋) ∧ ∀𝑥 ∈ (𝐹 “ 𝑋)∀𝑦 ∈ (𝐹 “ 𝑋)(𝑥(+g‘𝑁)𝑦) ∈ (𝐹 “ 𝑋)))) |
| 32 | 7, 19, 26, 31 | mpbir3and 1343 | 1 ⊢ ((𝐹 ∈ (𝑀 MndHom 𝑁) ∧ 𝑋 ∈ (SubMnd‘𝑀)) → (𝐹 “ 𝑋) ∈ (SubMnd‘𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2110 ∀wral 3045 ⊆ wss 3900 ran crn 5615 “ cima 5617 Fn wfn 6472 ⟶wf 6473 ‘cfv 6477 (class class class)co 7341 Basecbs 17112 +gcplusg 17153 0gc0g 17335 Mndcmnd 18634 MndHom cmhm 18681 SubMndcsubmnd 18682 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 ax-cnex 11054 ax-resscn 11055 ax-1cn 11056 ax-icn 11057 ax-addcl 11058 ax-addrcl 11059 ax-mulcl 11060 ax-mulrcl 11061 ax-mulcom 11062 ax-addass 11063 ax-mulass 11064 ax-distr 11065 ax-i2m1 11066 ax-1ne0 11067 ax-1rid 11068 ax-rnegex 11069 ax-rrecex 11070 ax-cnre 11071 ax-pre-lttri 11072 ax-pre-lttrn 11073 ax-pre-ltadd 11074 ax-pre-mulgt0 11075 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3344 df-reu 3345 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6244 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-riota 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-er 8617 df-map 8747 df-en 8865 df-dom 8866 df-sdom 8867 df-pnf 11140 df-mnf 11141 df-xr 11142 df-ltxr 11143 df-le 11144 df-sub 11338 df-neg 11339 df-nn 12118 df-2 12180 df-sets 17067 df-slot 17085 df-ndx 17097 df-base 17113 df-ress 17134 df-plusg 17166 df-0g 17337 df-mgm 18540 df-sgrp 18619 df-mnd 18635 df-mhm 18683 df-submnd 18684 |
| This theorem is referenced by: rhmima 20512 |
| Copyright terms: Public domain | W3C validator |