| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > qusinv | GIF version | ||
| Description: Value of the group inverse operation in a quotient group. (Contributed by Mario Carneiro, 18-Sep-2015.) |
| Ref | Expression |
|---|---|
| qusgrp.h | ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)) |
| qusinv.v | ⊢ 𝑉 = (Base‘𝐺) |
| qusinv.i | ⊢ 𝐼 = (invg‘𝐺) |
| qusinv.n | ⊢ 𝑁 = (invg‘𝐻) |
| Ref | Expression |
|---|---|
| qusinv | ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → (𝑁‘[𝑋](𝐺 ~QG 𝑆)) = [(𝐼‘𝑋)](𝐺 ~QG 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nsgsubg 13791 | . . . . . 6 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 2 | subgrcl 13765 | . . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 3 | 1, 2 | syl 14 | . . . . 5 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp) |
| 4 | qusinv.v | . . . . . 6 ⊢ 𝑉 = (Base‘𝐺) | |
| 5 | qusinv.i | . . . . . 6 ⊢ 𝐼 = (invg‘𝐺) | |
| 6 | 4, 5 | grpinvcl 13630 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝑉) → (𝐼‘𝑋) ∈ 𝑉) |
| 7 | 3, 6 | sylan 283 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → (𝐼‘𝑋) ∈ 𝑉) |
| 8 | qusgrp.h | . . . . 5 ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)) | |
| 9 | eqid 2231 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 10 | eqid 2231 | . . . . 5 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
| 11 | 8, 4, 9, 10 | qusadd 13820 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ (𝐼‘𝑋) ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[(𝐼‘𝑋)](𝐺 ~QG 𝑆)) = [(𝑋(+g‘𝐺)(𝐼‘𝑋))](𝐺 ~QG 𝑆)) |
| 12 | 7, 11 | mpd3an3 1374 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[(𝐼‘𝑋)](𝐺 ~QG 𝑆)) = [(𝑋(+g‘𝐺)(𝐼‘𝑋))](𝐺 ~QG 𝑆)) |
| 13 | eqid 2231 | . . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 14 | 4, 9, 13, 5 | grprinv 13633 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝑉) → (𝑋(+g‘𝐺)(𝐼‘𝑋)) = (0g‘𝐺)) |
| 15 | 3, 14 | sylan 283 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → (𝑋(+g‘𝐺)(𝐼‘𝑋)) = (0g‘𝐺)) |
| 16 | 15 | eceq1d 6737 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → [(𝑋(+g‘𝐺)(𝐼‘𝑋))](𝐺 ~QG 𝑆) = [(0g‘𝐺)](𝐺 ~QG 𝑆)) |
| 17 | 8, 13 | qus0 13821 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → [(0g‘𝐺)](𝐺 ~QG 𝑆) = (0g‘𝐻)) |
| 18 | 17 | adantr 276 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → [(0g‘𝐺)](𝐺 ~QG 𝑆) = (0g‘𝐻)) |
| 19 | 12, 16, 18 | 3eqtrd 2268 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[(𝐼‘𝑋)](𝐺 ~QG 𝑆)) = (0g‘𝐻)) |
| 20 | 8 | qusgrp 13818 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp) |
| 21 | 20 | adantr 276 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → 𝐻 ∈ Grp) |
| 22 | eqid 2231 | . . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 23 | 8, 4, 22 | quseccl 13819 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → [𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 24 | 8, 4, 22 | quseccl 13819 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝐼‘𝑋) ∈ 𝑉) → [(𝐼‘𝑋)](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 25 | 7, 24 | syldan 282 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → [(𝐼‘𝑋)](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 26 | eqid 2231 | . . . 4 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
| 27 | qusinv.n | . . . 4 ⊢ 𝑁 = (invg‘𝐻) | |
| 28 | 22, 10, 26, 27 | grpinvid1 13634 | . . 3 ⊢ ((𝐻 ∈ Grp ∧ [𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻) ∧ [(𝐼‘𝑋)](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) → ((𝑁‘[𝑋](𝐺 ~QG 𝑆)) = [(𝐼‘𝑋)](𝐺 ~QG 𝑆) ↔ ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[(𝐼‘𝑋)](𝐺 ~QG 𝑆)) = (0g‘𝐻))) |
| 29 | 21, 23, 25, 28 | syl3anc 1273 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → ((𝑁‘[𝑋](𝐺 ~QG 𝑆)) = [(𝐼‘𝑋)](𝐺 ~QG 𝑆) ↔ ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[(𝐼‘𝑋)](𝐺 ~QG 𝑆)) = (0g‘𝐻))) |
| 30 | 19, 29 | mpbird 167 | 1 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → (𝑁‘[𝑋](𝐺 ~QG 𝑆)) = [(𝐼‘𝑋)](𝐺 ~QG 𝑆)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2202 ‘cfv 5326 (class class class)co 6017 [cec 6699 Basecbs 13081 +gcplusg 13159 0gc0g 13338 /s cqus 13382 Grpcgrp 13582 invgcminusg 13583 SubGrpcsubg 13753 NrmSGrpcnsg 13754 ~QG cqg 13755 |
| 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 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-pre-ltirr 8143 ax-pre-lttrn 8145 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 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-tp 3677 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 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-er 6701 df-ec 6703 df-qs 6707 df-pnf 8215 df-mnf 8216 df-ltxr 8218 df-inn 9143 df-2 9201 df-3 9202 df-ndx 13084 df-slot 13085 df-base 13087 df-sets 13088 df-iress 13089 df-plusg 13172 df-mulr 13173 df-0g 13340 df-iimas 13384 df-qus 13385 df-mgm 13438 df-sgrp 13484 df-mnd 13499 df-grp 13585 df-minusg 13586 df-subg 13756 df-nsg 13757 df-eqg 13758 |
| This theorem is referenced by: qussub 13823 |
| Copyright terms: Public domain | W3C validator |