| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > irredn0 | Structured version Visualization version GIF version | ||
| Description: The additive identity is not irreducible. (Contributed by Mario Carneiro, 4-Dec-2014.) |
| Ref | Expression |
|---|---|
| irredn0.i | ⊢ 𝐼 = (Irred‘𝑅) |
| irredn0.z | ⊢ 0 = (0g‘𝑅) |
| Ref | Expression |
|---|---|
| irredn0 | ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → 𝑋 ≠ 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2733 | . . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 2 | irredn0.z | . . . . . . . . . 10 ⊢ 0 = (0g‘𝑅) | |
| 3 | 1, 2 | ring0cl 20187 | . . . . . . . . 9 ⊢ (𝑅 ∈ Ring → 0 ∈ (Base‘𝑅)) |
| 4 | 3 | anim1i 615 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ ¬ 0 ∈ (Unit‘𝑅)) → ( 0 ∈ (Base‘𝑅) ∧ ¬ 0 ∈ (Unit‘𝑅))) |
| 5 | eldif 3908 | . . . . . . . 8 ⊢ ( 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅)) ↔ ( 0 ∈ (Base‘𝑅) ∧ ¬ 0 ∈ (Unit‘𝑅))) | |
| 6 | 4, 5 | sylibr 234 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ ¬ 0 ∈ (Unit‘𝑅)) → 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))) |
| 7 | eqid 2733 | . . . . . . . . . 10 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 8 | 1, 7, 2 | ringlz 20213 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 0 ∈ (Base‘𝑅)) → ( 0 (.r‘𝑅) 0 ) = 0 ) |
| 9 | 3, 8 | mpdan 687 | . . . . . . . 8 ⊢ (𝑅 ∈ Ring → ( 0 (.r‘𝑅) 0 ) = 0 ) |
| 10 | 9 | adantr 480 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ ¬ 0 ∈ (Unit‘𝑅)) → ( 0 (.r‘𝑅) 0 ) = 0 ) |
| 11 | oveq1 7359 | . . . . . . . . 9 ⊢ (𝑥 = 0 → (𝑥(.r‘𝑅)𝑦) = ( 0 (.r‘𝑅)𝑦)) | |
| 12 | 11 | eqeq1d 2735 | . . . . . . . 8 ⊢ (𝑥 = 0 → ((𝑥(.r‘𝑅)𝑦) = 0 ↔ ( 0 (.r‘𝑅)𝑦) = 0 )) |
| 13 | oveq2 7360 | . . . . . . . . 9 ⊢ (𝑦 = 0 → ( 0 (.r‘𝑅)𝑦) = ( 0 (.r‘𝑅) 0 )) | |
| 14 | 13 | eqeq1d 2735 | . . . . . . . 8 ⊢ (𝑦 = 0 → (( 0 (.r‘𝑅)𝑦) = 0 ↔ ( 0 (.r‘𝑅) 0 ) = 0 )) |
| 15 | 12, 14 | rspc2ev 3586 | . . . . . . 7 ⊢ (( 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅)) ∧ 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅)) ∧ ( 0 (.r‘𝑅) 0 ) = 0 ) → ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 ) |
| 16 | 6, 6, 10, 15 | syl3anc 1373 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ ¬ 0 ∈ (Unit‘𝑅)) → ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 ) |
| 17 | 16 | ex 412 | . . . . 5 ⊢ (𝑅 ∈ Ring → (¬ 0 ∈ (Unit‘𝑅) → ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 )) |
| 18 | 17 | orrd 863 | . . . 4 ⊢ (𝑅 ∈ Ring → ( 0 ∈ (Unit‘𝑅) ∨ ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 )) |
| 19 | eqid 2733 | . . . . . 6 ⊢ (Unit‘𝑅) = (Unit‘𝑅) | |
| 20 | irredn0.i | . . . . . 6 ⊢ 𝐼 = (Irred‘𝑅) | |
| 21 | eqid 2733 | . . . . . 6 ⊢ ((Base‘𝑅) ∖ (Unit‘𝑅)) = ((Base‘𝑅) ∖ (Unit‘𝑅)) | |
| 22 | 1, 19, 20, 21, 7 | isnirred 20340 | . . . . 5 ⊢ ( 0 ∈ (Base‘𝑅) → (¬ 0 ∈ 𝐼 ↔ ( 0 ∈ (Unit‘𝑅) ∨ ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 ))) |
| 23 | 3, 22 | syl 17 | . . . 4 ⊢ (𝑅 ∈ Ring → (¬ 0 ∈ 𝐼 ↔ ( 0 ∈ (Unit‘𝑅) ∨ ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 ))) |
| 24 | 18, 23 | mpbird 257 | . . 3 ⊢ (𝑅 ∈ Ring → ¬ 0 ∈ 𝐼) |
| 25 | 24 | adantr 480 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → ¬ 0 ∈ 𝐼) |
| 26 | simpr 484 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → 𝑋 ∈ 𝐼) | |
| 27 | eleq1 2821 | . . . 4 ⊢ (𝑋 = 0 → (𝑋 ∈ 𝐼 ↔ 0 ∈ 𝐼)) | |
| 28 | 26, 27 | syl5ibcom 245 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → (𝑋 = 0 → 0 ∈ 𝐼)) |
| 29 | 28 | necon3bd 2943 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → (¬ 0 ∈ 𝐼 → 𝑋 ≠ 0 )) |
| 30 | 25, 29 | mpd 15 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → 𝑋 ≠ 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1541 ∈ wcel 2113 ≠ wne 2929 ∃wrex 3057 ∖ cdif 3895 ‘cfv 6486 (class class class)co 7352 Basecbs 17122 .rcmulr 17164 0gc0g 17345 Ringcrg 20153 Unitcui 20275 Irredcir 20276 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-cnex 11069 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-2nd 7928 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-er 8628 df-en 8876 df-dom 8877 df-sdom 8878 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-nn 12133 df-2 12195 df-sets 17077 df-slot 17095 df-ndx 17107 df-base 17123 df-plusg 17176 df-0g 17347 df-mgm 18550 df-sgrp 18629 df-mnd 18645 df-grp 18851 df-minusg 18852 df-cmn 19696 df-abl 19697 df-mgp 20061 df-rng 20073 df-ur 20102 df-ring 20155 df-irred 20279 |
| This theorem is referenced by: prmirred 21413 irrednzr 33224 rprmirredb 33504 2sqr3minply 33814 cos9thpiminply 33822 |
| Copyright terms: Public domain | W3C validator |