| 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 2762 | . . . . . . . . . 10 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 2 | irredn0.z | . . . . . . . . . 10 ⊢ 0 = (0g‘𝑅) | |
| 3 | 1, 2 | ring0cl 20414 | . . . . . . . . 9 ⊢ (𝑅 ∈ Ring → 0 ∈ (Base‘𝑅)) |
| 4 | 3 | anim1i 627 | . . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ ¬ 0 ∈ (Unit‘𝑅)) → ( 0 ∈ (Base‘𝑅) ∧ ¬ 0 ∈ (Unit‘𝑅))) |
| 5 | eldif 3912 | . . . . . . . 8 ⊢ ( 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅)) ↔ ( 0 ∈ (Base‘𝑅) ∧ ¬ 0 ∈ (Unit‘𝑅))) | |
| 6 | 4, 5 | sylibr 237 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ ¬ 0 ∈ (Unit‘𝑅)) → 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))) |
| 7 | eqid 2762 | . . . . . . . . . 10 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 8 | 1, 7, 2 | ringlz 20441 | . . . . . . . . 9 ⊢ ((𝑅 ∈ Ring ∧ 0 ∈ (Base‘𝑅)) → ( 0 (.r‘𝑅) 0 ) = 0 ) |
| 9 | 3, 8 | mpdan 700 | . . . . . . . 8 ⊢ (𝑅 ∈ Ring → ( 0 (.r‘𝑅) 0 ) = 0 ) |
| 10 | 9 | adantr 486 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ ¬ 0 ∈ (Unit‘𝑅)) → ( 0 (.r‘𝑅) 0 ) = 0 ) |
| 11 | oveq1 7424 | . . . . . . . . 9 ⊢ (𝑥 = 0 → (𝑥(.r‘𝑅)𝑦) = ( 0 (.r‘𝑅)𝑦)) | |
| 12 | 11 | eqeq1d 2764 | . . . . . . . 8 ⊢ (𝑥 = 0 → ((𝑥(.r‘𝑅)𝑦) = 0 ↔ ( 0 (.r‘𝑅)𝑦) = 0 )) |
| 13 | oveq2 7425 | . . . . . . . . 9 ⊢ (𝑦 = 0 → ( 0 (.r‘𝑅)𝑦) = ( 0 (.r‘𝑅) 0 )) | |
| 14 | 13 | eqeq1d 2764 | . . . . . . . 8 ⊢ (𝑦 = 0 → (( 0 (.r‘𝑅)𝑦) = 0 ↔ ( 0 (.r‘𝑅) 0 ) = 0 )) |
| 15 | 12, 14 | rspc2ev 3592 | . . . . . . 7 ⊢ (( 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅)) ∧ 0 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅)) ∧ ( 0 (.r‘𝑅) 0 ) = 0 ) → ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 ) |
| 16 | 6, 6, 10, 15 | syl3anc 1398 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ ¬ 0 ∈ (Unit‘𝑅)) → ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 ) |
| 17 | 16 | ex 418 | . . . . 5 ⊢ (𝑅 ∈ Ring → (¬ 0 ∈ (Unit‘𝑅) → ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 )) |
| 18 | 17 | orrd 877 | . . . 4 ⊢ (𝑅 ∈ Ring → ( 0 ∈ (Unit‘𝑅) ∨ ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 )) |
| 19 | eqid 2762 | . . . . . 6 ⊢ (Unit‘𝑅) = (Unit‘𝑅) | |
| 20 | irredn0.i | . . . . . 6 ⊢ 𝐼 = (Irred‘𝑅) | |
| 21 | eqid 2762 | . . . . . 6 ⊢ ((Base‘𝑅) ∖ (Unit‘𝑅)) = ((Base‘𝑅) ∖ (Unit‘𝑅)) | |
| 22 | 1, 19, 20, 21, 7 | isnirred 20567 | . . . . 5 ⊢ ( 0 ∈ (Base‘𝑅) → (¬ 0 ∈ 𝐼 ↔ ( 0 ∈ (Unit‘𝑅) ∨ ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 ))) |
| 23 | 3, 22 | syl 18 | . . . 4 ⊢ (𝑅 ∈ Ring → (¬ 0 ∈ 𝐼 ↔ ( 0 ∈ (Unit‘𝑅) ∨ ∃𝑥 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))∃𝑦 ∈ ((Base‘𝑅) ∖ (Unit‘𝑅))(𝑥(.r‘𝑅)𝑦) = 0 ))) |
| 24 | 18, 23 | mpbird 260 | . . 3 ⊢ (𝑅 ∈ Ring → ¬ 0 ∈ 𝐼) |
| 25 | 24 | adantr 486 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → ¬ 0 ∈ 𝐼) |
| 26 | simpr 490 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → 𝑋 ∈ 𝐼) | |
| 27 | eleq1 2850 | . . . 4 ⊢ (𝑋 = 0 → (𝑋 ∈ 𝐼 ↔ 0 ∈ 𝐼)) | |
| 28 | 26, 27 | syl5ibcom 248 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → (𝑋 = 0 → 0 ∈ 𝐼)) |
| 29 | 28 | necon3bd 2971 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → (¬ 0 ∈ 𝐼 → 𝑋 ≠ 0 )) |
| 30 | 25, 29 | mpd 16 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐼) → 𝑋 ≠ 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 ∃wrex 3088 ∖ cdif 3899 ‘cfv 6537 (class class class)co 7417 Basecbs 17307 .rcmulr 17349 0gc0g 17530 Ringcrg 20378 Unitcui 20502 Irredcir 20503 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-nn 12262 df-2 12331 df-sets 17262 df-slot 17280 df-ndx 17292 df-base 17308 df-plusg 17361 df-0g 17532 df-mgm 18736 df-sgrp 18827 df-mnd 18843 df-grp 19066 df-minusg 19067 df-cmn 19915 df-abl 19916 df-mgp 20280 df-rng 20294 df-ur 20327 df-ring 20380 df-irred 20506 |
| This theorem is used by: prmirred 21693 irrednzr 33698 rprmirredb 33950 2sqr3minply 34298 cos9thpiminply 34306 |
| Copyright terms: Public domain | W3C validator |