Theorem irredcl 20565

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 20562	. 2 ⊢ (𝑋 ∈ 𝐼 ↔ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ (Unit‘𝑅) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥(.r‘𝑅)𝑦) = 𝑋 → (𝑥 ∈ (Unit‘𝑅) ∨ 𝑦 ∈ (Unit‘𝑅)))))
6	5	simp1bi 1163	1 ⊢ (𝑋 ∈ 𝐼 → 𝑋 ∈ 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∨ wo 861   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ‘cfv 6533  (class class class)co 7413  Basecbs 17301  ._rcmulr 17343  Unitcui 20496  Irredcir 20497

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 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398

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 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 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7416  df-irred 20500

This theorem is used by:  irredrmul  20568  irredneg  20571  prmirred  21687  irrednzr  33690  rprmirredb  33942  irredminply  34226