| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > resghm2b | 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 13837 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp) | |
| 2 | 1 | a1i 9 | . 2 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) → 𝑆 ∈ Grp)) |
| 3 | ghmgrp1 13837 | . . 3 ⊢ (𝐹 ∈ (𝑆 GrpHom 𝑈) → 𝑆 ∈ Grp) | |
| 4 | 3 | a1i 9 | . 2 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑈) → 𝑆 ∈ Grp)) |
| 5 | subgsubm 13788 | . . . . . 6 ⊢ (𝑋 ∈ (SubGrp‘𝑇) → 𝑋 ∈ (SubMnd‘𝑇)) | |
| 6 | resghm2.u | . . . . . . 7 ⊢ 𝑈 = (𝑇 ↾s 𝑋) | |
| 7 | 6 | resmhm2b 13577 | . . . . . 6 ⊢ ((𝑋 ∈ (SubMnd‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
| 8 | 5, 7 | sylan 283 | . . . . 5 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
| 9 | 8 | adantl 277 | . . . 4 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 MndHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
| 10 | subgrcl 13771 | . . . . . . 7 ⊢ (𝑋 ∈ (SubGrp‘𝑇) → 𝑇 ∈ Grp) | |
| 11 | 10 | adantr 276 | . . . . . 6 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → 𝑇 ∈ Grp) |
| 12 | ghmmhmb 13846 | . . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ 𝑇 ∈ Grp) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) | |
| 13 | 11, 12 | sylan2 286 | . . . . 5 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝑆 GrpHom 𝑇) = (𝑆 MndHom 𝑇)) |
| 14 | 13 | eleq2d 2301 | . . . 4 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 MndHom 𝑇))) |
| 15 | 6 | subggrp 13769 | . . . . . . 7 ⊢ (𝑋 ∈ (SubGrp‘𝑇) → 𝑈 ∈ Grp) |
| 16 | 15 | adantr 276 | . . . . . 6 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → 𝑈 ∈ Grp) |
| 17 | ghmmhmb 13846 | . . . . . 6 ⊢ ((𝑆 ∈ Grp ∧ 𝑈 ∈ Grp) → (𝑆 GrpHom 𝑈) = (𝑆 MndHom 𝑈)) | |
| 18 | 16, 17 | sylan2 286 | . . . . 5 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝑆 GrpHom 𝑈) = (𝑆 MndHom 𝑈)) |
| 19 | 18 | eleq2d 2301 | . . . 4 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 GrpHom 𝑈) ↔ 𝐹 ∈ (𝑆 MndHom 𝑈))) |
| 20 | 9, 14, 19 | 3bitr4d 220 | . . 3 ⊢ ((𝑆 ∈ Grp ∧ (𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋)) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈))) |
| 21 | 20 | expcom 116 | . 2 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝑆 ∈ Grp → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈)))) |
| 22 | 2, 4, 21 | pm5.21ndd 712 | 1 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2202 ⊆ wss 3200 ran crn 4726 ‘cfv 5326 (class class class)co 6018 ↾s cress 13088 MndHom cmhm 13545 SubMndcsubmnd 13546 Grpcgrp 13588 SubGrpcsubg 13759 GrpHom cghm 13832 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-pre-ltirr 8144 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-map 6819 df-pnf 8216 df-mnf 8217 df-ltxr 8219 df-inn 9144 df-2 9202 df-ndx 13090 df-slot 13091 df-base 13093 df-sets 13094 df-iress 13095 df-plusg 13178 df-0g 13346 df-mgm 13444 df-sgrp 13490 df-mnd 13505 df-mhm 13547 df-submnd 13548 df-grp 13591 df-minusg 13592 df-subg 13762 df-ghm 13833 |
| This theorem is referenced by: ghmghmrn 13855 resrhm2b 14269 |
| Copyright terms: Public domain | W3C validator |