Theorem irredcl 20705

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 2763	. . 3 ⊢ (Unit‘𝑅) = (Unit‘𝑅)
3		irredn0.i	. . 3 ⊢ 𝐼 = (Irred‘𝑅)
4		eqid 2763	. . 3 ⊢ (.r‘𝑅) = (.r‘𝑅)
5	1, 2, 3, 4	isirred2 20702	. 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 2147  ∀wral 3080  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  ._rcmulr 17473  Unitcui 20636  Irredcir 20637

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-irred 20640

This theorem is used by:  irredrmul  20708  irredneg  20711  prmirred  21835  irrednzr  33910  rprmirredb  34168  irredminply  34459