| 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 2737 | . . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 2 | irredn0.z | . . . . . . . . . 10 ⊢ 0 = (0g‘𝑅) | |
| 3 | 1, 2 | ring0cl 20239 | . . . . . . . . 9 ⊢ (𝑅 ∈ Ring → 0 ∈ (Base‘𝑅)) |
| 4 | 3 | anim1i 616 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ ¬ 0 ∈ (Unit‘𝑅)) → ( 0 ∈ (Base‘𝑅) ∧ ¬ 0 ∈ (Unit‘𝑅))) |
| 5 | eldif 3900 | . . . . . . . 8 ⊢ ( 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅)) ↔ ( 0 ∈ (Base‘𝑅) ∧ ¬ 0 ∈ (Unit‘𝑅))) | |
| 6 | 4, 5 | sylibr 234 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ ¬ 0 ∈ (Unit‘𝑅)) → 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))) |
| 7 | eqid 2737 | . . . . . . . . . 10 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 8 | 1, 7, 2 | ringlz 20265 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 0 ∈ (Base‘𝑅)) → ( 0 (.r‘𝑅) 0 ) = 0 ) |
| 9 | 3, 8 | mpdan 688 | . . . . . . . 8 ⊢ (𝑅 ∈ Ring → ( 0 (.r‘𝑅) 0 ) = 0 ) |
| 10 | 9 | adantr 480 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ ¬ 0 ∈ (Unit‘𝑅)) → ( 0 (.r‘𝑅) 0 ) = 0 ) |
| 11 | oveq1 7367 | . . . . . . . . 9 ⊢ (𝑥 = 0 → (𝑥(.r‘𝑅)𝑦) = ( 0 (.r‘𝑅)𝑦)) | |
| 12 | 11 | eqeq1d 2739 | . . . . . . . 8 ⊢ (𝑥 = 0 → ((𝑥(.r‘𝑅)𝑦) = 0 ↔ ( 0 (.r‘𝑅)𝑦) = 0 )) |
| 13 | oveq2 7368 | . . . . . . . . 9 ⊢ (𝑦 = 0 → ( 0 (.r‘𝑅)𝑦) = ( 0 (.r‘𝑅) 0 )) | |
| 14 | 13 | eqeq1d 2739 | . . . . . . . 8 ⊢ (𝑦 = 0 → (( 0 (.r‘𝑅)𝑦) = 0 ↔ ( 0 (.r‘𝑅) 0 ) = 0 )) |
| 15 | 12, 14 | rspc2ev 3578 | . . . . . . 7 ⊢ (( 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅)) ∧ 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅)) ∧ ( 0 (.r‘𝑅) 0 ) = 0 ) → ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 ) |
| 16 | 6, 6, 10, 15 | syl3anc 1374 | . . . . . 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 864 | . . . 4 ⊢ (𝑅 ∈ Ring → ( 0 ∈ (Unit‘𝑅) ∨ ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 )) |
| 19 | eqid 2737 | . . . . . 6 ⊢ (Unit‘𝑅) = (Unit‘𝑅) | |
| 20 | irredn0.i | . . . . . 6 ⊢ 𝐼 = (Irred‘𝑅) | |
| 21 | eqid 2737 | . . . . . 6 ⊢ ((Base‘𝑅) ∖ (Unit‘𝑅)) = ((Base‘𝑅) ∖ (Unit‘𝑅)) | |
| 22 | 1, 19, 20, 21, 7 | isnirred 20391 | . . . . 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 2825 | . . . 4 ⊢ (𝑋 = 0 → (𝑋 ∈ 𝐼 ↔ 0 ∈ 𝐼)) | |
| 28 | 26, 27 | syl5ibcom 245 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → (𝑋 = 0 → 0 ∈ 𝐼)) |
| 29 | 28 | necon3bd 2947 | . 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 848 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∃wrex 3062 ∖ cdif 3887 ‘cfv 6492 (class class class)co 7360 Basecbs 17170 .rcmulr 17212 0gc0g 17393 Ringcrg 20205 Unitcui 20326 Irredcir 20327 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-plusg 17224 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18903 df-minusg 18904 df-cmn 19748 df-abl 19749 df-mgp 20113 df-rng 20125 df-ur 20154 df-ring 20207 df-irred 20330 |
| This theorem is referenced by: prmirred 21464 irrednzr 33326 rprmirredb 33607 2sqr3minply 33940 cos9thpiminply 33948 |
| Copyright terms: Public domain | W3C validator |