| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpoinvfval | Structured version Visualization version GIF version | ||
| Description: The inverse function of a group. (Contributed by NM, 26-Oct-2006.) (Revised by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| grpinvfval.1 | ⊢ 𝑋 = ran 𝐺 |
| grpinvfval.2 | ⊢ 𝑈 = (GId‘𝐺) |
| grpinvfval.3 | ⊢ 𝑁 = (inv‘𝐺) |
| Ref | Expression |
|---|---|
| grpoinvfval | ⊢ (𝐺 ∈ GrpOp → 𝑁 = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpinvfval.3 | . 2 ⊢ 𝑁 = (inv‘𝐺) | |
| 2 | grpinvfval.1 | . . . . 5 ⊢ 𝑋 = ran 𝐺 | |
| 3 | rnexg 7903 | . . . . 5 ⊢ (𝐺 ∈ GrpOp → ran 𝐺 ∈ V) | |
| 4 | 2, 3 | eqeltrid 2866 | . . . 4 ⊢ (𝐺 ∈ GrpOp → 𝑋 ∈ V) |
| 5 | mptexg 7224 | . . . 4 ⊢ (𝑋 ∈ V → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V) | |
| 6 | 4, 5 | syl 18 | . . 3 ⊢ (𝐺 ∈ GrpOp → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V) |
| 7 | rneq 5924 | . . . . . 6 ⊢ (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺) | |
| 8 | 7, 2 | eqtr4di 2815 | . . . . 5 ⊢ (𝑔 = 𝐺 → ran 𝑔 = 𝑋) |
| 9 | oveq 7423 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (𝑦𝑔𝑥) = (𝑦𝐺𝑥)) | |
| 10 | fveq2 6882 | . . . . . . . 8 ⊢ (𝑔 = 𝐺 → (GId‘𝑔) = (GId‘𝐺)) | |
| 11 | grpinvfval.2 | . . . . . . . 8 ⊢ 𝑈 = (GId‘𝐺) | |
| 12 | 10, 11 | eqtr4di 2815 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (GId‘𝑔) = 𝑈) |
| 13 | 9, 12 | eqeq12d 2778 | . . . . . 6 ⊢ (𝑔 = 𝐺 → ((𝑦𝑔𝑥) = (GId‘𝑔) ↔ (𝑦𝐺𝑥) = 𝑈)) |
| 14 | 8, 13 | riotaeqbidv 7377 | . . . . 5 ⊢ (𝑔 = 𝐺 → (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔)) = (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) |
| 15 | 8, 14 | mpteq12dv 5196 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔))) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))) |
| 16 | df-ginv 30984 | . . . 4 ⊢ inv = (𝑔 ∈ GrpOp ↦ (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔)))) | |
| 17 | 15, 16 | fvmptg 6988 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V) → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))) |
| 18 | 6, 17 | mpdan 700 | . 2 ⊢ (𝐺 ∈ GrpOp → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))) |
| 19 | 1, 18 | eqtrid 2809 | 1 ⊢ (𝐺 ∈ GrpOp → 𝑁 = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3453 ↦ cmpt 5190 ran crn 5660 ‘cfv 6537 ℩crio 7373 (class class class)co 7417 GrpOpcgr 30978 GIdcgi 30979 invcgn 30980 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pr 5402 ax-un 7740 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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 7374 df-ov 7420 df-ginv 30984 |
| This theorem is used by: grpoinvval 31012 grpoinvf 31021 |
| Copyright terms: Public domain | W3C validator |