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

Theorem isrprm 34153
Description: Property for 𝑃 to be a prime element in the ring 𝑅. (Contributed by Thierry Arnoux, 1-Jul-2024.)
Hypotheses
Ref Expression
isrprm.1 𝐵 = (Base‘𝑅)
isrprm.2 𝑈 = (Unit‘𝑅)
isrprm.3 0 = (0g‘𝑅)
isrprm.4 ∥ = (∥r‘𝑅)
isrprm.5 · = (.r‘𝑅)
Assertion
Ref Expression
isrprm (𝑅 ∈ 𝑉 → (𝑃 ∈ (RPrime‘𝑅) ↔ (𝑃 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦)))))
Distinct variable groups:   𝑥,𝑃,𝑦   𝑥,𝑅,𝑦
Allowed substitution hints:   𝐵(𝑥, 𝑦)   ∥ (𝑥, 𝑦)   · (𝑥, 𝑦)   𝑈(𝑥, 𝑦)   𝑉(𝑥, 𝑦)   0 (𝑥, 𝑦)

Proof of Theorem isrprm
Dummy variable 𝑝 is distinct from all other variables.
StepHypRef Expression
1 isrprm.1 . . . 4 𝐵 = (Base‘𝑅)
2 isrprm.2 . . . 4 𝑈 = (Unit‘𝑅)
3 isrprm.3 . . . 4 0 = (0g‘𝑅)
4 isrprm.5 . . . 4 · = (.r‘𝑅)
5 isrprm.4 . . . 4 ∥ = (∥r‘𝑅)
61, 2, 3, 4, 5rprmval 34152 . . 3 (𝑅 ∈ 𝑉 → (RPrime‘𝑅) = {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))})
76eleq2d 2850 . 2 (𝑅 ∈ 𝑉 → (𝑃 ∈ (RPrime‘𝑅) ↔ 𝑃 ∈ {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))}))
8 breq1 5111 . . . . 5 (𝑝 = 𝑃 → (𝑝 ∥ (𝑥 · 𝑦) ↔ 𝑃 ∥ (𝑥 · 𝑦)))
9 breq1 5111 . . . . . 6 (𝑝 = 𝑃 → (𝑝 ∥ 𝑥 ↔ 𝑃 ∥ 𝑥))
10 breq1 5111 . . . . . 6 (𝑝 = 𝑃 → (𝑝 ∥ 𝑦 ↔ 𝑃 ∥ 𝑦))
119, 10orbi12d 932 . . . . 5 (𝑝 = 𝑃 → ((𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦) ↔ (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦)))
128, 11imbi12d 347 . . . 4 (𝑝 = 𝑃 → ((𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦)) ↔ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))))
13122ralbidv 3230 . . 3 (𝑝 = 𝑃 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))))
1413elrab 3648 . 2 (𝑃 ∈ {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))} ↔ (𝑃 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))))
157, 14bitrdi 290 1 (𝑅 ∈ 𝑉 → (𝑃 ∈ (RPrime‘𝑅) ↔ (𝑃 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ∖ cdif 4048   ∪ cun 4152  {csn 4588   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  .rcmulr 17473  0gc0g 17660  ∥rcdsr 20635  Unitcui 20636  RPrimecrpm 20713
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-rprm 20714
This theorem is used by:  rprmcl  34154  rprmdvds  34155  rprmnz  34156  rprmnunit  34157  rsprprmprmidlb  34159  rprmirredb  34168
  Copyright terms: Public domain W3C validator