Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > resghm2b | Structured version Visualization version GIF version |
Description: Restriction of the codomain of a homomorphism. (Contributed by Mario Carneiro, 13-Jan-2015.) (Revised by Mario Carneiro, 18-Jun-2015.) |
Ref | Expression |
---|---|
resghm2.u | ⊢ 𝑈 = (𝑇 ↾s 𝑋) |
Ref | Expression |
---|---|
resghm2b | ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ghmgrp1 18648 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp) | |
2 | 1 | a1i 11 | . 2 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)) |
3 | ghmgrp1 18648 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑈) → 𝑆 ∈ Grp) | |
4 | 3 | a1i 11 | . 2 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑈) → 𝑆 ∈ Grp)) |
5 | subgsubm 18589 | . . . . . 6 ⊢ (𝑋 ∈ (SubGrp‘𝑇) → 𝑋 ∈ (SubMnd‘𝑇)) | |
6 | resghm2.u | . . . . . . 7 ⊢ 𝑈 = (𝑇 ↾s 𝑋) | |
7 | 6 | resmhm2b 18273 | . . . . . 6 ⊢ ((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
8 | 5, 7 | sylan 583 | . . . . 5 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
9 | 8 | adantl 485 | . . . 4 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
10 | subgrcl 18572 | . . . . . . 7 ⊢ (𝑋 ∈ (SubGrp‘𝑇) → 𝑇 ∈ Grp) | |
11 | 10 | adantr 484 | . . . . . 6 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → 𝑇 ∈ Grp) |
12 | ghmmhmb 18657 | . . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) | |
13 | 11, 12 | sylan2 596 | . . . . 5 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) |
14 | 13 | eleq2d 2824 | . . . 4 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑇))) |
15 | 6 | subggrp 18570 | . . . . . . 7 ⊢ (𝑋 ∈ (SubGrp‘𝑇) → 𝑈 ∈ Grp) |
16 | 15 | adantr 484 | . . . . . 6 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → 𝑈 ∈ Grp) |
17 | ghmmhmb 18657 | . . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ 𝑈 ∈ Grp) → (𝑆 GrpHom 𝑈) = (𝑆 MndHom 𝑈)) | |
18 | 16, 17 | sylan2 596 | . . . . 5 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝑆 GrpHom 𝑈) = (𝑆 MndHom 𝑈)) |
19 | 18 | eleq2d 2824 | . . . 4 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 GrpHom 𝑈) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
20 | 9, 14, 19 | 3bitr4d 314 | . . 3 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈))) |
21 | 20 | expcom 417 | . 2 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝑆 ∈ Grp → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈)))) |
22 | 2, 4, 21 | pm5.21ndd 384 | 1 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1543 ∈ wcel 2111 ⊆ wss 3880 ran crn 5566 ‘cfv 6397 (class class class)co 7231 ↾s cress 16808 MndHom cmhm 18240 SubMndcsubmnd 18241 Grpcgrp 18389 SubGrpcsubg 18561 GrpHom cghm 18643 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2159 ax-12 2176 ax-ext 2709 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5272 ax-pr 5336 ax-un 7541 ax-cnex 10809 ax-resscn 10810 ax-1cn 10811 ax-icn 10812 ax-addcl 10813 ax-addrcl 10814 ax-mulcl 10815 ax-mulrcl 10816 ax-mulcom 10817 ax-addass 10818 ax-mulass 10819 ax-distr 10820 ax-i2m1 10821 ax-1ne0 10822 ax-1rid 10823 ax-rnegex 10824 ax-rrecex 10825 ax-cnre 10826 ax-pre-lttri 10827 ax-pre-lttrn 10828 ax-pre-ltadd 10829 ax-pre-mulgt0 10830 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2072 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3067 df-rex 3068 df-reu 3069 df-rmo 3070 df-rab 3071 df-v 3422 df-sbc 3709 df-csb 3826 df-dif 3883 df-un 3885 df-in 3887 df-ss 3897 df-pss 3899 df-nul 4252 df-if 4454 df-pw 4529 df-sn 4556 df-pr 4558 df-tp 4560 df-op 4562 df-uni 4834 df-iun 4920 df-br 5068 df-opab 5130 df-mpt 5150 df-tr 5176 df-id 5469 df-eprel 5474 df-po 5482 df-so 5483 df-fr 5523 df-we 5525 df-xp 5571 df-rel 5572 df-cnv 5573 df-co 5574 df-dm 5575 df-rn 5576 df-res 5577 df-ima 5578 df-pred 6175 df-ord 6233 df-on 6234 df-lim 6235 df-suc 6236 df-iota 6355 df-fun 6399 df-fn 6400 df-f 6401 df-f1 6402 df-fo 6403 df-f1o 6404 df-fv 6405 df-riota 7188 df-ov 7234 df-oprab 7235 df-mpo 7236 df-om 7663 df-wrecs 8067 df-recs 8128 df-rdg 8166 df-er 8411 df-map 8530 df-en 8647 df-dom 8648 df-sdom 8649 df-pnf 10893 df-mnf 10894 df-xr 10895 df-ltxr 10896 df-le 10897 df-sub 11088 df-neg 11089 df-nn 11855 df-2 11917 df-sets 16741 df-slot 16759 df-ndx 16769 df-base 16785 df-ress 16809 df-plusg 16839 df-0g 16970 df-mgm 18138 df-sgrp 18187 df-mnd 18198 df-mhm 18242 df-submnd 18243 df-grp 18392 df-minusg 18393 df-subg 18564 df-ghm 18644 |
This theorem is referenced by: ghmghmrn 18665 cayley 18830 pj1ghm2 19118 dpjghm2 19475 reslmhm2b 20115 m2cpmghm 21665 |
Copyright terms: Public domain | W3C validator |