| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grprcan | Unicode version | ||
| Description: Right cancellation law for groups. (Contributed by NM, 24-Aug-2011.) (Proof shortened by Mario Carneiro, 6-Jan-2015.) |
| Ref | Expression |
|---|---|
| grprcan.b |
|
| grprcan.p |
|
| Ref | Expression |
|---|---|
| grprcan |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grprcan.b |
. . . . 5
| |
| 2 | grprcan.p |
. . . . 5
| |
| 3 | eqid 2238 |
. . . . 5
| |
| 4 | 1, 2, 3 | grpinvex 13792 |
. . . 4
|
| 5 | 4 | 3ad2antr3 1195 |
. . 3
|
| 6 | simprr 537 |
. . . . . . . 8
| |
| 7 | 6 | oveq1d 6090 |
. . . . . . 7
|
| 8 | simpll 531 |
. . . . . . . . 9
| |
| 9 | 1, 2 | grpass 13791 |
. . . . . . . . 9
|
| 10 | 8, 9 | sylan 283 |
. . . . . . . 8
|
| 11 | simplr1 1070 |
. . . . . . . 8
| |
| 12 | simplr3 1072 |
. . . . . . . 8
| |
| 13 | simprll 543 |
. . . . . . . 8
| |
| 14 | 10, 11, 12, 13 | caovassd 6239 |
. . . . . . 7
|
| 15 | simplr2 1071 |
. . . . . . . 8
| |
| 16 | 10, 15, 12, 13 | caovassd 6239 |
. . . . . . 7
|
| 17 | 7, 14, 16 | 3eqtr3d 2279 |
. . . . . 6
|
| 18 | 1, 2 | grpcl 13790 |
. . . . . . . . . 10
|
| 19 | 8, 18 | syl3an1 1311 |
. . . . . . . . 9
|
| 20 | 1, 3 | grpidcl 13811 |
. . . . . . . . . 10
|
| 21 | 8, 20 | syl 14 |
. . . . . . . . 9
|
| 22 | 1, 2, 3 | grplid 13813 |
. . . . . . . . . 10
|
| 23 | 8, 22 | sylan 283 |
. . . . . . . . 9
|
| 24 | 1, 2, 3 | grpinvex 13792 |
. . . . . . . . . 10
|
| 25 | 8, 24 | sylan 283 |
. . . . . . . . 9
|
| 26 | simpr 110 |
. . . . . . . . 9
| |
| 27 | 13 | adantr 276 |
. . . . . . . . 9
|
| 28 | simprlr 544 |
. . . . . . . . . 10
| |
| 29 | 28 | adantr 276 |
. . . . . . . . 9
|
| 30 | 19, 21, 23, 10, 25, 26, 27, 29 | grpinva 13683 |
. . . . . . . 8
|
| 31 | 12, 30 | mpdan 425 |
. . . . . . 7
|
| 32 | 31 | oveq2d 6091 |
. . . . . 6
|
| 33 | 31 | oveq2d 6091 |
. . . . . 6
|
| 34 | 17, 32, 33 | 3eqtr3d 2279 |
. . . . 5
|
| 35 | 1, 2, 3 | grprid 13814 |
. . . . . 6
|
| 36 | 8, 11, 35 | syl2anc 415 |
. . . . 5
|
| 37 | 1, 2, 3 | grprid 13814 |
. . . . . 6
|
| 38 | 8, 15, 37 | syl2anc 415 |
. . . . 5
|
| 39 | 34, 36, 38 | 3eqtr3d 2279 |
. . . 4
|
| 40 | 39 | expr 375 |
. . 3
|
| 41 | 5, 40 | rexlimddv 2673 |
. 2
|
| 42 | oveq1 6082 |
. 2
| |
| 43 | 41, 42 | 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-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-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-iota 5332 df-fun 5374 df-fn 5375 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 |
| This theorem is referenced by: grpinveu 13820 grpid 13821 grpidlcan 13848 grpinvssd 13859 grpsubrcan 13863 grpsubadd 13870 rngrz 14220 ringcom 14309 ringrz 14322 rhmunitinv 14458 lmodcom 14642 |
| Copyright terms: Public domain | W3C validator |