| 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 21370. (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 21357 | . . . . 5 ⊢ (𝜑 → 1 ∈ 𝐵) |
| 9 | 8 | anim1i 624 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 ∈ 𝐵 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵))) |
| 10 | 3anass 1107 | . . . 4 ⊢ (( 1 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵) ↔ ( 1 ∈ 𝐵 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵))) | |
| 11 | 9, 10 | sylibr 236 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) |
| 12 | eqid 2763 | . . . 4 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 13 | 5, 12, 6 | rngdi 20207 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ ( 1 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 · (𝐴(+g‘𝑅)𝐶)) = (( 1 · 𝐴)(+g‘𝑅)( 1 · 𝐶))) |
| 14 | 1, 11, 13 | syl2an2r 695 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 · (𝐴(+g‘𝑅)𝐶)) = (( 1 · 𝐴)(+g‘𝑅)( 1 · 𝐶))) |
| 15 | 3, 12 | ressplusg 17321 | . . . . 5 ⊢ (𝐼 ∈ (2Ideal‘𝑅) → (+g‘𝑅) = (+g‘𝐽)) |
| 16 | 2, 15 | syl 17 | . . . 4 ⊢ (𝜑 → (+g‘𝑅) = (+g‘𝐽)) |
| 17 | 16 | oveqd 7414 | . . 3 ⊢ (𝜑 → (( 1 · 𝐴)(+g‘𝑅)( 1 · 𝐶)) = (( 1 · 𝐴)(+g‘𝐽)( 1 · 𝐶))) |
| 18 | 17 | adantr 484 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → (( 1 · 𝐴)(+g‘𝑅)( 1 · 𝐶)) = (( 1 · 𝐴)(+g‘𝐽)( 1 · 𝐶))) |
| 19 | 14, 18 | eqtrd 2798 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 · (𝐴(+g‘𝑅)𝐶)) = (( 1 · 𝐴)(+g‘𝐽)( 1 · 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1099 = wceq 1561 ∈ wcel 2143 ‘cfv 6522 (class class class)co 7397 Basecbs 17246 ↾s cress 17267 +gcplusg 17287 .rcmulr 17288 Rngcrng 20199 1rcur 20232 Ringcrg 20284 2Idealc2idl 21320 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6289 df-ord 6350 df-on 6351 df-lim 6352 df-suc 6353 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-riota 7354 df-ov 7400 df-oprab 7401 df-mpo 7402 df-om 7848 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8382 df-er 8679 df-en 8929 df-dom 8930 df-sdom 8931 df-pnf 11219 df-mnf 11220 df-xr 11221 df-ltxr 11222 df-le 11223 df-sub 11417 df-neg 11418 df-nn 12212 df-2 12281 df-sets 17201 df-slot 17219 df-ndx 17231 df-base 17247 df-ress 17268 df-plusg 17300 df-0g 17471 df-mgm 18675 df-sgrp 18754 df-mnd 18770 df-mgp 20188 df-rng 20200 df-ur 20233 df-ring 20286 |
| This theorem is referenced by: rngqiprngghm 21370 |
| Copyright terms: Public domain | W3C validator |