| 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 2232 | . . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 4 | 1, 2, 3 | quseccl 13950 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → [𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 5 | 4 | 3adant3 1044 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → [𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 6 | 1, 2, 3 | quseccl 13950 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑌 ∈ 𝑉) → [𝑌](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 7 | eqid 2232 | . . . 4 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
| 8 | eqid 2232 | . . . 4 ⊢ (invg‘𝐻) = (invg‘𝐻) | |
| 9 | qussub.a | . . . 4 ⊢ 𝑁 = (-g‘𝐻) | |
| 10 | 3, 7, 8, 9 | grpsubval 13759 | . . 3 ⊢ (([𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻) ∧ [𝑌](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) → ([𝑋](𝐺 ~QG 𝑆)𝑁[𝑌](𝐺 ~QG 𝑆)) = ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)))) |
| 11 | 5, 6, 10 | 3imp3i2an 1210 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)𝑁[𝑌](𝐺 ~QG 𝑆)) = ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)))) |
| 12 | eqid 2232 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 13 | 1, 2, 12, 8 | qusinv 13953 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)) = [((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) |
| 14 | 13 | 3adant2 1043 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)) = [((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) |
| 15 | 14 | oveq2d 6066 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆))) = ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆))) |
| 16 | nsgsubg 13922 | . . . . . . 7 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 17 | subgrcl 13896 | . . . . . . 7 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 18 | 16, 17 | syl 14 | . . . . . 6 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp) |
| 19 | 2, 12 | grpinvcl 13761 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐺)‘𝑌) ∈ 𝑉) |
| 20 | 18, 19 | sylan 283 | . . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐺)‘𝑌) ∈ 𝑉) |
| 21 | 20 | 3adant2 1043 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐺)‘𝑌) ∈ 𝑉) |
| 22 | eqid 2232 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 23 | 1, 2, 22, 7 | qusadd 13951 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ ((invg‘𝐺)‘𝑌) ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) = [(𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))](𝐺 ~QG 𝑆)) |
| 24 | 21, 23 | syld3an3 1319 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) = [(𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))](𝐺 ~QG 𝑆)) |
| 25 | qussub.p | . . . . . 6 ⊢ − = (-g‘𝐺) | |
| 26 | 2, 22, 12, 25 | grpsubval 13759 | . . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 27 | 26 | 3adant1 1042 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 28 | 27 | eceq1d 6803 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → [(𝑋 − 𝑌)](𝐺 ~QG 𝑆) = [(𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))](𝐺 ~QG 𝑆)) |
| 29 | 24, 28 | eqtr4d 2268 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) = [(𝑋 − 𝑌)](𝐺 ~QG 𝑆)) |
| 30 | 11, 15, 29 | 3eqtrd 2269 | 1 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)𝑁[𝑌](𝐺 ~QG 𝑆)) = [(𝑋 − 𝑌)](𝐺 ~QG 𝑆)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1005 = wceq 1398 ∈ wcel 2203 ‘cfv 5352 (class class class)co 6050 [cec 6765 Basecbs 13212 +gcplusg 13290 /s cqus 13513 Grpcgrp 13713 invgcminusg 13714 -gcsg 13715 SubGrpcsubg 13884 NrmSGrpcnsg 13885 ~QG cqg 13886 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-addcom 8227 ax-addass 8229 ax-i2m1 8232 ax-0lt1 8233 ax-0id 8235 ax-rnegex 8236 ax-pre-ltirr 8239 ax-pre-lttrn 8241 ax-pre-ltadd 8243 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-tp 3697 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-id 4414 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-er 6767 df-ec 6769 df-qs 6773 df-pnf 8310 df-mnf 8311 df-ltxr 8313 df-inn 9238 df-2 9296 df-3 9297 df-ndx 13215 df-slot 13216 df-base 13218 df-sets 13219 df-iress 13220 df-plusg 13303 df-mulr 13304 df-0g 13471 df-iimas 13515 df-qus 13516 df-mgm 13569 df-sgrp 13615 df-mnd 13630 df-grp 13716 df-minusg 13717 df-sbg 13718 df-subg 13887 df-nsg 13888 df-eqg 13889 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |