Theorem rprmval 33718

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.

Step	Hyp	Ref	Expression
1		df-rprm 20503	. 2 ⊢ RPrime = (𝑟 ∈ V ↦ ⦋(Base‘𝑟) / 𝑏⦌{𝑝 ∈ (𝑏 ∖ ((Unit‘𝑟) ∪ {(0g‘𝑟)})) ∣ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 [(∥r‘𝑟) / 𝑑](𝑝𝑑(𝑥(.r‘𝑟)𝑦) → (𝑝𝑑𝑥 ∨ 𝑝𝑑𝑦))})
2		fvexd 6886	. . 3 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) ∈ V)
3		simpr 489	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) → 𝑏 = (Base‘𝑟))
4		fveq2 6871	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
5	4	adantr 485	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) → (Base‘𝑟) = (Base‘𝑅))
6	3, 5	eqtrd 2800	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) → 𝑏 = (Base‘𝑅))
7		rprmval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
8	6, 7	eqtr4di 2818	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) → 𝑏 = 𝐵)
9		fveq2 6871	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = (Unit‘𝑅))
10		rprmval.u	. . . . . . . 8 ⊢ 𝑈 = (Unit‘𝑅)
11	9, 10	eqtr4di 2818	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Unit‘𝑟) = 𝑈)
12		fveq2 6871	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
13		rprmval.1	. . . . . . . . 9 ⊢ 0 = (0g‘𝑅)
14	12, 13	eqtr4di 2818	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
15	14	sneqd 4597	. . . . . . 7 ⊢ (𝑟 = 𝑅 → {(0g‘𝑟)} = { 0 })
16	11, 15	uneq12d 4125	. . . . . 6 ⊢ (𝑟 = 𝑅 → ((Unit‘𝑟) ∪ {(0g‘𝑟)}) = (𝑈 ∪ { 0 }))
17	16	adantr 485	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) → ((Unit‘𝑟) ∪ {(0g‘𝑟)}) = (𝑈 ∪ { 0 }))
18	8, 17	difeq12d 4084	. . . 4 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) → (𝑏 ∖ ((Unit‘𝑟) ∪ {(0g‘𝑟)})) = (𝐵 ∖ (𝑈 ∪ { 0 })))
19		fvexd 6886	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) → (∥r‘𝑟) ∈ V)
20		eqidd 2766	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → 𝑝 = 𝑝)
21		simpr 489	. . . . . . . . . . 11 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → 𝑑 = (∥r‘𝑟))
22		fveq2 6871	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → (∥r‘𝑟) = (∥r‘𝑅))
23	22	ad2antrr 738	. . . . . . . . . . 11 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → (∥r‘𝑟) = (∥r‘𝑅))
24	21, 23	eqtrd 2800	. . . . . . . . . 10 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → 𝑑 = (∥r‘𝑅))
25		rprmval.d	. . . . . . . . . 10 ⊢ ∥ = (∥r‘𝑅)
26	24, 25	eqtr4di 2818	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → 𝑑 = ∥ )
27		fveq2 6871	. . . . . . . . . . . 12 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = (.r‘𝑅))
28		rprmval.m	. . . . . . . . . . . 12 ⊢ · = (.r‘𝑅)
29	27, 28	eqtr4di 2818	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = · )
30	29	ad2antrr 738	. . . . . . . . . 10 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → (.r‘𝑟) = · )
31	30	oveqd 7417	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → (𝑥(.r‘𝑟)𝑦) = (𝑥 · 𝑦))
32	20, 26, 31	breq123d 5118	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → (𝑝𝑑(𝑥(.r‘𝑟)𝑦) ↔ 𝑝 ∥ (𝑥 · 𝑦)))
33	26	breqd 5115	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → (𝑝𝑑𝑥 ↔ 𝑝 ∥ 𝑥))
34	26	breqd 5115	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → (𝑝𝑑𝑦 ↔ 𝑝 ∥ 𝑦))
35	33, 34	orbi12d 931	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → ((𝑝𝑑𝑥 ∨ 𝑝𝑑𝑦) ↔ (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦)))
36	32, 35	imbi12d 347	. . . . . . 7 ⊢ (((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) ∧ 𝑑 = (∥r‘𝑟)) → ((𝑝𝑑(𝑥(.r‘𝑟)𝑦) → (𝑝𝑑𝑥 ∨ 𝑝𝑑𝑦)) ↔ (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))))
37	19, 36	sbcied 3790	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) → ([(∥r‘𝑟) / 𝑑](𝑝𝑑(𝑥(.r‘𝑟)𝑦) → (𝑝𝑑𝑥 ∨ 𝑝𝑑𝑦)) ↔ (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))))
38	8, 37	raleqbidv 3339	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) → (∀𝑦 ∈ 𝑏 [(∥r‘𝑟) / 𝑑](𝑝𝑑(𝑥(.r‘𝑟)𝑦) → (𝑝𝑑𝑥 ∨ 𝑝𝑑𝑦)) ↔ ∀𝑦 ∈ 𝐵 (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))))
39	8, 38	raleqbidv 3339	. . . 4 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 [(∥r‘𝑟) / 𝑑](𝑝𝑑(𝑥(.r‘𝑟)𝑦) → (𝑝𝑑𝑥 ∨ 𝑝𝑑𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))))
40	18, 39	rabeqbidv 3435	. . 3 ⊢ ((𝑟 = 𝑅 ∧ 𝑏 = (Base‘𝑟)) → {𝑝 ∈ (𝑏 ∖ ((Unit‘𝑟) ∪ {(0g‘𝑟)})) ∣ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 [(∥r‘𝑟) / 𝑑](𝑝𝑑(𝑥(.r‘𝑟)𝑦) → (𝑝𝑑𝑥 ∨ 𝑝𝑑𝑦))} = {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))})
41	2, 40	csbied 3891	. 2 ⊢ (𝑟 = 𝑅 → ⦋(Base‘𝑟) / 𝑏⦌{𝑝 ∈ (𝑏 ∖ ((Unit‘𝑟) ∪ {(0g‘𝑟)})) ∣ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 [(∥r‘𝑟) / 𝑑](𝑝𝑑(𝑥(.r‘𝑟)𝑦) → (𝑝𝑑𝑥 ∨ 𝑝𝑑𝑦))} = {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))})
42		elex 3478	. 2 ⊢ (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
43	7	fvexi 6885	. . . . 5 ⊢ 𝐵 ∈ V
44	43	difexi 5290	. . . 4 ⊢ (𝐵 ∖ (𝑈 ∪ { 0 })) ∈ V
45	44	rabex 5299	. . 3 ⊢ {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))} ∈ V
46	45	a1i 11	. 2 ⊢ (𝑅 ∈ 𝑉 → {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))} ∈ V)
47	1, 41, 42, 46	fvmptd3 7003	1 ⊢ (𝑅 ∈ 𝑉 → (RPrime‘𝑅) = {𝑝 ∈ (𝐵 ∖ (𝑈 ∪ { 0 })) ∣ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑝 ∥ (𝑥 · 𝑦) → (𝑝 ∥ 𝑥 ∨ 𝑝 ∥ 𝑦))})

Syntax hints:   → wi 4   ∧ wa 400   ∨ wo 860   = wceq 1563   ∈ wcel 2145  ∀wral 3079  {crab 3417  Vcvv 3457  [wsbc 3747  ⦋csb 3855   ∖ cdif 3904   ∪ cun 3905  {csn 4585   class class class wbr 5104  ‘cfv 6525  (class class class)co 7400  Basecbs 17257  ._rcmulr 17299  0_gc0g 17480  ∥_rcdsr 20424  Unitcui 20425  RPrimecrpm 20502

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5250  ax-nul 5260  ax-pr 5394

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5105  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6481  df-fun 6527  df-fv 6533  df-ov 7403  df-rprm 20503

This theorem is referenced by:  isrprm  33719