Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  isirred Structured version   Visualization version   GIF version

Theorem isirred 19449
 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.
StepHypRef Expression
1 elfvdm 6678 . . . 4 (𝑋 ∈ (Irred‘𝑅) → 𝑅 ∈ dom Irred)
2 irred.3 . . . 4 𝐼 = (Irred‘𝑅)
31, 2eleq2s 2908 . . 3 (𝑋𝐼𝑅 ∈ dom Irred)
43elexd 3461 . 2 (𝑋𝐼𝑅 ∈ V)
5 eldifi 4054 . . . . . 6 (𝑋 ∈ (𝐵𝑈) → 𝑋𝐵)
6 irred.4 . . . . . 6 𝑁 = (𝐵𝑈)
75, 6eleq2s 2908 . . . . 5 (𝑋𝑁𝑋𝐵)
8 irred.1 . . . . 5 𝐵 = (Base‘𝑅)
97, 8eleqtrdi 2900 . . . 4 (𝑋𝑁𝑋 ∈ (Base‘𝑅))
109elfvexd 6680 . . 3 (𝑋𝑁𝑅 ∈ V)
1110adantr 484 . 2 ((𝑋𝑁 ∧ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋) → 𝑅 ∈ V)
12 fvex 6659 . . . . . . . 8 (Base‘𝑟) ∈ V
13 difexg 5196 . . . . . . . 8 ((Base‘𝑟) ∈ V → ((Base‘𝑟) ∖ (Unit‘𝑟)) ∈ V)
1412, 13mp1i 13 . . . . . . 7 (𝑟 = 𝑅 → ((Base‘𝑟) ∖ (Unit‘𝑟)) ∈ V)
15 simpr 488 . . . . . . . . 9 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → 𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟)))
16 simpl 486 . . . . . . . . . . . . 13 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → 𝑟 = 𝑅)
1716fveq2d 6650 . . . . . . . . . . . 12 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (Base‘𝑟) = (Base‘𝑅))
1817, 8eqtr4di 2851 . . . . . . . . . . 11 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (Base‘𝑟) = 𝐵)
1916fveq2d 6650 . . . . . . . . . . . 12 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (Unit‘𝑟) = (Unit‘𝑅))
20 irred.2 . . . . . . . . . . . 12 𝑈 = (Unit‘𝑅)
2119, 20eqtr4di 2851 . . . . . . . . . . 11 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (Unit‘𝑟) = 𝑈)
2218, 21difeq12d 4051 . . . . . . . . . 10 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → ((Base‘𝑟) ∖ (Unit‘𝑟)) = (𝐵𝑈))
2322, 6eqtr4di 2851 . . . . . . . . 9 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → ((Base‘𝑟) ∖ (Unit‘𝑟)) = 𝑁)
2415, 23eqtrd 2833 . . . . . . . 8 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → 𝑏 = 𝑁)
2516fveq2d 6650 . . . . . . . . . . . . 13 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (.r𝑟) = (.r𝑅))
26 irred.5 . . . . . . . . . . . . 13 · = (.r𝑅)
2725, 26eqtr4di 2851 . . . . . . . . . . . 12 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (.r𝑟) = · )
2827oveqd 7153 . . . . . . . . . . 11 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (𝑥(.r𝑟)𝑦) = (𝑥 · 𝑦))
2928neeq1d 3046 . . . . . . . . . 10 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → ((𝑥(.r𝑟)𝑦) ≠ 𝑧 ↔ (𝑥 · 𝑦) ≠ 𝑧))
3024, 29raleqbidv 3354 . . . . . . . . 9 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (∀𝑦𝑏 (𝑥(.r𝑟)𝑦) ≠ 𝑧 ↔ ∀𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑧))
3124, 30raleqbidv 3354 . . . . . . . 8 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → (∀𝑥𝑏𝑦𝑏 (𝑥(.r𝑟)𝑦) ≠ 𝑧 ↔ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑧))
3224, 31rabeqbidv 3433 . . . . . . 7 ((𝑟 = 𝑅𝑏 = ((Base‘𝑟) ∖ (Unit‘𝑟))) → {𝑧𝑏 ∣ ∀𝑥𝑏𝑦𝑏 (𝑥(.r𝑟)𝑦) ≠ 𝑧} = {𝑧𝑁 ∣ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑧})
3314, 32csbied 3864 . . . . . 6 (𝑟 = 𝑅((Base‘𝑟) ∖ (Unit‘𝑟)) / 𝑏{𝑧𝑏 ∣ ∀𝑥𝑏𝑦𝑏 (𝑥(.r𝑟)𝑦) ≠ 𝑧} = {𝑧𝑁 ∣ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑧})
34 df-irred 19393 . . . . . 6 Irred = (𝑟 ∈ V ↦ ((Base‘𝑟) ∖ (Unit‘𝑟)) / 𝑏{𝑧𝑏 ∣ ∀𝑥𝑏𝑦𝑏 (𝑥(.r𝑟)𝑦) ≠ 𝑧})
35 fvex 6659 . . . . . . . . . 10 (Base‘𝑅) ∈ V
368, 35eqeltri 2886 . . . . . . . . 9 𝐵 ∈ V
3736difexi 5197 . . . . . . . 8 (𝐵𝑈) ∈ V
386, 37eqeltri 2886 . . . . . . 7 𝑁 ∈ V
3938rabex 5200 . . . . . 6 {𝑧𝑁 ∣ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑧} ∈ V
4033, 34, 39fvmpt 6746 . . . . 5 (𝑅 ∈ V → (Irred‘𝑅) = {𝑧𝑁 ∣ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑧})
412, 40syl5eq 2845 . . . 4 (𝑅 ∈ V → 𝐼 = {𝑧𝑁 ∣ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑧})
4241eleq2d 2875 . . 3 (𝑅 ∈ V → (𝑋𝐼𝑋 ∈ {𝑧𝑁 ∣ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑧}))
43 neeq2 3050 . . . . 5 (𝑧 = 𝑋 → ((𝑥 · 𝑦) ≠ 𝑧 ↔ (𝑥 · 𝑦) ≠ 𝑋))
44432ralbidv 3164 . . . 4 (𝑧 = 𝑋 → (∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑧 ↔ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋))
4544elrab 3628 . . 3 (𝑋 ∈ {𝑧𝑁 ∣ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑧} ↔ (𝑋𝑁 ∧ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋))
4642, 45syl6bb 290 . 2 (𝑅 ∈ V → (𝑋𝐼 ↔ (𝑋𝑁 ∧ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋)))
474, 11, 46pm5.21nii 383 1 (𝑋𝐼 ↔ (𝑋𝑁 ∧ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111   ≠ wne 2987  ∀wral 3106  {crab 3110  Vcvv 3441  ⦋csb 3828   ∖ cdif 3878  dom cdm 5520  ‘cfv 6325  (class class class)co 7136  Basecbs 16478  .rcmulr 16561  Unitcui 19389  Irredcir 19390 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5168  ax-nul 5175  ax-pow 5232  ax-pr 5296 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4802  df-br 5032  df-opab 5094  df-mpt 5112  df-id 5426  df-xp 5526  df-rel 5527  df-cnv 5528  df-co 5529  df-dm 5530  df-iota 6284  df-fun 6327  df-fv 6333  df-ov 7139  df-irred 19393 This theorem is referenced by:  isnirred  19450  isirred2  19451  opprirred  19452
 Copyright terms: Public domain W3C validator