Theorem rprmnunit 33934

Description: A ring prime is not a unit. (Contributed by Thierry Arnoux, 18-May-2025.)

Hypotheses

Ref	Expression
rprmdvds.2	⊢ 𝑃 = (RPrime‘𝑅)
rprmdvds.3	⊢ 𝑈 = (Unit‘𝑅)
rprmdvds.5	⊢ (𝜑 → 𝑅 ∈ 𝑉)
rprmdvds.6	⊢ (𝜑 → 𝑄 ∈ 𝑃)

Assertion

Ref	Expression
rprmnunit	⊢ (𝜑 → ¬ 𝑄 ∈ 𝑈)

Proof of Theorem rprmnunit

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqidd 2761	. 2 ⊢ (𝜑 → (𝑈 ∪ {(0g‘𝑅)}) = (𝑈 ∪ {(0g‘𝑅)}))
2		rprmdvds.5	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑉)
3		rprmdvds.6	. . . . 5 ⊢ (𝜑 → 𝑄 ∈ 𝑃)
4		rprmdvds.2	. . . . 5 ⊢ 𝑃 = (RPrime‘𝑅)
5	3, 4	eleqtrdi 2870	. . . 4 ⊢ (𝜑 → 𝑄 ∈ (RPrime‘𝑅))
6		eqid 2760	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
7		rprmdvds.3	. . . . . 6 ⊢ 𝑈 = (Unit‘𝑅)
8		eqid 2760	. . . . . 6 ⊢ (0g‘𝑅) = (0g‘𝑅)
9		eqid 2760	. . . . . 6 ⊢ (∥r‘𝑅) = (∥r‘𝑅)
10		eqid 2760	. . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅)
11	6, 7, 8, 9, 10	isrprm 33930	. . . . 5 ⊢ (𝑅 ∈ 𝑉 → (𝑄 ∈ (RPrime‘𝑅) ↔ (𝑄 ∈ ((Base‘𝑅) ∖ (𝑈 ∪ {(0g‘𝑅)})) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)(𝑄(∥r‘𝑅)(𝑥(.r‘𝑅)𝑦) → (𝑄(∥r‘𝑅)𝑥 ∨ 𝑄(∥r‘𝑅)𝑦)))))
12	11	simprbda 504	. . . 4 ⊢ ((𝑅 ∈ 𝑉 ∧ 𝑄 ∈ (RPrime‘𝑅)) → 𝑄 ∈ ((Base‘𝑅) ∖ (𝑈 ∪ {(0g‘𝑅)})))
13	2, 5, 12	syl2anc 596	. . 3 ⊢ (𝜑 → 𝑄 ∈ ((Base‘𝑅) ∖ (𝑈 ∪ {(0g‘𝑅)})))
14	13	eldifbd 3912	. 2 ⊢ (𝜑 → ¬ 𝑄 ∈ (𝑈 ∪ {(0g‘𝑅)}))
15		nelun 32991	. . 3 ⊢ ((𝑈 ∪ {(0g‘𝑅)}) = (𝑈 ∪ {(0g‘𝑅)}) → (¬ 𝑄 ∈ (𝑈 ∪ {(0g‘𝑅)}) ↔ (¬ 𝑄 ∈ 𝑈 ∧ ¬ 𝑄 ∈ {(0g‘𝑅)})))
16	15	simprbda 504	. 2 ⊢ (((𝑈 ∪ {(0g‘𝑅)}) = (𝑈 ∪ {(0g‘𝑅)}) ∧ ¬ 𝑄 ∈ (𝑈 ∪ {(0g‘𝑅)})) → ¬ 𝑄 ∈ 𝑈)
17	1, 14, 16	syl2anc 596	1 ⊢ (𝜑 → ¬ 𝑄 ∈ 𝑈)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∨ wo 861   = wceq 1570   ∈ wcel 2145  ∀wral 3076   ∖ cdif 3896   ∪ cun 3897  {csn 4584   class class class wbr 5103  ‘cfv 6533  (class class class)co 7414  Basecbs 17304  ._rcmulr 17346  0_gc0g 17527  ∥_rcdsr 20498  Unitcui 20499  RPrimecrpm 20576

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7417  df-rprm 20577

This theorem is used by:  rsprprmprmidl  33935  rprmndvdsr1  33937  rprmirred  33944  1arithidom  33950