| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpoinvdiv | Structured version Visualization version GIF version | ||
| Description: Inverse of a group division. (Contributed by NM, 24-Feb-2008.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| grpdiv.1 | ⊢ 𝑋 = ran 𝐺 |
| grpdiv.2 | ⊢ 𝑁 = (inv‘𝐺) |
| grpdiv.3 | ⊢ 𝐷 = ( /𝑔 ‘𝐺) |
| Ref | Expression |
|---|---|
| grpoinvdiv | ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐷𝐵)) = (𝐵𝐷𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpdiv.1 | . . . 4 ⊢ 𝑋 = ran 𝐺 | |
| 2 | grpdiv.2 | . . . 4 ⊢ 𝑁 = (inv‘𝐺) | |
| 3 | grpdiv.3 | . . . 4 ⊢ 𝐷 = ( /𝑔 ‘𝐺) | |
| 4 | 1, 2, 3 | grpodivval 31016 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) = (𝐴𝐺(𝑁‘𝐵))) |
| 5 | 4 | fveq2d 6882 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐷𝐵)) = (𝑁‘(𝐴𝐺(𝑁‘𝐵)))) |
| 6 | 1, 2 | grpoinvcl 31005 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) ∈ 𝑋) |
| 7 | 6 | 3adant2 1149 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘𝐵) ∈ 𝑋) |
| 8 | 1, 2 | grpoinvop 31014 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ (𝑁‘𝐵) ∈ 𝑋) → (𝑁‘(𝐴𝐺(𝑁‘𝐵))) = ((𝑁‘(𝑁‘𝐵))𝐺(𝑁‘𝐴))) |
| 9 | 7, 8 | syld3an3 1436 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐺(𝑁‘𝐵))) = ((𝑁‘(𝑁‘𝐵))𝐺(𝑁‘𝐴))) |
| 10 | 1, 2 | grpo2inv 31012 | . . . . 5 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝑁‘𝐵)) = 𝐵) |
| 11 | 10 | 3adant2 1149 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝑁‘𝐵)) = 𝐵) |
| 12 | 11 | oveq1d 7428 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘(𝑁‘𝐵))𝐺(𝑁‘𝐴)) = (𝐵𝐺(𝑁‘𝐴))) |
| 13 | 1, 2, 3 | grpodivval 31016 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐵 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐵𝐷𝐴) = (𝐵𝐺(𝑁‘𝐴))) |
| 14 | 13 | 3com23 1144 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐴) = (𝐵𝐺(𝑁‘𝐴))) |
| 15 | 12, 14 | eqtr4d 2798 | . 2 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝑁‘(𝑁‘𝐵))𝐺(𝑁‘𝐴)) = (𝐵𝐷𝐴)) |
| 16 | 5, 9, 15 | 3eqtrd 2799 | 1 ⊢ ((𝐺 ∈ GrpOp ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐷𝐵)) = (𝐵𝐷𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ran crn 5656 ‘cfv 6533 (class class class)co 7413 GrpOpcgr 30970 invcgn 30972 /𝑔 cgs 30973 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987 df-grpo 30974 df-gid 30975 df-ginv 30976 df-gdiv 30977 |
| This theorem is used by: grpodivdiv 31021 |
| Copyright terms: Public domain | W3C validator |