| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > qussub | GIF version | ||
| Description: Value of the group subtraction operation in a quotient group. (Contributed by Mario Carneiro, 18-Sep-2015.) |
| Ref | Expression |
|---|---|
| qusgrp.h | ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)) |
| qusinv.v | ⊢ 𝑉 = (Base‘𝐺) |
| qussub.p | ⊢ − = (-g‘𝐺) |
| qussub.a | ⊢ 𝑁 = (-g‘𝐻) |
| Ref | Expression |
|---|---|
| qussub | ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)𝑁[𝑌](𝐺 ~QG 𝑆)) = [(𝑋 − 𝑌)](𝐺 ~QG 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qusgrp.h | . . . . 5 ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)) | |
| 2 | qusinv.v | . . . . 5 ⊢ 𝑉 = (Base‘𝐺) | |
| 3 | eqid 2231 | . . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 4 | 1, 2, 3 | quseccl 13838 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → [𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 5 | 4 | 3adant3 1043 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → [𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 6 | 1, 2, 3 | quseccl 13838 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑌 ∈ 𝑉) → [𝑌](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 7 | eqid 2231 | . . . 4 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
| 8 | eqid 2231 | . . . 4 ⊢ (invg‘𝐻) = (invg‘𝐻) | |
| 9 | qussub.a | . . . 4 ⊢ 𝑁 = (-g‘𝐻) | |
| 10 | 3, 7, 8, 9 | grpsubval 13647 | . . 3 ⊢ (([𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻) ∧ [𝑌](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) → ([𝑋](𝐺 ~QG 𝑆)𝑁[𝑌](𝐺 ~QG 𝑆)) = ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)))) |
| 11 | 5, 6, 10 | 3imp3i2an 1209 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)𝑁[𝑌](𝐺 ~QG 𝑆)) = ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)))) |
| 12 | eqid 2231 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 13 | 1, 2, 12, 8 | qusinv 13841 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)) = [((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) |
| 14 | 13 | 3adant2 1042 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)) = [((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) |
| 15 | 14 | oveq2d 6034 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆))) = ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆))) |
| 16 | nsgsubg 13810 | . . . . . . 7 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 17 | subgrcl 13784 | . . . . . . 7 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 18 | 16, 17 | syl 14 | . . . . . 6 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp) |
| 19 | 2, 12 | grpinvcl 13649 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐺)‘𝑌) ∈ 𝑉) |
| 20 | 18, 19 | sylan 283 | . . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐺)‘𝑌) ∈ 𝑉) |
| 21 | 20 | 3adant2 1042 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐺)‘𝑌) ∈ 𝑉) |
| 22 | eqid 2231 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 23 | 1, 2, 22, 7 | qusadd 13839 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ ((invg‘𝐺)‘𝑌) ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) = [(𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))](𝐺 ~QG 𝑆)) |
| 24 | 21, 23 | syld3an3 1318 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) = [(𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))](𝐺 ~QG 𝑆)) |
| 25 | qussub.p | . . . . . 6 ⊢ − = (-g‘𝐺) | |
| 26 | 2, 22, 12, 25 | grpsubval 13647 | . . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 27 | 26 | 3adant1 1041 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 28 | 27 | eceq1d 6738 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → [(𝑋 − 𝑌)](𝐺 ~QG 𝑆) = [(𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))](𝐺 ~QG 𝑆)) |
| 29 | 24, 28 | eqtr4d 2267 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) = [(𝑋 − 𝑌)](𝐺 ~QG 𝑆)) |
| 30 | 11, 15, 29 | 3eqtrd 2268 | 1 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)𝑁[𝑌](𝐺 ~QG 𝑆)) = [(𝑋 − 𝑌)](𝐺 ~QG 𝑆)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 ‘cfv 5326 (class class class)co 6018 [cec 6700 Basecbs 13100 +gcplusg 13178 /s cqus 13401 Grpcgrp 13601 invgcminusg 13602 -gcsg 13603 SubGrpcsubg 13772 NrmSGrpcnsg 13773 ~QG cqg 13774 |
| 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-lttrn 8146 ax-pre-ltadd 8148 |
| 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 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-er 6702 df-ec 6704 df-qs 6708 df-pnf 8216 df-mnf 8217 df-ltxr 8219 df-inn 9144 df-2 9202 df-3 9203 df-ndx 13103 df-slot 13104 df-base 13106 df-sets 13107 df-iress 13108 df-plusg 13191 df-mulr 13192 df-0g 13359 df-iimas 13403 df-qus 13404 df-mgm 13457 df-sgrp 13503 df-mnd 13518 df-grp 13604 df-minusg 13605 df-sbg 13606 df-subg 13775 df-nsg 13776 df-eqg 13777 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |