| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > invrpropd | Structured version Visualization version GIF version | ||
| Description: The ring inverse function depends only on the ring's base set and multiplication operation. (Contributed by Mario Carneiro, 26-Dec-2014.) (Revised by Mario Carneiro, 5-Oct-2015.) |
| Ref | Expression |
|---|---|
| rngidpropd.1 | ⊢ (𝜑 → 𝐵 = (Base‘𝐾)) |
| rngidpropd.2 | ⊢ (𝜑 → 𝐵 = (Base‘𝐿)) |
| rngidpropd.3 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦)) |
| Ref | Expression |
|---|---|
| invrpropd | ⊢ (𝜑 → (invr‘𝐾) = (invr‘𝐿)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2762 | . . . . 5 ⊢ (Unit‘𝐾) = (Unit‘𝐾) | |
| 2 | eqid 2762 | . . . . 5 ⊢ ((mulGrp‘𝐾) ↾s (Unit‘𝐾)) = ((mulGrp‘𝐾) ↾s (Unit‘𝐾)) | |
| 3 | 1, 2 | unitgrpbas 20431 | . . . 4 ⊢ (Unit‘𝐾) = (Base‘((mulGrp‘𝐾) ↾s (Unit‘𝐾))) |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝜑 → (Unit‘𝐾) = (Base‘((mulGrp‘𝐾) ↾s (Unit‘𝐾)))) |
| 5 | rngidpropd.1 | . . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐾)) | |
| 6 | rngidpropd.2 | . . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐿)) | |
| 7 | rngidpropd.3 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦)) | |
| 8 | 5, 6, 7 | unitpropd 20466 | . . . 4 ⊢ (𝜑 → (Unit‘𝐾) = (Unit‘𝐿)) |
| 9 | eqid 2762 | . . . . 5 ⊢ (Unit‘𝐿) = (Unit‘𝐿) | |
| 10 | eqid 2762 | . . . . 5 ⊢ ((mulGrp‘𝐿) ↾s (Unit‘𝐿)) = ((mulGrp‘𝐿) ↾s (Unit‘𝐿)) | |
| 11 | 9, 10 | unitgrpbas 20431 | . . . 4 ⊢ (Unit‘𝐿) = (Base‘((mulGrp‘𝐿) ↾s (Unit‘𝐿))) |
| 12 | 8, 11 | eqtrdi 2813 | . . 3 ⊢ (𝜑 → (Unit‘𝐾) = (Base‘((mulGrp‘𝐿) ↾s (Unit‘𝐿)))) |
| 13 | eqid 2762 | . . . . . . . . 9 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 14 | 13, 1 | unitss 20425 | . . . . . . . 8 ⊢ (Unit‘𝐾) ⊆ (Base‘𝐾) |
| 15 | 14, 5 | sseqtrrid 3979 | . . . . . . 7 ⊢ (𝜑 → (Unit‘𝐾) ⊆ 𝐵) |
| 16 | 15 | sselda 3936 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Unit‘𝐾)) → 𝑥 ∈ 𝐵) |
| 17 | 15 | sselda 3936 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (Unit‘𝐾)) → 𝑦 ∈ 𝐵) |
| 18 | 16, 17 | anim12dan 628 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Unit‘𝐾) ∧ 𝑦 ∈ (Unit‘𝐾))) → (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) |
| 19 | 18, 7 | syldan 600 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Unit‘𝐾) ∧ 𝑦 ∈ (Unit‘𝐾))) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦)) |
| 20 | fvex 6880 | . . . . . 6 ⊢ (Unit‘𝐾) ∈ V | |
| 21 | eqid 2762 | . . . . . . . 8 ⊢ (mulGrp‘𝐾) = (mulGrp‘𝐾) | |
| 22 | eqid 2762 | . . . . . . . 8 ⊢ (.r‘𝐾) = (.r‘𝐾) | |
| 23 | 21, 22 | mgpplusg 20190 | . . . . . . 7 ⊢ (.r‘𝐾) = (+g‘(mulGrp‘𝐾)) |
| 24 | 2, 23 | ressplusg 17320 | . . . . . 6 ⊢ ((Unit‘𝐾) ∈ V → (.r‘𝐾) = (+g‘((mulGrp‘𝐾) ↾s (Unit‘𝐾)))) |
| 25 | 20, 24 | ax-mp 5 | . . . . 5 ⊢ (.r‘𝐾) = (+g‘((mulGrp‘𝐾) ↾s (Unit‘𝐾))) |
| 26 | 25 | oveqi 7409 | . . . 4 ⊢ (𝑥(.r‘𝐾)𝑦) = (𝑥(+g‘((mulGrp‘𝐾) ↾s (Unit‘𝐾)))𝑦) |
| 27 | fvex 6880 | . . . . . 6 ⊢ (Unit‘𝐿) ∈ V | |
| 28 | eqid 2762 | . . . . . . . 8 ⊢ (mulGrp‘𝐿) = (mulGrp‘𝐿) | |
| 29 | eqid 2762 | . . . . . . . 8 ⊢ (.r‘𝐿) = (.r‘𝐿) | |
| 30 | 28, 29 | mgpplusg 20190 | . . . . . . 7 ⊢ (.r‘𝐿) = (+g‘(mulGrp‘𝐿)) |
| 31 | 10, 30 | ressplusg 17320 | . . . . . 6 ⊢ ((Unit‘𝐿) ∈ V → (.r‘𝐿) = (+g‘((mulGrp‘𝐿) ↾s (Unit‘𝐿)))) |
| 32 | 27, 31 | ax-mp 5 | . . . . 5 ⊢ (.r‘𝐿) = (+g‘((mulGrp‘𝐿) ↾s (Unit‘𝐿))) |
| 33 | 32 | oveqi 7409 | . . . 4 ⊢ (𝑥(.r‘𝐿)𝑦) = (𝑥(+g‘((mulGrp‘𝐿) ↾s (Unit‘𝐿)))𝑦) |
| 34 | 19, 26, 33 | 3eqtr3g 2820 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Unit‘𝐾) ∧ 𝑦 ∈ (Unit‘𝐾))) → (𝑥(+g‘((mulGrp‘𝐾) ↾s (Unit‘𝐾)))𝑦) = (𝑥(+g‘((mulGrp‘𝐿) ↾s (Unit‘𝐿)))𝑦)) |
| 35 | 4, 12, 34 | grpinvpropd 19057 | . 2 ⊢ (𝜑 → (invg‘((mulGrp‘𝐾) ↾s (Unit‘𝐾))) = (invg‘((mulGrp‘𝐿) ↾s (Unit‘𝐿)))) |
| 36 | eqid 2762 | . . 3 ⊢ (invr‘𝐾) = (invr‘𝐾) | |
| 37 | 1, 2, 36 | invrfval 20438 | . 2 ⊢ (invr‘𝐾) = (invg‘((mulGrp‘𝐾) ↾s (Unit‘𝐾))) |
| 38 | eqid 2762 | . . 3 ⊢ (invr‘𝐿) = (invr‘𝐿) | |
| 39 | 9, 10, 38 | invrfval 20438 | . 2 ⊢ (invr‘𝐿) = (invg‘((mulGrp‘𝐿) ↾s (Unit‘𝐿))) |
| 40 | 35, 37, 39 | 3eqtr4g 2822 | 1 ⊢ (𝜑 → (invr‘𝐾) = (invr‘𝐿)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1560 ∈ wcel 2142 Vcvv 3454 ‘cfv 6521 (class class class)co 7396 Basecbs 17245 ↾s cress 17266 +gcplusg 17286 .rcmulr 17287 invgcminusg 18976 mulGrpcmgp 20186 Unitcui 20404 invrcinvr 20436 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-2nd 7971 df-tpos 8206 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-2 12280 df-3 12281 df-sets 17200 df-slot 17218 df-ndx 17230 df-base 17246 df-ress 17267 df-plusg 17299 df-mulr 17300 df-0g 17470 df-minusg 18979 df-mgp 20187 df-ur 20232 df-oppr 20386 df-dvdsr 20406 df-unit 20407 df-invr 20437 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |