Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > irrednu | Structured version Visualization version GIF version |
Description: An irreducible element is not a unit. (Contributed by Mario Carneiro, 4-Dec-2014.) |
Ref | Expression |
---|---|
irredn0.i | ⊢ 𝐼 = (Irred‘𝑅) |
irrednu.u | ⊢ 𝑈 = (Unit‘𝑅) |
Ref | Expression |
---|---|
irrednu | ⊢ (𝑋 ∈ 𝐼 → ¬ 𝑋 ∈ 𝑈) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2823 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
2 | irrednu.u | . . 3 ⊢ 𝑈 = (Unit‘𝑅) | |
3 | irredn0.i | . . 3 ⊢ 𝐼 = (Irred‘𝑅) | |
4 | eqid 2823 | . . 3 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
5 | 1, 2, 3, 4 | isirred2 19453 | . 2 ⊢ (𝑋 ∈ 𝐼 ↔ (𝑋 ∈ (Base‘𝑅) ∧ ¬ 𝑋 ∈ 𝑈 ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = 𝑋 → (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈)))) |
6 | 5 | simp2bi 1142 | 1 ⊢ (𝑋 ∈ 𝐼 → ¬ 𝑋 ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∨ wo 843 = wceq 1537 ∈ wcel 2114 ∀wral 3140 ‘cfv 6357 (class class class)co 7158 Basecbs 16485 .rcmulr 16568 Unitcui 19391 Irredcir 19392 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-iota 6316 df-fun 6359 df-fv 6365 df-ov 7161 df-irred 19395 |
This theorem is referenced by: irredn1 19458 |
Copyright terms: Public domain | W3C validator |