| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sraring | Structured version Visualization version GIF version | ||
| Description: Condition for a subring algebra to be a ring. (Contributed by Thierry Arnoux, 24-Jul-2023.) |
| Ref | Expression |
|---|---|
| sraring.1 | ⊢ 𝐴 = ((subringAlg ‘𝑅)‘𝑉) |
| sraring.2 | ⊢ 𝐵 = (Base‘𝑅) |
| Ref | Expression |
|---|---|
| sraring | ⊢ ((𝑅 ∈ Ring ∧ 𝑉 ⊆ 𝐵) → 𝐴 ∈ Ring) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sraring.2 | . . . 4 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | 1 | a1i 11 | . . 3 ⊢ (𝑉 ⊆ 𝐵 → 𝐵 = (Base‘𝑅)) |
| 3 | sraring.1 | . . . . . 6 ⊢ 𝐴 = ((subringAlg ‘𝑅)‘𝑉) | |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ (𝑉 ⊆ 𝐵 → 𝐴 = ((subringAlg ‘𝑅)‘𝑉)) |
| 5 | id 23 | . . . . . 6 ⊢ (𝑉 ⊆ 𝐵 → 𝑉 ⊆ 𝐵) | |
| 6 | 5, 1 | sseqtrdi 3971 | . . . . 5 ⊢ (𝑉 ⊆ 𝐵 → 𝑉 ⊆ (Base‘𝑅)) |
| 7 | 4, 6 | srabase 21361 | . . . 4 ⊢ (𝑉 ⊆ 𝐵 → (Base‘𝑅) = (Base‘𝐴)) |
| 8 | 1, 7 | eqtrid 2807 | . . 3 ⊢ (𝑉 ⊆ 𝐵 → 𝐵 = (Base‘𝐴)) |
| 9 | 4, 6 | sraaddg 21362 | . . . 4 ⊢ (𝑉 ⊆ 𝐵 → (+g‘𝑅) = (+g‘𝐴)) |
| 10 | 9 | oveqdr 7441 | . . 3 ⊢ ((𝑉 ⊆ 𝐵 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝑅)𝑦) = (𝑥(+g‘𝐴)𝑦)) |
| 11 | 4, 6 | sramulr 21363 | . . . 4 ⊢ (𝑉 ⊆ 𝐵 → (.r‘𝑅) = (.r‘𝐴)) |
| 12 | 11 | oveqdr 7441 | . . 3 ⊢ ((𝑉 ⊆ 𝐵 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝑅)𝑦) = (𝑥(.r‘𝐴)𝑦)) |
| 13 | 2, 8, 10, 12 | ringpropd 20430 | . 2 ⊢ (𝑉 ⊆ 𝐵 → (𝑅 ∈ Ring ↔ 𝐴 ∈ Ring)) |
| 14 | 13 | biimpac 484 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑉 ⊆ 𝐵) → 𝐴 ∈ Ring) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ‘cfv 6533 Basecbs 17301 +gcplusg 17342 .rcmulr 17343 Ringcrg 20372 subringAlg csra 21355 |
| 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 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3062 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-pss 3919 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-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 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-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 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-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-sets 17256 df-slot 17274 df-ndx 17286 df-base 17302 df-plusg 17355 df-mulr 17356 df-sca 17358 df-vsca 17359 df-ip 17360 df-0g 17526 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-grp 19060 df-mgp 20274 df-ring 20374 df-sra 21357 |
| This theorem is used by: sraassab 22083 sradrng 34092 fedgmullem2 34140 ccfldsrarelvec 34181 extdgfialglem1 34202 |
| Copyright terms: Public domain | W3C validator |