| 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 2207 |
. . . . 5
| |
| 4 | 1, 2, 3 | grpinvex 13503 |
. . . 4
|
| 5 | 4 | 3ad2antr3 1167 |
. . 3
|
| 6 | simprr 531 |
. . . . . . . 8
| |
| 7 | 6 | oveq1d 5984 |
. . . . . . 7
|
| 8 | simpll 527 |
. . . . . . . . 9
| |
| 9 | 1, 2 | grpass 13502 |
. . . . . . . . 9
|
| 10 | 8, 9 | sylan 283 |
. . . . . . . 8
|
| 11 | simplr1 1042 |
. . . . . . . 8
| |
| 12 | simplr3 1044 |
. . . . . . . 8
| |
| 13 | simprll 537 |
. . . . . . . 8
| |
| 14 | 10, 11, 12, 13 | caovassd 6131 |
. . . . . . 7
|
| 15 | simplr2 1043 |
. . . . . . . 8
| |
| 16 | 10, 15, 12, 13 | caovassd 6131 |
. . . . . . 7
|
| 17 | 7, 14, 16 | 3eqtr3d 2248 |
. . . . . 6
|
| 18 | 1, 2 | grpcl 13501 |
. . . . . . . . . 10
|
| 19 | 8, 18 | syl3an1 1283 |
. . . . . . . . 9
|
| 20 | 1, 3 | grpidcl 13522 |
. . . . . . . . . 10
|
| 21 | 8, 20 | syl 14 |
. . . . . . . . 9
|
| 22 | 1, 2, 3 | grplid 13524 |
. . . . . . . . . 10
|
| 23 | 8, 22 | sylan 283 |
. . . . . . . . 9
|
| 24 | 1, 2, 3 | grpinvex 13503 |
. . . . . . . . . 10
|
| 25 | 8, 24 | sylan 283 |
. . . . . . . . 9
|
| 26 | simpr 110 |
. . . . . . . . 9
| |
| 27 | 13 | adantr 276 |
. . . . . . . . 9
|
| 28 | simprlr 538 |
. . . . . . . . . 10
| |
| 29 | 28 | adantr 276 |
. . . . . . . . 9
|
| 30 | 19, 21, 23, 10, 25, 26, 27, 29 | grpinva 13379 |
. . . . . . . 8
|
| 31 | 12, 30 | mpdan 421 |
. . . . . . 7
|
| 32 | 31 | oveq2d 5985 |
. . . . . 6
|
| 33 | 31 | oveq2d 5985 |
. . . . . 6
|
| 34 | 17, 32, 33 | 3eqtr3d 2248 |
. . . . 5
|
| 35 | 1, 2, 3 | grprid 13525 |
. . . . . 6
|
| 36 | 8, 11, 35 | syl2anc 411 |
. . . . 5
|
| 37 | 1, 2, 3 | grprid 13525 |
. . . . . 6
|
| 38 | 8, 15, 37 | syl2anc 411 |
. . . . 5
|
| 39 | 34, 36, 38 | 3eqtr3d 2248 |
. . . 4
|
| 40 | 39 | expr 375 |
. . 3
|
| 41 | 5, 40 | rexlimddv 2631 |
. 2
|
| 42 | oveq1 5976 |
. 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-sep 4179 ax-pow 4235 ax-pr 4270 ax-un 4499 ax-cnex 8053 ax-resscn 8054 ax-1re 8056 ax-addrcl 8059 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ral 2491 df-rex 2492 df-reu 2493 df-rmo 2494 df-rab 2495 df-v 2779 df-sbc 3007 df-csb 3103 df-un 3179 df-in 3181 df-ss 3188 df-pw 3629 df-sn 3650 df-pr 3651 df-op 3653 df-uni 3866 df-int 3901 df-br 4061 df-opab 4123 df-mpt 4124 df-id 4359 df-xp 4700 df-rel 4701 df-cnv 4702 df-co 4703 df-dm 4704 df-rn 4705 df-res 4706 df-iota 5252 df-fun 5293 df-fn 5294 df-fv 5299 df-riota 5924 df-ov 5972 df-inn 9074 df-2 9132 df-ndx 12996 df-slot 12997 df-base 12999 df-plusg 13083 df-0g 13251 df-mgm 13349 df-sgrp 13395 df-mnd 13410 df-grp 13496 |
| This theorem is referenced by: grpinveu 13531 grpid 13532 grpidlcan 13559 grpinvssd 13570 grpsubrcan 13574 grpsubadd 13581 rngrz 13869 ringcom 13954 ringrz 13967 rhmunitinv 14101 lmodcom 14256 |
| Copyright terms: Public domain | W3C validator |