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 18363 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp) | |
2 | 1 | a1i 11 | . 2 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)) |
3 | ghmgrp1 18363 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑈) → 𝑆 ∈ Grp) | |
4 | 3 | a1i 11 | . 2 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑈) → 𝑆 ∈ Grp)) |
5 | subgsubm 18304 | . . . . . 6 ⊢ (𝑋 ∈ (SubGrp‘𝑇) → 𝑋 ∈ (SubMnd‘𝑇)) | |
6 | resghm2.u | . . . . . . 7 ⊢ 𝑈 = (𝑇 ↾s 𝑋) | |
7 | 6 | resmhm2b 17990 | . . . . . 6 ⊢ ((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
8 | 5, 7 | sylan 582 | . . . . 5 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
9 | 8 | adantl 484 | . . . 4 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
10 | subgrcl 18287 | . . . . . . 7 ⊢ (𝑋 ∈ (SubGrp‘𝑇) → 𝑇 ∈ Grp) | |
11 | 10 | adantr 483 | . . . . . 6 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → 𝑇 ∈ Grp) |
12 | ghmmhmb 18372 | . . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) | |
13 | 11, 12 | sylan2 594 | . . . . 5 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) |
14 | 13 | eleq2d 2901 | . . . 4 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑇))) |
15 | 6 | subggrp 18285 | . . . . . . 7 ⊢ (𝑋 ∈ (SubGrp‘𝑇) → 𝑈 ∈ Grp) |
16 | 15 | adantr 483 | . . . . . 6 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → 𝑈 ∈ Grp) |
17 | ghmmhmb 18372 | . . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ 𝑈 ∈ Grp) → (𝑆 GrpHom 𝑈) = (𝑆 MndHom 𝑈)) | |
18 | 16, 17 | sylan2 594 | . . . . 5 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝑆 GrpHom 𝑈) = (𝑆 MndHom 𝑈)) |
19 | 18 | eleq2d 2901 | . . . 4 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 GrpHom 𝑈) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
20 | 9, 14, 19 | 3bitr4d 313 | . . 3 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈))) |
21 | 20 | expcom 416 | . 2 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝑆 ∈ Grp → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈)))) |
22 | 2, 4, 21 | pm5.21ndd 383 | 1 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ⊆ wss 3939 ran crn 5559 ‘cfv 6358 (class class class)co 7159 ↾s cress 16487 MndHom cmhm 17957 SubMndcsubmnd 17958 Grpcgrp 18106 SubGrpcsubg 18276 GrpHom cghm 18358 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-er 8292 df-map 8411 df-en 8513 df-dom 8514 df-sdom 8515 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 df-2 11703 df-ndx 16489 df-slot 16490 df-base 16492 df-sets 16493 df-ress 16494 df-plusg 16581 df-0g 16718 df-mgm 17855 df-sgrp 17904 df-mnd 17915 df-mhm 17959 df-submnd 17960 df-grp 18109 df-minusg 18110 df-subg 18279 df-ghm 18359 |
This theorem is referenced by: ghmghmrn 18380 cayley 18545 pj1ghm2 18833 dpjghm2 19189 reslmhm2b 19829 m2cpmghm 21355 |
Copyright terms: Public domain | W3C validator |