| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grponpcan | Structured version Visualization version GIF version | ||
| Description: Cancellation law for group division. (npcan 11387 analog.) (Contributed by NM, 15-Feb-2008.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| grpdivf.1 | ⊢ 𝑋 = ran 𝐺 |
| grpdivf.3 | ⊢ 𝐷 = ( /𝑔 ‘𝐺) |
| Ref | Expression |
|---|---|
| grponpcan | ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpdivf.1 | . . . 4 ⊢ 𝑋 = ran 𝐺 | |
| 2 | eqid 2734 | . . . 4 ⊢ (inv‘𝐺) = (inv‘𝐺) | |
| 3 | grpdivf.3 | . . . 4 ⊢ 𝐷 = ( /𝑔 ‘𝐺) | |
| 4 | 1, 2, 3 | grpodivval 30559 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) = (𝐴𝐺((inv‘𝐺)‘𝐵))) |
| 5 | 4 | oveq1d 7371 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵)) |
| 6 | simp1 1136 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐺 ∈ GrpOp) | |
| 7 | simp2 1137 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 8 | 1, 2 | grpoinvcl 30548 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → ((inv‘𝐺)‘𝐵) ∈ 𝑋) |
| 9 | 8 | 3adant2 1131 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((inv‘𝐺)‘𝐵) ∈ 𝑋) |
| 10 | simp3 1138 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋) | |
| 11 | 1 | grpoass 30527 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ ((inv‘𝐺)‘𝐵) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵))) |
| 12 | 6, 7, 9, 10, 11 | syl13anc 1374 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵))) |
| 13 | eqid 2734 | . . . . . . 7 ⊢ (GId‘𝐺) = (GId‘𝐺) | |
| 14 | 1, 13, 2 | grpolinv 30550 | . . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (((inv‘𝐺)‘𝐵)𝐺𝐵) = (GId‘𝐺)) |
| 15 | 14 | oveq2d 7372 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = (𝐴𝐺(GId‘𝐺))) |
| 16 | 15 | 3adant2 1131 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = (𝐴𝐺(GId‘𝐺))) |
| 17 | 1, 13 | grporid 30541 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(GId‘𝐺)) = 𝐴) |
| 18 | 17 | 3adant3 1132 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(GId‘𝐺)) = 𝐴) |
| 19 | 16, 18 | eqtrd 2769 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = 𝐴) |
| 20 | 12, 19 | eqtrd 2769 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = 𝐴) |
| 21 | 5, 20 | eqtrd 2769 | 1 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ran crn 5623 ‘cfv 6490 (class class class)co 7356 GrpOpcgr 30513 GIdcgi 30514 invcgn 30515 /𝑔 cgs 30516 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-1st 7931 df-2nd 7932 df-grpo 30517 df-gid 30518 df-ginv 30519 df-gdiv 30520 |
| This theorem is referenced by: grpoeqdivid 38021 ghomdiv 38032 |
| Copyright terms: Public domain | W3C validator |