| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rngqiprnglinlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for rngqiprnglin 21372. (Contributed by AV, 28-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 |
|---|---|
| rngqiprnglinlem1 | ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → (( 1 · 𝐴) · ( 1 · 𝐶)) = ( 1 · (𝐴 · 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rng2idlring.i | . . . . . . 7 ⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅)) | |
| 2 | 1 | adantr 484 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → 𝐼 ∈ (2Ideal‘𝑅)) |
| 3 | rng2idlring.j | . . . . . . 7 ⊢ 𝐽 = (𝑅 ↾s 𝐼) | |
| 4 | rng2idlring.t | . . . . . . 7 ⊢ · = (.r‘𝑅) | |
| 5 | 3, 4 | ressmulr 17336 | . . . . . 6 ⊢ (𝐼 ∈ (2Ideal‘𝑅) → · = (.r‘𝐽)) |
| 6 | 2, 5 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → · = (.r‘𝐽)) |
| 7 | 6 | oveqd 7413 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → (( 1 · 𝐴) · 1 ) = (( 1 · 𝐴)(.r‘𝐽) 1 )) |
| 8 | eqid 2762 | . . . . 5 ⊢ (Base‘𝐽) = (Base‘𝐽) | |
| 9 | eqid 2762 | . . . . 5 ⊢ (.r‘𝐽) = (.r‘𝐽) | |
| 10 | rng2idlring.1 | . . . . 5 ⊢ 1 = (1r‘𝐽) | |
| 11 | rng2idlring.u | . . . . . 6 ⊢ (𝜑 → 𝐽 ∈ Ring) | |
| 12 | 11 | adantr 484 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → 𝐽 ∈ Ring) |
| 13 | rng2idlring.r | . . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ Rng) | |
| 14 | rng2idlring.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑅) | |
| 15 | 13, 1, 3, 11, 14, 4, 10 | rngqiprngghmlem1 21357 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝐵) → ( 1 · 𝐴) ∈ (Base‘𝐽)) |
| 16 | 15 | adantrr 727 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 · 𝐴) ∈ (Base‘𝐽)) |
| 17 | 8, 9, 10, 12, 16 | ringridmd 20323 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → (( 1 · 𝐴)(.r‘𝐽) 1 ) = ( 1 · 𝐴)) |
| 18 | 7, 17 | eqtrd 2797 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → (( 1 · 𝐴) · 1 ) = ( 1 · 𝐴)) |
| 19 | 18 | oveq1d 7411 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ((( 1 · 𝐴) · 1 ) · 𝐶) = (( 1 · 𝐴) · 𝐶)) |
| 20 | 13 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → 𝑅 ∈ Rng) |
| 21 | 13, 1, 3, 11, 14, 4, 10 | rngqiprng1elbas 21356 | . . . . 5 ⊢ (𝜑 → 1 ∈ 𝐵) |
| 22 | 21 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → 1 ∈ 𝐵) |
| 23 | simprl 780 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → 𝐴 ∈ 𝐵) | |
| 24 | 14, 4 | rngcl 20210 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 1 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵) → ( 1 · 𝐴) ∈ 𝐵) |
| 25 | 20, 22, 23, 24 | syl3anc 1390 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ( 1 · 𝐴) ∈ 𝐵) |
| 26 | simprr 782 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → 𝐶 ∈ 𝐵) | |
| 27 | 14, 4 | rngass 20205 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ (( 1 · 𝐴) ∈ 𝐵 ∧ 1 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ((( 1 · 𝐴) · 1 ) · 𝐶) = (( 1 · 𝐴) · ( 1 · 𝐶))) |
| 28 | 20, 25, 22, 26, 27 | syl13anc 1391 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ((( 1 · 𝐴) · 1 ) · 𝐶) = (( 1 · 𝐴) · ( 1 · 𝐶))) |
| 29 | 14, 4 | rngass 20205 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ ( 1 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → (( 1 · 𝐴) · 𝐶) = ( 1 · (𝐴 · 𝐶))) |
| 30 | 20, 22, 23, 26, 29 | syl13anc 1391 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → (( 1 · 𝐴) · 𝐶) = ( 1 · (𝐴 · 𝐶))) |
| 31 | 19, 28, 30 | 3eqtr3d 2805 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → (( 1 · 𝐴) · ( 1 · 𝐶)) = ( 1 · (𝐴 · 𝐶))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1560 ∈ wcel 2142 ‘cfv 6521 (class class class)co 7396 Basecbs 17245 ↾s cress 17266 .rcmulr 17287 Rngcrng 20198 1rcur 20231 Ringcrg 20283 2Idealc2idl 21319 |
| 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-rmo 3367 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-4 12282 df-5 12283 df-6 12284 df-7 12285 df-8 12286 df-sets 17200 df-slot 17218 df-ndx 17230 df-base 17246 df-ress 17267 df-plusg 17299 df-mulr 17300 df-sca 17302 df-vsca 17303 df-ip 17304 df-0g 17470 df-mgm 18674 df-sgrp 18753 df-mnd 18769 df-grp 18978 df-minusg 18979 df-subg 19165 df-cmn 19822 df-abl 19823 df-mgp 20187 df-rng 20199 df-ur 20232 df-ring 20285 df-oppr 20386 df-subrng 20596 df-lss 20999 df-sra 21240 df-rgmod 21241 df-lidl 21278 df-2idl 21320 |
| This theorem is referenced by: rngqiprnglin 21372 |
| Copyright terms: Public domain | W3C validator |