| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grplcan | Unicode version | ||
| Description: Left cancellation law for groups. (Contributed by NM, 25-Aug-2011.) |
| Ref | Expression |
|---|---|
| grplcan.b |
|
| grplcan.p |
|
| Ref | Expression |
|---|---|
| grplcan |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq2 6025 |
. . . . . 6
| |
| 2 | 1 | adantl 277 |
. . . . 5
|
| 3 | grplcan.b |
. . . . . . . . . . 11
| |
| 4 | grplcan.p |
. . . . . . . . . . 11
| |
| 5 | eqid 2231 |
. . . . . . . . . . 11
| |
| 6 | eqid 2231 |
. . . . . . . . . . 11
| |
| 7 | 3, 4, 5, 6 | grplinv 13632 |
. . . . . . . . . 10
|
| 8 | 7 | adantlr 477 |
. . . . . . . . 9
|
| 9 | 8 | oveq1d 6032 |
. . . . . . . 8
|
| 10 | 3, 6 | grpinvcl 13630 |
. . . . . . . . . . . 12
|
| 11 | 10 | adantrl 478 |
. . . . . . . . . . 11
|
| 12 | simprr 533 |
. . . . . . . . . . 11
| |
| 13 | simprl 531 |
. . . . . . . . . . 11
| |
| 14 | 11, 12, 13 | 3jca 1203 |
. . . . . . . . . 10
|
| 15 | 3, 4 | grpass 13591 |
. . . . . . . . . 10
|
| 16 | 14, 15 | syldan 282 |
. . . . . . . . 9
|
| 17 | 16 | anassrs 400 |
. . . . . . . 8
|
| 18 | 3, 4, 5 | grplid 13613 |
. . . . . . . . 9
|
| 19 | 18 | adantr 276 |
. . . . . . . 8
|
| 20 | 9, 17, 19 | 3eqtr3d 2272 |
. . . . . . 7
|
| 21 | 20 | adantrl 478 |
. . . . . 6
|
| 22 | 21 | adantr 276 |
. . . . 5
|
| 23 | 7 | adantrl 478 |
. . . . . . . . 9
|
| 24 | 23 | oveq1d 6032 |
. . . . . . . 8
|
| 25 | 10 | adantrl 478 |
. . . . . . . . . 10
|
| 26 | simprr 533 |
. . . . . . . . . 10
| |
| 27 | simprl 531 |
. . . . . . . . . 10
| |
| 28 | 25, 26, 27 | 3jca 1203 |
. . . . . . . . 9
|
| 29 | 3, 4 | grpass 13591 |
. . . . . . . . 9
|
| 30 | 28, 29 | syldan 282 |
. . . . . . . 8
|
| 31 | 3, 4, 5 | grplid 13613 |
. . . . . . . . 9
|
| 32 | 31 | adantrr 479 |
. . . . . . . 8
|
| 33 | 24, 30, 32 | 3eqtr3d 2272 |
. . . . . . 7
|
| 34 | 33 | adantlr 477 |
. . . . . 6
|
| 35 | 34 | adantr 276 |
. . . . 5
|
| 36 | 2, 22, 35 | 3eqtr3d 2272 |
. . . 4
|
| 37 | 36 | exp53 377 |
. . 3
|
| 38 | 37 | 3imp2 1248 |
. 2
|
| 39 | oveq2 6025 |
. 2
| |
| 40 | 38, 39 | impbid1 142 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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-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-cnex 8122 ax-resscn 8123 ax-1re 8125 ax-addrcl 8128 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 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-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-un 3204 df-in 3206 df-ss 3213 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 5970 df-ov 6020 df-inn 9143 df-2 9201 df-ndx 13084 df-slot 13085 df-base 13087 df-plusg 13172 df-0g 13340 df-mgm 13438 df-sgrp 13484 df-mnd 13499 df-grp 13585 df-minusg 13586 |
| This theorem is referenced by: grpidrcan 13647 grpinvinv 13649 grplmulf1o 13656 grplactcnv 13684 conjghm 13862 conjnmzb 13866 rnglz 13957 ringcom 14043 ringlz 14055 lmodlcan 14317 lmodfopne 14339 |
| Copyright terms: Public domain | W3C validator |