Theorem isnirred 20329

Description: The property of being a non-irreducible (reducible) element in a ring. (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
isnirred	⊢ (𝑋 ∈ 𝐵 → (¬ 𝑋 ∈ 𝐼 ↔ (𝑋 ∈ 𝑈 ∨ ∃𝑥 ∈ 𝑁 ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋)))

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

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

Proof of Theorem isnirred

Step	Hyp	Ref	Expression
1		irred.4	. . . . . . 7 ⊢ 𝑁 = (𝐵 ∖ 𝑈)
2	1	eleq2i 2820	. . . . . 6 ⊢ (𝑋 ∈ 𝑁 ↔ 𝑋 ∈ (𝐵 ∖ 𝑈))
3		eldif 3924	. . . . . 6 ⊢ (𝑋 ∈ (𝐵 ∖ 𝑈) ↔ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ 𝑈))
4	2, 3	bitri 275	. . . . 5 ⊢ (𝑋 ∈ 𝑁 ↔ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ∈ 𝑈))
5	4	baibr 536	. . . 4 ⊢ (𝑋 ∈ 𝐵 → (¬ 𝑋 ∈ 𝑈 ↔ 𝑋 ∈ 𝑁))
6		df-ne 2926	. . . . . . . . 9 ⊢ ((𝑥 · 𝑦) ≠ 𝑋 ↔ ¬ (𝑥 · 𝑦) = 𝑋)
7	6	ralbii 3075	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋 ↔ ∀𝑦 ∈ 𝑁 ¬ (𝑥 · 𝑦) = 𝑋)
8		ralnex 3055	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝑁 ¬ (𝑥 · 𝑦) = 𝑋 ↔ ¬ ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋)
9	7, 8	bitri 275	. . . . . . 7 ⊢ (∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋 ↔ ¬ ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋)
10	9	ralbii 3075	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋 ↔ ∀𝑥 ∈ 𝑁 ¬ ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋)
11		ralnex 3055	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑁 ¬ ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋 ↔ ¬ ∃𝑥 ∈ 𝑁 ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋)
12	10, 11	bitr2i 276	. . . . 5 ⊢ (¬ ∃𝑥 ∈ 𝑁 ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋 ↔ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋)
13	12	a1i 11	. . . 4 ⊢ (𝑋 ∈ 𝐵 → (¬ ∃𝑥 ∈ 𝑁 ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋 ↔ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋))
14	5, 13	anbi12d 632	. . 3 ⊢ (𝑋 ∈ 𝐵 → ((¬ 𝑋 ∈ 𝑈 ∧ ¬ ∃𝑥 ∈ 𝑁 ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋) ↔ (𝑋 ∈ 𝑁 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋)))
15		ioran 985	. . 3 ⊢ (¬ (𝑋 ∈ 𝑈 ∨ ∃𝑥 ∈ 𝑁 ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋) ↔ (¬ 𝑋 ∈ 𝑈 ∧ ¬ ∃𝑥 ∈ 𝑁 ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋))
16		irred.1	. . . 4 ⊢ 𝐵 = (Base‘𝑅)
17		irred.2	. . . 4 ⊢ 𝑈 = (Unit‘𝑅)
18		irred.3	. . . 4 ⊢ 𝐼 = (Irred‘𝑅)
19		irred.5	. . . 4 ⊢ · = (.r‘𝑅)
20	16, 17, 18, 1, 19	isirred 20328	. . 3 ⊢ (𝑋 ∈ 𝐼 ↔ (𝑋 ∈ 𝑁 ∧ ∀𝑥 ∈ 𝑁 ∀𝑦 ∈ 𝑁 (𝑥 · 𝑦) ≠ 𝑋))
21	14, 15, 20	3bitr4g 314	. 2 ⊢ (𝑋 ∈ 𝐵 → (¬ (𝑋 ∈ 𝑈 ∨ ∃𝑥 ∈ 𝑁 ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋) ↔ 𝑋 ∈ 𝐼))
22	21	con1bid 355	1 ⊢ (𝑋 ∈ 𝐵 → (¬ 𝑋 ∈ 𝐼 ↔ (𝑋 ∈ 𝑈 ∨ ∃𝑥 ∈ 𝑁 ∃𝑦 ∈ 𝑁 (𝑥 · 𝑦) = 𝑋)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  ∃wrex 3053   ∖ cdif 3911  ‘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:  irredn0  20332  irredrmul  20336