| 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 13757 | . . . . . 6 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 2 | subgrcl 13731 | . . . . . 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 13596 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝑉) → (𝐼‘𝑋) ∈ 𝑉) |
| 7 | 3, 6 | sylan 283 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → (𝐼‘𝑋) ∈ 𝑉) |
| 8 | qusgrp.h | . . . . 5 ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)) | |
| 9 | eqid 2229 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 10 | eqid 2229 | . . . . 5 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
| 11 | 8, 4, 9, 10 | qusadd 13786 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ (𝐼‘𝑋) ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[(𝐼‘𝑋)](𝐺 ~QG 𝑆)) = [(𝑋(+g‘𝐺)(𝐼‘𝑋))](𝐺 ~QG 𝑆)) |
| 12 | 7, 11 | mpd3an3 1372 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[(𝐼‘𝑋)](𝐺 ~QG 𝑆)) = [(𝑋(+g‘𝐺)(𝐼‘𝑋))](𝐺 ~QG 𝑆)) |
| 13 | eqid 2229 | . . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 14 | 4, 9, 13, 5 | grprinv 13599 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝑉) → (𝑋(+g‘𝐺)(𝐼‘𝑋)) = (0g‘𝐺)) |
| 15 | 3, 14 | sylan 283 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → (𝑋(+g‘𝐺)(𝐼‘𝑋)) = (0g‘𝐺)) |
| 16 | 15 | eceq1d 6724 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → [(𝑋(+g‘𝐺)(𝐼‘𝑋))](𝐺 ~QG 𝑆) = [(0g‘𝐺)](𝐺 ~QG 𝑆)) |
| 17 | 8, 13 | qus0 13787 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → [(0g‘𝐺)](𝐺 ~QG 𝑆) = (0g‘𝐻)) |
| 18 | 17 | adantr 276 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → [(0g‘𝐺)](𝐺 ~QG 𝑆) = (0g‘𝐻)) |
| 19 | 12, 16, 18 | 3eqtrd 2266 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[(𝐼‘𝑋)](𝐺 ~QG 𝑆)) = (0g‘𝐻)) |
| 20 | 8 | qusgrp 13784 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp) |
| 21 | 20 | adantr 276 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → 𝐻 ∈ Grp) |
| 22 | eqid 2229 | . . . 4 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 23 | 8, 4, 22 | quseccl 13785 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → [𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 24 | 8, 4, 22 | quseccl 13785 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ (𝐼‘𝑋) ∈ 𝑉) → [(𝐼‘𝑋)](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 25 | 7, 24 | syldan 282 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → [(𝐼‘𝑋)](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 26 | eqid 2229 | . . . 4 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
| 27 | qusinv.n | . . . 4 ⊢ 𝑁 = (invg‘𝐻) | |
| 28 | 22, 10, 26, 27 | grpinvid1 13600 | . . 3 ⊢ ((𝐻 ∈ Grp ∧ [𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻) ∧ [(𝐼‘𝑋)](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) → ((𝑁‘[𝑋](𝐺 ~QG 𝑆)) = [(𝐼‘𝑋)](𝐺 ~QG 𝑆) ↔ ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[(𝐼‘𝑋)](𝐺 ~QG 𝑆)) = (0g‘𝐻))) |
| 29 | 21, 23, 25, 28 | syl3anc 1271 | . 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 1395 ∈ wcel 2200 ‘cfv 5318 (class class class)co 6007 [cec 6686 Basecbs 13047 +gcplusg 13125 0gc0g 13304 /s cqus 13348 Grpcgrp 13548 invgcminusg 13549 SubGrpcsubg 13719 NrmSGrpcnsg 13720 ~QG cqg 13721 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-addcom 8110 ax-addass 8112 ax-i2m1 8115 ax-0lt1 8116 ax-0id 8118 ax-rnegex 8119 ax-pre-ltirr 8122 ax-pre-lttrn 8124 ax-pre-ltadd 8126 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-tp 3674 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-er 6688 df-ec 6690 df-qs 6694 df-pnf 8194 df-mnf 8195 df-ltxr 8197 df-inn 9122 df-2 9180 df-3 9181 df-ndx 13050 df-slot 13051 df-base 13053 df-sets 13054 df-iress 13055 df-plusg 13138 df-mulr 13139 df-0g 13306 df-iimas 13350 df-qus 13351 df-mgm 13404 df-sgrp 13450 df-mnd 13465 df-grp 13551 df-minusg 13552 df-subg 13722 df-nsg 13723 df-eqg 13724 |
| This theorem is referenced by: qussub 13789 |
| Copyright terms: Public domain | W3C validator |