| 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 6083 |
. . . . . 6
| |
| 2 | 1 | adantl 277 |
. . . . 5
|
| 3 | grplcan.b |
. . . . . . . . . . 11
| |
| 4 | grplcan.p |
. . . . . . . . . . 11
| |
| 5 | eqid 2238 |
. . . . . . . . . . 11
| |
| 6 | eqid 2238 |
. . . . . . . . . . 11
| |
| 7 | 3, 4, 5, 6 | grplinv 13832 |
. . . . . . . . . 10
|
| 8 | 7 | adantlr 481 |
. . . . . . . . 9
|
| 9 | 8 | oveq1d 6090 |
. . . . . . . 8
|
| 10 | 3, 6 | grpinvcl 13830 |
. . . . . . . . . . . 12
|
| 11 | 10 | adantrl 482 |
. . . . . . . . . . 11
|
| 12 | simprr 537 |
. . . . . . . . . . 11
| |
| 13 | simprl 535 |
. . . . . . . . . . 11
| |
| 14 | 11, 12, 13 | 3jca 1208 |
. . . . . . . . . 10
|
| 15 | 3, 4 | grpass 13791 |
. . . . . . . . . 10
|
| 16 | 14, 15 | syldan 282 |
. . . . . . . . 9
|
| 17 | 16 | anassrs 404 |
. . . . . . . 8
|
| 18 | 3, 4, 5 | grplid 13813 |
. . . . . . . . 9
|
| 19 | 18 | adantr 276 |
. . . . . . . 8
|
| 20 | 9, 17, 19 | 3eqtr3d 2279 |
. . . . . . 7
|
| 21 | 20 | adantrl 482 |
. . . . . 6
|
| 22 | 21 | adantr 276 |
. . . . 5
|
| 23 | 7 | adantrl 482 |
. . . . . . . . 9
|
| 24 | 23 | oveq1d 6090 |
. . . . . . . 8
|
| 25 | 10 | adantrl 482 |
. . . . . . . . . 10
|
| 26 | simprr 537 |
. . . . . . . . . 10
| |
| 27 | simprl 535 |
. . . . . . . . . 10
| |
| 28 | 25, 26, 27 | 3jca 1208 |
. . . . . . . . 9
|
| 29 | 3, 4 | grpass 13791 |
. . . . . . . . 9
|
| 30 | 28, 29 | syldan 282 |
. . . . . . . 8
|
| 31 | 3, 4, 5 | grplid 13813 |
. . . . . . . . 9
|
| 32 | 31 | adantrr 483 |
. . . . . . . 8
|
| 33 | 24, 30, 32 | 3eqtr3d 2279 |
. . . . . . 7
|
| 34 | 33 | adantlr 481 |
. . . . . 6
|
| 35 | 34 | adantr 276 |
. . . . 5
|
| 36 | 2, 22, 35 | 3eqtr3d 2279 |
. . . 4
|
| 37 | 36 | exp53 377 |
. . 3
|
| 38 | 37 | 3imp2 1253 |
. 2
|
| 39 | oveq2 6083 |
. 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4241 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-cnex 8260 ax-resscn 8261 ax-1re 8263 ax-addrcl 8266 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-riota 6028 df-ov 6078 df-inn 9284 df-2 9342 df-ndx 13333 df-slot 13334 df-base 13336 df-plusg 13421 df-0g 13589 df-mgm 13653 df-sgrp 13694 df-mnd 13707 df-grp 13785 df-minusg 13786 |
| This theorem is referenced by: grpidrcan 13847 grpinvinv 13849 grplmulf1o 13856 grplactcnv 13884 conjghm 14056 conjnmzb 14060 rnglz 14219 ringcom 14309 ringlz 14321 lmodlcan 14613 lmodfopne 14635 |
| Copyright terms: Public domain | W3C validator |