Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rprmval Structured version   Visualization version   GIF version

Theorem rprmval 33787
Description: The prime elements of a ring 𝑅. (Contributed by Thierry Arnoux, 1-Jul-2024.)
Hypotheses
Ref Expression
rprmval.b 𝐵 = (Base‘𝑅)
rprmval.u 𝑈 = (Unit‘𝑅)
rprmval.1 0 = (0g𝑅)
rprmval.m · = (.r𝑅)
rprmval.d = (∥r𝑅)
Assertion
Ref Expression
rprmval (𝑅𝑉 → (RPrime‘𝑅) = {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥𝐵𝑦𝐵 (𝑝 (𝑥 · 𝑦) → (𝑝 𝑥𝑝 𝑦))})
Distinct variable groups:   0 ,𝑝   𝐵,𝑝   𝑅,𝑝,𝑥,𝑦   𝑈,𝑝
Allowed substitution hints:   𝐵(𝑥,𝑦)   (𝑥,𝑦,𝑝)   · (𝑥,𝑦,𝑝)   𝑈(𝑥,𝑦)   𝑉(𝑥,𝑦,𝑝)   0 (𝑥,𝑦)

Proof of Theorem rprmval
Dummy variables 𝑏 𝑟 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-rprm 20516 . 2 RPrime = (𝑟 ∈ V ↦ (Base‘𝑟) / 𝑏{𝑝 ∈ (𝑏 ∖ ((Unit‘𝑟) ∪ {(0g𝑟)})) ∣ ∀𝑥𝑏𝑦𝑏 [(∥r𝑟) / 𝑑](𝑝𝑑(𝑥(.r𝑟)𝑦) → (𝑝𝑑𝑥𝑝𝑑𝑦))})
2 fvexd 6898 . . 3 (𝑟 = 𝑅 → (Base‘𝑟) ∈ V)
3 simpr 489 . . . . . . 7 ((𝑟 = 𝑅𝑏 = (Base‘𝑟)) → 𝑏 = (Base‘𝑟))
4 fveq2 6883 . . . . . . . 8 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
54adantr 485 . . . . . . 7 ((𝑟 = 𝑅𝑏 = (Base‘𝑟)) → (Base‘𝑟) = (Base‘𝑅))
63, 5eqtrd 2798 . . . . . 6 ((𝑟 = 𝑅𝑏 = (Base‘𝑟)) → 𝑏 = (Base‘𝑅))
7 rprmval.b . . . . . 6 𝐵 = (Base‘𝑅)
86, 7eqtr4di 2816 . . . . 5 ((𝑟 = 𝑅𝑏 = (Base‘𝑟)) → 𝑏 = 𝐵)
9 fveq2 6883 . . . . . . . 8 (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
10 rprmval.u . . . . . . . 8 𝑈 = (Unit‘𝑅)
119, 10eqtr4di 2816 . . . . . . 7 (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
12 fveq2 6883 . . . . . . . . 9 (𝑟 = 𝑅 → (0g𝑟) = (0g𝑅))
13 rprmval.1 . . . . . . . . 9 0 = (0g𝑅)
1412, 13eqtr4di 2816 . . . . . . . 8 (𝑟 = 𝑅 → (0g𝑟) = 0 )
1514sneqd 4602 . . . . . . 7 (𝑟 = 𝑅 → {(0g𝑟)} = { 0 })
1611, 15uneq12d 4124 . . . . . 6 (𝑟 = 𝑅 → ((Unit‘𝑟) ∪ {(0g𝑟)}) = (𝑈 ∪ { 0 }))
1716adantr 485 . . . . 5 ((𝑟 = 𝑅𝑏 = (Base‘𝑟)) → ((Unit‘𝑟) ∪ {(0g𝑟)}) = (𝑈 ∪ { 0 }))
188, 17difeq12d 4083 . . . 4 ((𝑟 = 𝑅𝑏 = (Base‘𝑟)) → (𝑏 ∖ ((Unit‘𝑟) ∪ {(0g𝑟)})) = (𝐵 ∖ (𝑈 ∪ { 0 })))
19 fvexd 6898 . . . . . . 7 ((𝑟 = 𝑅𝑏 = (Base‘𝑟)) → (∥r𝑟) ∈ V)
20 eqidd 2764 . . . . . . . . 9 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → 𝑝 = 𝑝)
21 simpr 489 . . . . . . . . . . 11 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → 𝑑 = (∥r𝑟))
22 fveq2 6883 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (∥r𝑟) = (∥r𝑅))
2322ad2antrr 738 . . . . . . . . . . 11 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → (∥r𝑟) = (∥r𝑅))
2421, 23eqtrd 2798 . . . . . . . . . 10 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → 𝑑 = (∥r𝑅))
25 rprmval.d . . . . . . . . . 10 = (∥r𝑅)
2624, 25eqtr4di 2816 . . . . . . . . 9 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → 𝑑 = )
27 fveq2 6883 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (.r𝑟) = (.r𝑅))
28 rprmval.m . . . . . . . . . . . 12 · = (.r𝑅)
2927, 28eqtr4di 2816 . . . . . . . . . . 11 (𝑟 = 𝑅 → (.r𝑟) = · )
3029ad2antrr 738 . . . . . . . . . 10 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → (.r𝑟) = · )
3130oveqd 7429 . . . . . . . . 9 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → (𝑥(.r𝑟)𝑦) = (𝑥 · 𝑦))
3220, 26, 31breq123d 5124 . . . . . . . 8 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → (𝑝𝑑(𝑥(.r𝑟)𝑦) ↔ 𝑝 (𝑥 · 𝑦)))
3326breqd 5121 . . . . . . . . 9 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → (𝑝𝑑𝑥𝑝 𝑥))
3426breqd 5121 . . . . . . . . 9 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → (𝑝𝑑𝑦𝑝 𝑦))
3533, 34orbi12d 931 . . . . . . . 8 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → ((𝑝𝑑𝑥𝑝𝑑𝑦) ↔ (𝑝 𝑥𝑝 𝑦)))
3632, 35imbi12d 347 . . . . . . 7 (((𝑟 = 𝑅𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r𝑟)) → ((𝑝𝑑(𝑥(.r𝑟)𝑦) → (𝑝𝑑𝑥𝑝𝑑𝑦)) ↔ (𝑝 (𝑥 · 𝑦) → (𝑝 𝑥𝑝 𝑦))))
3719, 36sbcied 3788 . . . . . 6 ((𝑟 = 𝑅𝑏 = (Base‘𝑟)) → ([(∥r𝑟) / 𝑑](𝑝𝑑(𝑥(.r𝑟)𝑦) → (𝑝𝑑𝑥𝑝𝑑𝑦)) ↔ (𝑝 (𝑥 · 𝑦) → (𝑝 𝑥𝑝 𝑦))))
388, 37raleqbidv 3338 . . . . 5 ((𝑟 = 𝑅𝑏 = (Base‘𝑟)) → (∀𝑦𝑏 [(∥r𝑟) / 𝑑](𝑝𝑑(𝑥(.r𝑟)𝑦) → (𝑝𝑑𝑥𝑝𝑑𝑦)) ↔ ∀𝑦𝐵 (𝑝 (𝑥 · 𝑦) → (𝑝 𝑥𝑝 𝑦))))
398, 38raleqbidv 3338 . . . 4 ((𝑟 = 𝑅𝑏 = (Base‘𝑟)) → (∀𝑥𝑏𝑦𝑏 [(∥r𝑟) / 𝑑](𝑝𝑑(𝑥(.r𝑟)𝑦) → (𝑝𝑑𝑥𝑝𝑑𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 (𝑝 (𝑥 · 𝑦) → (𝑝 𝑥𝑝 𝑦))))
4018, 39rabeqbidv 3434 . . 3 ((𝑟 = 𝑅𝑏 = (Base‘𝑟)) → {𝑝 ∈ (𝑏 ∖ ((Unit‘𝑟) ∪ {(0g𝑟)})) ∣ ∀𝑥𝑏𝑦𝑏 [(∥r𝑟) / 𝑑](𝑝𝑑(𝑥(.r𝑟)𝑦) → (𝑝𝑑𝑥𝑝𝑑𝑦))} = {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥𝐵𝑦𝐵 (𝑝 (𝑥 · 𝑦) → (𝑝 𝑥𝑝 𝑦))})
412, 40csbied 3890 . 2 (𝑟 = 𝑅(Base‘𝑟) / 𝑏{𝑝 ∈ (𝑏 ∖ ((Unit‘𝑟) ∪ {(0g𝑟)})) ∣ ∀𝑥𝑏𝑦𝑏 [(∥r𝑟) / 𝑑](𝑝𝑑(𝑥(.r𝑟)𝑦) → (𝑝𝑑𝑥𝑝𝑑𝑦))} = {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥𝐵𝑦𝐵 (𝑝 (𝑥 · 𝑦) → (𝑝 𝑥𝑝 𝑦))})
42 elex 3476 . 2 (𝑅𝑉𝑅 ∈ V)
437fvexi 6897 . . . . 5 𝐵 ∈ V
4443difexi 5302 . . . 4 (𝐵 ∖ (𝑈 ∪ { 0 })) ∈ V
4544rabex 5311 . . 3 {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥𝐵𝑦𝐵 (𝑝 (𝑥 · 𝑦) → (𝑝 𝑥𝑝 𝑦))} ∈ V
4645a1i 11 . 2 (𝑅𝑉 → {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥𝐵𝑦𝐵 (𝑝 (𝑥 · 𝑦) → (𝑝 𝑥𝑝 𝑦))} ∈ V)
471, 41, 42, 46fvmptd3 7015 1 (𝑅𝑉 → (RPrime‘𝑅) = {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥𝐵𝑦𝐵 (𝑝 (𝑥 · 𝑦) → (𝑝 𝑥𝑝 𝑦))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wo 860   = wceq 1570  wcel 2143  wral 3079  {crab 3416  Vcvv 3455  [wsbc 3745  csb 3854  cdif 3903  cun 3904  {csn 4590   class class class wbr 5110  cfv 6538  (class class class)co 7412  Basecbs 17270  .rcmulr 17312  0gc0g 17493  rcdsr 20437  Unitcui 20438  RPrimecrpm 20515
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-nul 5270  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7415  df-rprm 20516
This theorem is referenced by:  isrprm  33788
  Copyright terms: Public domain W3C validator