| 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 2769 | . . . . 5 ⊢ (Unit‘𝐾) = (Unit‘𝐾) | |
| 2 | eqid 2769 | . . . . 5 ⊢ ((mulGrp‘𝐾) ↾s (Unit‘𝐾)) = ((mulGrp‘𝐾) ↾s (Unit‘𝐾)) | |
| 3 | 1, 2 | unitgrpbas 20463 | . . . 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 20498 | . . . 4 ⊢ (𝜑 → (Unit‘𝐾) = (Unit‘𝐿)) |
| 9 | eqid 2769 | . . . . 5 ⊢ (Unit‘𝐿) = (Unit‘𝐿) | |
| 10 | eqid 2769 | . . . . 5 ⊢ ((mulGrp‘𝐿) ↾s (Unit‘𝐿)) = ((mulGrp‘𝐿) ↾s (Unit‘𝐿)) | |
| 11 | 9, 10 | unitgrpbas 20463 | . . . 4 ⊢ (Unit‘𝐿) = (Base‘((mulGrp‘𝐿) ↾s (Unit‘𝐿))) |
| 12 | 8, 11 | eqtrdi 2820 | . . 3 ⊢ (𝜑 → (Unit‘𝐾) = (Base‘((mulGrp‘𝐿) ↾s (Unit‘𝐿)))) |
| 13 | eqid 2769 | . . . . . . . . 9 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 14 | 13, 1 | unitss 20457 | . . . . . . . 8 ⊢ (Unit‘𝐾) ⊆ (Base‘𝐾) |
| 15 | 14, 5 | sseqtrrid 3988 | . . . . . . 7 ⊢ (𝜑 → (Unit‘𝐾) ⊆ 𝐵) |
| 16 | 15 | sselda 3945 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Unit‘𝐾)) → 𝑥 ∈ 𝐵) |
| 17 | 15 | sselda 3945 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (Unit‘𝐾)) → 𝑦 ∈ 𝐵) |
| 18 | 16, 17 | anim12dan 630 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ (Unit‘𝐾) ∧ 𝑦 ∈ (Unit‘𝐾))) → (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) |
| 19 | 18, 7 | syldan 602 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ (Unit‘𝐾) ∧ 𝑦 ∈ (Unit‘𝐾))) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦)) |
| 20 | fvex 6895 | . . . . . 6 ⊢ (Unit‘𝐾) ∈ V | |
| 21 | eqid 2769 | . . . . . . . 8 ⊢ (mulGrp‘𝐾) = (mulGrp‘𝐾) | |
| 22 | eqid 2769 | . . . . . . . 8 ⊢ (.r‘𝐾) = (.r‘𝐾) | |
| 23 | 21, 22 | mgpplusg 20219 | . . . . . . 7 ⊢ (.r‘𝐾) = (+g‘(mulGrp‘𝐾)) |
| 24 | 2, 23 | ressplusg 17343 | . . . . . 6 ⊢ ((Unit‘𝐾) ∈ V → (.r‘𝐾) = (+g‘((mulGrp‘𝐾) ↾s (Unit‘𝐾)))) |
| 25 | 20, 24 | ax-mp 5 | . . . . 5 ⊢ (.r‘𝐾) = (+g‘((mulGrp‘𝐾) ↾s (Unit‘𝐾))) |
| 26 | 25 | oveqi 7424 | . . . 4 ⊢ (𝑥(.r‘𝐾)𝑦) = (𝑥(+g‘((mulGrp‘𝐾) ↾s (Unit‘𝐾)))𝑦) |
| 27 | fvex 6895 | . . . . . 6 ⊢ (Unit‘𝐿) ∈ V | |
| 28 | eqid 2769 | . . . . . . . 8 ⊢ (mulGrp‘𝐿) = (mulGrp‘𝐿) | |
| 29 | eqid 2769 | . . . . . . . 8 ⊢ (.r‘𝐿) = (.r‘𝐿) | |
| 30 | 28, 29 | mgpplusg 20219 | . . . . . . 7 ⊢ (.r‘𝐿) = (+g‘(mulGrp‘𝐿)) |
| 31 | 10, 30 | ressplusg 17343 | . . . . . 6 ⊢ ((Unit‘𝐿) ∈ V → (.r‘𝐿) = (+g‘((mulGrp‘𝐿) ↾s (Unit‘𝐿)))) |
| 32 | 27, 31 | ax-mp 5 | . . . . 5 ⊢ (.r‘𝐿) = (+g‘((mulGrp‘𝐿) ↾s (Unit‘𝐿))) |
| 33 | 32 | oveqi 7424 | . . . 4 ⊢ (𝑥(.r‘𝐿)𝑦) = (𝑥(+g‘((mulGrp‘𝐿) ↾s (Unit‘𝐿)))𝑦) |
| 34 | 19, 26, 33 | 3eqtr3g 2827 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ (Unit‘𝐾) ∧ 𝑦 ∈ (Unit‘𝐾))) → (𝑥(+g‘((mulGrp‘𝐾) ↾s (Unit‘𝐾)))𝑦) = (𝑥(+g‘((mulGrp‘𝐿) ↾s (Unit‘𝐿)))𝑦)) |
| 35 | 4, 12, 34 | grpinvpropd 19080 | . 2 ⊢ (𝜑 → (invg‘((mulGrp‘𝐾) ↾s (Unit‘𝐾))) = (invg‘((mulGrp‘𝐿) ↾s (Unit‘𝐿)))) |
| 36 | eqid 2769 | . . 3 ⊢ (invr‘𝐾) = (invr‘𝐾) | |
| 37 | 1, 2, 36 | invrfval 20470 | . 2 ⊢ (invr‘𝐾) = (invg‘((mulGrp‘𝐾) ↾s (Unit‘𝐾))) |
| 38 | eqid 2769 | . . 3 ⊢ (invr‘𝐿) = (invr‘𝐿) | |
| 39 | 9, 10, 38 | invrfval 20470 | . 2 ⊢ (invr‘𝐿) = (invg‘((mulGrp‘𝐿) ↾s (Unit‘𝐿))) |
| 40 | 35, 37, 39 | 3eqtr4g 2829 | 1 ⊢ (𝜑 → (invr‘𝐾) = (invr‘𝐿)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 Vcvv 3463 ‘cfv 6537 (class class class)co 7411 Basecbs 17268 ↾s cress 17289 +gcplusg 17309 .rcmulr 17310 invgcminusg 19000 mulGrpcmgp 20215 Unitcui 20436 invrcinvr 20468 |
| 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 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 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-nel 3071 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-pss 3933 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-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 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-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 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-om 7862 df-2nd 7986 df-tpos 8221 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-2 12302 df-3 12303 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-ress 17290 df-plusg 17322 df-mulr 17323 df-0g 17493 df-minusg 19003 df-mgp 20216 df-ur 20263 df-oppr 20418 df-dvdsr 20438 df-unit 20439 df-invr 20469 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |