| 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 11466 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 2769 | . . . 4 ⊢ (inv‘𝐺) = (inv‘𝐺) | |
| 3 | grpdivf.3 | . . . 4 ⊢ 𝐷 = ( /𝑔 ‘𝐺) | |
| 4 | 1, 2, 3 | grpodivval 30828 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) = (𝐴𝐺((inv‘𝐺)‘𝐵))) |
| 5 | 4 | oveq1d 7426 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵)) |
| 6 | simp1 1152 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐺 ∈ GrpOp) | |
| 7 | simp2 1153 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 8 | 1, 2 | grpoinvcl 30817 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → ((inv‘𝐺)‘𝐵) ∈ 𝑋) |
| 9 | 8 | 3adant2 1147 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((inv‘𝐺)‘𝐵) ∈ 𝑋) |
| 10 | simp3 1154 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋) | |
| 11 | 1 | grpoass 30796 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝐴 ∈ 𝑋 ∧ ((inv‘𝐺)‘𝐵) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵))) |
| 12 | 6, 7, 9, 10, 11 | syl13anc 1397 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵))) |
| 13 | eqid 2769 | . . . . . . 7 ⊢ (GId‘𝐺) = (GId‘𝐺) | |
| 14 | 1, 13, 2 | grpolinv 30819 | . . . . . 6 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (((inv‘𝐺)‘𝐵)𝐺𝐵) = (GId‘𝐺)) |
| 15 | 14 | oveq2d 7427 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = (𝐴𝐺(GId‘𝐺))) |
| 16 | 15 | 3adant2 1147 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = (𝐴𝐺(GId‘𝐺))) |
| 17 | 1, 13 | grporid 30810 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(GId‘𝐺)) = 𝐴) |
| 18 | 17 | 3adant3 1148 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(GId‘𝐺)) = 𝐴) |
| 19 | 16, 18 | eqtrd 2804 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(((inv‘𝐺)‘𝐵)𝐺𝐵)) = 𝐴) |
| 20 | 12, 19 | eqtrd 2804 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺((inv‘𝐺)‘𝐵))𝐺𝐵) = 𝐴) |
| 21 | 5, 20 | eqtrd 2804 | 1 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵)𝐺𝐵) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ran crn 5663 ‘cfv 6537 (class class class)co 7411 GrpOpcgr 30782 GIdcgi 30783 invcgn 30784 /𝑔 cgs 30785 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7986 df-2nd 7987 df-grpo 30786 df-gid 30787 df-ginv 30788 df-gdiv 30789 |
| This theorem is referenced by: grpoeqdivid 38454 ghomdiv 38465 |
| Copyright terms: Public domain | W3C validator |