Theorem isirred 20328

Description: An irreducible element of a ring is a non-unit that is not the product of two non-units. (Contributed by Mario Carneiro, 4-Dec-2014.)

Hypotheses

Ref	Expression
irred.1	⊢ 𝐵 = (Base‘𝑅)
irred.2	⊢ 𝑈 = (Unit‘𝑅)
irred.3	⊢ 𝐼 = (Irred‘𝑅)
irred.4	⊢ 𝑁 = (𝐵 ∖ 𝑈)
irred.5	⊢ · = (.r‘𝑅)

Assertion

Ref	Expression
isirred	⊢ (𝑋 ∈ 𝐼 ↔ (𝑋 ∈ 𝑁 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋))

Distinct variable groups:   𝑥,𝑦,𝑁   𝑥,𝑅,𝑦   𝑥,𝑋,𝑦

Allowed substitution hints:   𝐵(𝑥,𝑦)   · (𝑥,𝑦)   𝑈(𝑥,𝑦)   𝐼(𝑥,𝑦)

Proof of Theorem isirred

Dummy variables 𝑟 𝑏 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfvdm 6895	. . . 4 ⊢ (𝑋 ∈ (Irred‘𝑅) → 𝑅 ∈ dom Irred)
2		irred.3	. . . 4 ⊢ 𝐼 = (Irred‘𝑅)
3	1, 2	eleq2s 2846	. . 3 ⊢ (𝑋 ∈ 𝐼 → 𝑅 ∈ dom Irred)
4	3	elexd 3471	. 2 ⊢ (𝑋 ∈ 𝐼 → 𝑅 ∈ V)
5		eldifi 4094	. . . . . 6 ⊢ (𝑋 ∈ (𝐵 ∖ 𝑈) → 𝑋 ∈ 𝐵)
6		irred.4	. . . . . 6 ⊢ 𝑁 = (𝐵 ∖ 𝑈)
7	5, 6	eleq2s 2846	. . . . 5 ⊢ (𝑋 ∈ 𝑁 → 𝑋 ∈ 𝐵)
8		irred.1	. . . . 5 ⊢ 𝐵 = (Base‘𝑅)
9	7, 8	eleqtrdi 2838	. . . 4 ⊢ (𝑋 ∈ 𝑁 → 𝑋 ∈ (Base‘𝑅))
10	9	elfvexd 6897	. . 3 ⊢ (𝑋 ∈ 𝑁 → 𝑅 ∈ V)
11	10	adantr 480	. 2 ⊢ ((𝑋 ∈ 𝑁 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋) → 𝑅 ∈ V)
12		fvex 6871	. . . . . . . 8 ⊢ (Base‘𝑟) ∈ V
13		difexg 5284	. . . . . . . 8 ⊢ ((Base‘𝑟) ∈ V → ((Base‘𝑟) ∖ (Unit‘𝑟)) ∈ V)
14	12, 13	mp1i 13	. . . . . . 7 ⊢ (𝑟 = 𝑅 → ((Base‘𝑟) ∖ (Unit‘𝑟)) ∈ V)
15		simpr 484	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟)))
16		simpl 482	. . . . . . . . . . . . 13 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → 𝑟 = 𝑅)
17	16	fveq2d 6862	. . . . . . . . . . . 12 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (Base‘𝑟) = (Base‘𝑅))
18	17, 8	eqtr4di 2782	. . . . . . . . . . 11 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (Base‘𝑟) = 𝐵)
19	16	fveq2d 6862	. . . . . . . . . . . 12 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (Unit‘𝑟) = (Unit‘𝑅))
20		irred.2	. . . . . . . . . . . 12 ⊢ 𝑈 = (Unit‘𝑅)
21	19, 20	eqtr4di 2782	. . . . . . . . . . 11 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (Unit‘𝑟) = 𝑈)
22	18, 21	difeq12d 4090	. . . . . . . . . 10 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → ((Base‘𝑟) ∖ (Unit‘𝑟)) = (𝐵 ∖ 𝑈))
23	22, 6	eqtr4di 2782	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → ((Base‘𝑟) ∖ (Unit‘𝑟)) = 𝑁)
24	15, 23	eqtrd 2764	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → 𝑏 = 𝑁)
25	16	fveq2d 6862	. . . . . . . . . . . . 13 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (.r‘𝑟) = (.r‘𝑅))
26		irred.5	. . . . . . . . . . . . 13 ⊢ · = (.r‘𝑅)
27	25, 26	eqtr4di 2782	. . . . . . . . . . . 12 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (.r‘𝑟) = · )
28	27	oveqd 7404	. . . . . . . . . . 11 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (𝑥(.r‘𝑟)𝑦) = (𝑥 · 𝑦))
29	28	neeq1d 2984	. . . . . . . . . 10 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → ((𝑥(.r‘𝑟)𝑦) ≠ 𝑧 ↔ (𝑥 · 𝑦) ≠ 𝑧))
30	24, 29	raleqbidv 3319	. . . . . . . . 9 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (∀𝑦 ∈ 𝑏 (𝑥(.r‘𝑟)𝑦) ≠ 𝑧 ↔ ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑧))
31	24, 30	raleqbidv 3319	. . . . . . . 8 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 (𝑥(.r‘𝑟)𝑦) ≠ 𝑧 ↔ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑧))
32	24, 31	rabeqbidv 3424	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → {𝑧 ∈ 𝑏 ∣ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 (𝑥(.r‘𝑟)𝑦) ≠ 𝑧} = {𝑧 ∈ 𝑁 ∣ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑧})
33	14, 32	csbied 3898	. . . . . 6 ⊢ (𝑟 = 𝑅 → ⦋((Base‘𝑟) ∖ (Unit‘𝑟)) / 𝑏⦌{𝑧 ∈ 𝑏 ∣ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 (𝑥(.r‘𝑟)𝑦) ≠ 𝑧} = {𝑧 ∈ 𝑁 ∣ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑧})
34		df-irred 20268	. . . . . 6 ⊢ Irred = (𝑟 ∈ V ↦ ⦋((Base‘𝑟) ∖ (Unit‘𝑟)) / 𝑏⦌{𝑧 ∈ 𝑏 ∣ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 (𝑥(.r‘𝑟)𝑦) ≠ 𝑧})
35		fvex 6871	. . . . . . . . . 10 ⊢ (Base‘𝑅) ∈ V
36	8, 35	eqeltri 2824	. . . . . . . . 9 ⊢ 𝐵 ∈ V
37	36	difexi 5285	. . . . . . . 8 ⊢ (𝐵 ∖ 𝑈) ∈ V
38	6, 37	eqeltri 2824	. . . . . . 7 ⊢ 𝑁 ∈ V
39	38	rabex 5294	. . . . . 6 ⊢ {𝑧 ∈ 𝑁 ∣ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑧} ∈ V
40	33, 34, 39	fvmpt 6968	. . . . 5 ⊢ (𝑅 ∈ V → (Irred‘𝑅) = {𝑧 ∈ 𝑁 ∣ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑧})
41	2, 40	eqtrid 2776	. . . 4 ⊢ (𝑅 ∈ V → 𝐼 = {𝑧 ∈ 𝑁 ∣ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑧})
42	41	eleq2d 2814	. . 3 ⊢ (𝑅 ∈ V → (𝑋 ∈ 𝐼 ↔ 𝑋 ∈ {𝑧 ∈ 𝑁 ∣ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑧}))
43		neeq2 2988	. . . . 5 ⊢ (𝑧 = 𝑋 → ((𝑥 · 𝑦) ≠ 𝑧 ↔ (𝑥 · 𝑦) ≠ 𝑋))
44	43	2ralbidv 3201	. . . 4 ⊢ (𝑧 = 𝑋 → (∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑧 ↔ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋))
45	44	elrab 3659	. . 3 ⊢ (𝑋 ∈ {𝑧 ∈ 𝑁 ∣ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑧} ↔ (𝑋 ∈ 𝑁 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋))
46	42, 45	bitrdi 287	. 2 ⊢ (𝑅 ∈ V → (𝑋 ∈ 𝐼 ↔ (𝑋 ∈ 𝑁 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋)))
47	4, 11, 46	pm5.21nii 378	1 ⊢ (𝑋 ∈ 𝐼 ↔ (𝑋 ∈ 𝑁 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  {crab 3405  Vcvv 3447  ⦋csb 3862   ∖ cdif 3911  dom cdm 5638  ‘cfv 6511  (class class class)co 7387  Basecbs 17179  ._rcmulr 17221  Unitcui 20264  Irredcir 20265

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-iota 6464  df-fun 6513  df-fv 6519  df-ov 7390  df-irred 20268

This theorem is referenced by:  isnirred  20329  isirred2  20330  opprirred  20331  mxidlirredi  33442  rprmirred  33502  ply1dg3rt0irred  33551