| 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 7908 | . . . . 5 ⊢ (𝐺 ∈ GrpOp → ran 𝐺 ∈ V) | |
| 4 | 2, 3 | eqeltrid 2870 | . . . 4 ⊢ (𝐺 ∈ GrpOp → 𝑋 ∈ V) |
| 5 | mptexg 7226 | . . . 4 ⊢ (𝑋 ∈ V → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V) | |
| 6 | 4, 5 | syl 18 | . . 3 ⊢ (𝐺 ∈ GrpOp → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V) |
| 7 | rneq 5931 | . . . . . 6 ⊢ (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺) | |
| 8 | 7, 2 | eqtr4di 2819 | . . . . 5 ⊢ (𝑔 = 𝐺 → ran 𝑔 = 𝑋) |
| 9 | oveq 7429 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (𝑦𝑔𝑥) = (𝑦𝐺𝑥)) | |
| 10 | fveq2 6888 | . . . . . . . 8 ⊢ (𝑔 = 𝐺 → (GId‘𝑔) = (GId‘𝐺)) | |
| 11 | grpinvfval.2 | . . . . . . . 8 ⊢ 𝑈 = (GId‘𝐺) | |
| 12 | 10, 11 | eqtr4di 2819 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (GId‘𝑔) = 𝑈) |
| 13 | 9, 12 | eqeq12d 2782 | . . . . . 6 ⊢ (𝑔 = 𝐺 → ((𝑦𝑔𝑥) = (GId‘𝑔) ↔ (𝑦𝐺𝑥) = 𝑈)) |
| 14 | 8, 13 | riotaeqbidv 7383 | . . . . 5 ⊢ (𝑔 = 𝐺 → (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔)) = (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) |
| 15 | 8, 14 | mpteq12dv 5203 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔))) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))) |
| 16 | df-ginv 30884 | . . . 4 ⊢ inv = (𝑔 ∈ GrpOp ↦ (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔)))) | |
| 17 | 15, 16 | fvmptg 6994 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V) → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))) |
| 18 | 6, 17 | mpdan 700 | . 2 ⊢ (𝐺 ∈ GrpOp → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))) |
| 19 | 1, 18 | eqtrid 2813 | 1 ⊢ (𝐺 ∈ GrpOp → 𝑁 = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2146 Vcvv 3458 ↦ cmpt 5197 ran crn 5667 ‘cfv 6543 ℩crio 7379 (class class class)co 7423 GrpOpcgr 30878 GIdcgi 30879 invcgn 30880 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pr 5409 ax-un 7745 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-ginv 30884 |
| This theorem is used by: grpoinvval 30912 grpoinvf 30921 |
| Copyright terms: Public domain | W3C validator |