Theorem irredcl 20532

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 2765	. . 3 ⊢ (Unit‘𝑅) = (Unit‘𝑅)
3		irredn0.i	. . 3 ⊢ 𝐼 = (Irred‘𝑅)
4		eqid 2765	. . 3 ⊢ (.r‘𝑅) = (.r‘𝑅)
5	1, 2, 3, 4	isirred2 20529	. 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 2146  ∀wral 3081  ‘cfv 6540  (class class class)co 7416  Basecbs 17287  ._rcmulr 17329  Unitcui 20463  Irredcir 20464

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 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7419  df-irred 20467

This theorem is used by:  irredrmul  20535  irredneg  20538  prmirred  21654  irrednzr  33610  rprmirredb  33862  irredminply  34146