Theorem irrednu 20540

Description: An irreducible element is not a unit. (Contributed by Mario Carneiro, 4-Dec-2014.)

Hypotheses

Ref	Expression
irredn0.i	⊢ 𝐼 = (Irred‘𝑅)
irrednu.u	⊢ 𝑈 = (Unit‘𝑅)

Assertion

Ref	Expression
irrednu	⊢ (𝑋 ∈ 𝐼 → ¬ 𝑋 ∈ 𝑈)

Proof of Theorem irrednu

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2766	. . 3 ⊢ (Base‘𝑅) = (Base‘𝑅)
2		irrednu.u	. . 3 ⊢ 𝑈 = (Unit‘𝑅)
3		irredn0.i	. . 3 ⊢ 𝐼 = (Irred‘𝑅)
4		eqid 2766	. . 3 ⊢ (.r‘𝑅) = (.r‘𝑅)
5	1, 2, 3, 4	isirred2 20536	. 2 ⊢ (𝑋 ∈ 𝐼 ↔ (𝑋 ∈ (Base‘𝑅) ∧ ¬ 𝑋 ∈ 𝑈 ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(.r‘𝑅)𝑦) = 𝑋 → (𝑥 ∈ 𝑈 ∨ 𝑦 ∈ 𝑈))))
6	5	simp2bi 1164	1 ⊢ (𝑋 ∈ 𝐼 → ¬ 𝑋 ∈ 𝑈)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∨ wo 861   = wceq 1570   ∈ wcel 2146  ∀wral 3082  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  ._rcmulr 17336  Unitcui 20470  Irredcir 20471

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-irred 20474

This theorem is used by:  irredn1  20541  mxidlirred  33786  rprmirredb  33853  irredminply  34137