Theorem irredcl 20661

Description: An irreducible element is in the ring. (Contributed by Mario Carneiro, 4-Dec-2014.)

Hypotheses

Ref	Expression
irredn0.i	⊢ 𝐼 = (Irred‘𝑅)
irredcl.b	⊢ 𝐵 = (Base‘𝑅)

Assertion

Ref	Expression
irredcl	⊢ (𝑋 ∈ 𝐼 → 𝑋 ∈ 𝐵)

Proof of Theorem irredcl

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

Step	Hyp	Ref	Expression
1		irredcl.b	. . 3 ⊢ 𝐵 = (Base‘𝑅)
2		eqid 2760	. . 3 ⊢ (Unit‘𝑅) = (Unit‘𝑅)
3		irredn0.i	. . 3 ⊢ 𝐼 = (Irred‘𝑅)
4		eqid 2760	. . 3 ⊢ (.r‘𝑅) = (.r‘𝑅)
5	1, 2, 3, 4	isirred2 20658	. 2 ⊢ (𝑋 ∈ 𝐼 ↔ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ (Unit‘𝑅) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 𝑋 → (𝑥 ∈ (Unit‘𝑅) ∨ 𝑦 ∈ (Unit‘𝑅)))))
6	5	simp1bi 1163	1 ⊢ (𝑋 ∈ 𝐼 → 𝑋 ∈ 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∨ wo 861   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ‘cfv 6541  (class class class)co 7422  Basecbs 17394  ._rcmulr 17436  Unitcui 20592  Irredcir 20593

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6496  df-fun 6543  df-fv 6549  df-ov 7425  df-irred 20596

This theorem is used by:  irredrmul  20664  irredneg  20667  prmirred  21787  irrednzr  33859  rprmirredb  34112  irredminply  34396