| 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 11397 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 2737 | . . . 4 ⊢ (inv‘𝐺) = (inv‘𝐺) | |
| 3 | grpdivf.3 | . . . 4 ⊢ 𝐷 = ( /𝑔 ‘𝐺) | |
| 4 | 1, 2, 3 | grpodivval 30625 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) = (𝐴𝐺((inv‘𝐺)‘𝐵))) |
| 5 | 4 | oveq1d 7377 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵)) |
| 6 | simp1 1137 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐺 ∈ GrpOp) | |
| 7 | simp2 1138 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 8 | 1, 2 | grpoinvcl 30614 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → ((inv‘𝐺)‘𝐵) ∈ 𝑋) |
| 9 | 8 | 3adant2 1132 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((inv‘𝐺)‘𝐵) ∈ 𝑋) |
| 10 | simp3 1139 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋) | |
| 11 | 1 | grpoass 30593 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ ((inv‘𝐺)‘𝐵) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵))) |
| 12 | 6, 7, 9, 10, 11 | syl13anc 1375 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵))) |
| 13 | eqid 2737 | . . . . . . 7 ⊢ (GId‘𝐺) = (GId‘𝐺) | |
| 14 | 1, 13, 2 | grpolinv 30616 | . . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (((inv‘𝐺)‘𝐵)𝐺𝐵) = (GId‘𝐺)) |
| 15 | 14 | oveq2d 7378 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = (𝐴𝐺(GId‘𝐺))) |
| 16 | 15 | 3adant2 1132 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = (𝐴𝐺(GId‘𝐺))) |
| 17 | 1, 13 | grporid 30607 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(GId‘𝐺)) = 𝐴) |
| 18 | 17 | 3adant3 1133 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(GId‘𝐺)) = 𝐴) |
| 19 | 16, 18 | eqtrd 2772 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = 𝐴) |
| 20 | 12, 19 | eqtrd 2772 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = 𝐴) |
| 21 | 5, 20 | eqtrd 2772 | 1 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ran crn 5627 ‘cfv 6494 (class class class)co 7362 GrpOpcgr 30579 GIdcgi 30580 invcgn 30581 /𝑔 cgs 30582 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5521 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7319 df-ov 7365 df-oprab 7366 df-mpo 7367 df-1st 7937 df-2nd 7938 df-grpo 30583 df-gid 30584 df-ginv 30585 df-gdiv 30586 |
| This theorem is referenced by: grpoeqdivid 38220 ghomdiv 38231 |
| Copyright terms: Public domain | W3C validator |