| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rngqiprngghmlem3 | Structured version Visualization version GIF version | ||
| Description: Lemma 3 for rngqiprngghm 21531. (Contributed by AV, 25-Feb-2025.) (Proof shortened by AV, 24-Mar-2025.) |
| Ref | Expression |
|---|---|
| rng2idlring.r | ⊢ (𝜑 → 𝑅 ∈ Rng) |
| rng2idlring.i | ⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅)) |
| rng2idlring.j | ⊢ 𝐽 = (𝑅 ↾s 𝐼) |
| rng2idlring.u | ⊢ (𝜑 → 𝐽 ∈ Ring) |
| rng2idlring.b | ⊢ 𝐵 = (Base‘𝑅) |
| rng2idlring.t | ⊢ · = (.r‘𝑅) |
| rng2idlring.1 | ⊢ 1 = (1r‘𝐽) |
| Ref | Expression |
|---|---|
| rngqiprngghmlem3 | ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 · (𝐴(+g‘𝑅)𝐶)) = (( 1 · 𝐴)(+g‘𝐽)( 1 · 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rng2idlring.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ Rng) | |
| 2 | rng2idlring.i | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅)) | |
| 3 | rng2idlring.j | . . . . . 6 ⊢ 𝐽 = (𝑅 ↾s 𝐼) | |
| 4 | rng2idlring.u | . . . . . 6 ⊢ (𝜑 → 𝐽 ∈ Ring) | |
| 5 | rng2idlring.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 6 | rng2idlring.t | . . . . . 6 ⊢ · = (.r‘𝑅) | |
| 7 | rng2idlring.1 | . . . . . 6 ⊢ 1 = (1r‘𝐽) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | rngqiprng1elbas 21518 | . . . . 5 ⊢ (𝜑 → 1 ∈ 𝐵) |
| 9 | 8 | anim1i 627 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 ∈ 𝐵 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵))) |
| 10 | 3anass 1111 | . . . 4 ⊢ (( 1 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵) ↔ ( 1 ∈ 𝐵 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵))) | |
| 11 | 9, 10 | sylibr 237 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) |
| 12 | eqid 2760 | . . . 4 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 13 | 5, 12, 6 | rngdi 20318 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ ( 1 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 · (𝐴(+g‘𝑅)𝐶)) = (( 1 · 𝐴)(+g‘𝑅)( 1 · 𝐶))) |
| 14 | 1, 11, 13 | syl2an2r 698 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 · (𝐴(+g‘𝑅)𝐶)) = (( 1 · 𝐴)(+g‘𝑅)( 1 · 𝐶))) |
| 15 | 3, 12 | ressplusg 17398 | . . . . 5 ⊢ (𝐼 ∈ (2Ideal‘𝑅) → (+g‘𝑅) = (+g‘𝐽)) |
| 16 | 2, 15 | syl 18 | . . . 4 ⊢ (𝜑 → (+g‘𝑅) = (+g‘𝐽)) |
| 17 | 16 | oveqd 7432 | . . 3 ⊢ (𝜑 → (( 1 · 𝐴)(+g‘𝑅)( 1 · 𝐶)) = (( 1 · 𝐴)(+g‘𝐽)( 1 · 𝐶))) |
| 18 | 17 | adantr 486 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → (( 1 · 𝐴)(+g‘𝑅)( 1 · 𝐶)) = (( 1 · 𝐴)(+g‘𝐽)( 1 · 𝐶))) |
| 19 | 14, 18 | eqtrd 2795 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 · (𝐴(+g‘𝑅)𝐶)) = (( 1 · 𝐴)(+g‘𝐽)( 1 · 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ‘cfv 6534 (class class class)co 7415 Basecbs 17323 ↾s cress 17344 +gcplusg 17364 .rcmulr 17365 Rngcrng 20310 1rcur 20343 Ringcrg 20395 2Idealc2idl 21478 |
| 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-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7738 ax-cnex 11202 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223 |
| 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-rmo 3365 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 6300 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7372 df-ov 7418 df-oprab 7419 df-mpo 7420 df-om 7865 df-2nd 7989 df-frecs 8282 df-wrecs 8313 df-recs 8362 df-rdg 8401 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11291 df-mnf 11292 df-xr 11293 df-ltxr 11294 df-le 11295 df-sub 11489 df-neg 11490 df-nn 12280 df-2 12349 df-sets 17278 df-slot 17296 df-ndx 17308 df-base 17324 df-ress 17345 df-plusg 17377 df-0g 17548 df-mgm 18752 df-sgrp 18844 df-mnd 18860 df-mgp 20297 df-rng 20311 df-ur 20344 df-ring 20397 |
| This theorem is used by: rngqiprngghm 21531 |
| Copyright terms: Public domain | W3C validator |