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

Theorem isnirred 19379
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
StepHypRef Expression
1 irred.4 . . . . . . 7 𝑁 = (𝐵𝑈)
21eleq2i 2901 . . . . . 6 (𝑋𝑁𝑋 ∈ (𝐵𝑈))
3 eldif 3943 . . . . . 6 (𝑋 ∈ (𝐵𝑈) ↔ (𝑋𝐵 ∧ ¬ 𝑋𝑈))
42, 3bitri 276 . . . . 5 (𝑋𝑁 ↔ (𝑋𝐵 ∧ ¬ 𝑋𝑈))
54baibr 537 . . . 4 (𝑋𝐵 → (¬ 𝑋𝑈𝑋𝑁))
6 df-ne 3014 . . . . . . . . 9 ((𝑥 · 𝑦) ≠ 𝑋 ↔ ¬ (𝑥 · 𝑦) = 𝑋)
76ralbii 3162 . . . . . . . 8 (∀𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋 ↔ ∀𝑦𝑁 ¬ (𝑥 · 𝑦) = 𝑋)
8 ralnex 3233 . . . . . . . 8 (∀𝑦𝑁 ¬ (𝑥 · 𝑦) = 𝑋 ↔ ¬ ∃𝑦𝑁 (𝑥 · 𝑦) = 𝑋)
97, 8bitri 276 . . . . . . 7 (∀𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋 ↔ ¬ ∃𝑦𝑁 (𝑥 · 𝑦) = 𝑋)
109ralbii 3162 . . . . . 6 (∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋 ↔ ∀𝑥𝑁 ¬ ∃𝑦𝑁 (𝑥 · 𝑦) = 𝑋)
11 ralnex 3233 . . . . . 6 (∀𝑥𝑁 ¬ ∃𝑦𝑁 (𝑥 · 𝑦) = 𝑋 ↔ ¬ ∃𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) = 𝑋)
1210, 11bitr2i 277 . . . . 5 (¬ ∃𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) = 𝑋 ↔ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋)
1312a1i 11 . . . 4 (𝑋𝐵 → (¬ ∃𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) = 𝑋 ↔ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋))
145, 13anbi12d 630 . . 3 (𝑋𝐵 → ((¬ 𝑋𝑈 ∧ ¬ ∃𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) = 𝑋) ↔ (𝑋𝑁 ∧ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋)))
15 ioran 977 . . 3 (¬ (𝑋𝑈 ∨ ∃𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) = 𝑋) ↔ (¬ 𝑋𝑈 ∧ ¬ ∃𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) = 𝑋))
16 irred.1 . . . 4 𝐵 = (Base‘𝑅)
17 irred.2 . . . 4 𝑈 = (Unit‘𝑅)
18 irred.3 . . . 4 𝐼 = (Irred‘𝑅)
19 irred.5 . . . 4 · = (.r𝑅)
2016, 17, 18, 1, 19isirred 19378 . . 3 (𝑋𝐼 ↔ (𝑋𝑁 ∧ ∀𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) ≠ 𝑋))
2114, 15, 203bitr4g 315 . 2 (𝑋𝐵 → (¬ (𝑋𝑈 ∨ ∃𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) = 𝑋) ↔ 𝑋𝐼))
2221con1bid 357 1 (𝑋𝐵 → (¬ 𝑋𝐼 ↔ (𝑋𝑈 ∨ ∃𝑥𝑁𝑦𝑁 (𝑥 · 𝑦) = 𝑋)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  wo 841   = wceq 1528  wcel 2105  wne 3013  wral 3135  wrex 3136  cdif 3930  cfv 6348  (class class class)co 7145  Basecbs 16471  .rcmulr 16554  Unitcui 19318  Irredcir 19319
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ne 3014  df-ral 3140  df-rex 3141  df-rab 3144  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-iota 6307  df-fun 6350  df-fv 6356  df-ov 7148  df-irred 19322
This theorem is referenced by:  irredn0  19382  irredrmul  19386
  Copyright terms: Public domain W3C validator