prmidl0 - Mathbox for Thierry Arnoux

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

Theorem prmidl0 32558

Description: The zero ideal of a commutative ring 𝑅 is a prime ideal if and only if 𝑅 is an integral domain. (Contributed by Thierry Arnoux, 30-Jun-2024.)

**Hypothesis**
Ref	Expression
prmidl0.1	⊢ 0 = (0_g‘𝑅)

**Assertion**
Ref	Expression
prmidl0	⊢ ((𝑅 ∈ CRing ∧ { 0 } ∈ (PrmIdeal‘𝑅)) ↔ 𝑅 ∈ IDomn)

Proof of Theorem prmidl0 Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-3an 1090	. . . 4 ⊢ (({ 0 } ∈ (LIdeal‘𝑅) ∧ { 0 } ≠ (Base‘𝑅) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) ∈ { 0 } → (𝑥 ∈ { 0 } ∨ 𝑦 ∈ { 0 }))) ↔ (({ 0 } ∈ (LIdeal‘𝑅) ∧ { 0 } ≠ (Base‘𝑅)) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) ∈ { 0 } → (𝑥 ∈ { 0 } ∨ 𝑦 ∈ { 0 }))))
2		crngring 20062	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
3	2	ad2antrr 725	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ CRing ∧ { 0 } ∈ (LIdeal‘𝑅)) ∧ ¬ 𝑅 ∈ NzRing) → 𝑅 ∈ Ring)
4		0ringnnzr 20295	. . . . . . . . . . . . 13 ⊢ (𝑅 ∈ Ring → ((♯‘(Base‘𝑅)) = 1 ↔ ¬ 𝑅 ∈ NzRing))
5	4	biimpar 479	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ Ring ∧ ¬ 𝑅 ∈ NzRing) → (♯‘(Base‘𝑅)) = 1)
6	3, 5	sylancom 589	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ CRing ∧ { 0 } ∈ (LIdeal‘𝑅)) ∧ ¬ 𝑅 ∈ NzRing) → (♯‘(Base‘𝑅)) = 1)
7		eqid 2733	. . . . . . . . . . . 12 ⊢ (Base‘𝑅) = (Base‘𝑅)
8		prmidl0.1	. . . . . . . . . . . 12 ⊢ 0 = (0_g‘𝑅)
9	7, 8	0ring 20296	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Ring ∧ (♯‘(Base‘𝑅)) = 1) → (Base‘𝑅) = { 0 })
10	3, 6, 9	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝑅 ∈ CRing ∧ { 0 } ∈ (LIdeal‘𝑅)) ∧ ¬ 𝑅 ∈ NzRing) → (Base‘𝑅) = { 0 })
11	10	eqcomd 2739	. . . . . . . . 9 ⊢ (((𝑅 ∈ CRing ∧ { 0 } ∈ (LIdeal‘𝑅)) ∧ ¬ 𝑅 ∈ NzRing) → { 0 } = (Base‘𝑅))
12	11	ex 414	. . . . . . . 8 ⊢ ((𝑅 ∈ CRing ∧ { 0 } ∈ (LIdeal‘𝑅)) → (¬ 𝑅 ∈ NzRing → { 0 } = (Base‘𝑅)))
13	12	necon1ad 2958	. . . . . . 7 ⊢ ((𝑅 ∈ CRing ∧ { 0 } ∈ (LIdeal‘𝑅)) → ({ 0 } ≠ (Base‘𝑅) → 𝑅 ∈ NzRing))
14	13	impr 456	. . . . . 6 ⊢ ((𝑅 ∈ CRing ∧ ({ 0 } ∈ (LIdeal‘𝑅) ∧ { 0 } ≠ (Base‘𝑅))) → 𝑅 ∈ NzRing)
15		nzrring 20288	. . . . . . . . 9 ⊢ (𝑅 ∈ NzRing → 𝑅 ∈ Ring)
16		eqid 2733	. . . . . . . . . 10 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅)
17	16, 8	lidl0 20837	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → { 0 } ∈ (LIdeal‘𝑅))
18	15, 17	syl 17	. . . . . . . 8 ⊢ (𝑅 ∈ NzRing → { 0 } ∈ (LIdeal‘𝑅))
19	8	fvexi 6903	. . . . . . . . . . . . 13 ⊢ 0 ∈ V
20		hashsng 14326	. . . . . . . . . . . . 13 ⊢ ( 0 ∈ V → (♯‘{ 0 }) = 1)
21	19, 20	ax-mp 5	. . . . . . . . . . . 12 ⊢ (♯‘{ 0 }) = 1
22		1re 11211	. . . . . . . . . . . 12 ⊢ 1 ∈ ℝ
23	21, 22	eqeltri 2830	. . . . . . . . . . 11 ⊢ (♯‘{ 0 }) ∈ ℝ
24	23	a1i 11	. . . . . . . . . 10 ⊢ (𝑅 ∈ NzRing → (♯‘{ 0 }) ∈ ℝ)
25	7	isnzr2hash 20291	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ NzRing ↔ (𝑅 ∈ Ring ∧ 1 < (♯‘(Base‘𝑅))))
26	25	simprbi 498	. . . . . . . . . . 11 ⊢ (𝑅 ∈ NzRing → 1 < (♯‘(Base‘𝑅)))
27	21, 26	eqbrtrid 5183	. . . . . . . . . 10 ⊢ (𝑅 ∈ NzRing → (♯‘{ 0 }) < (♯‘(Base‘𝑅)))
28	24, 27	ltned 11347	. . . . . . . . 9 ⊢ (𝑅 ∈ NzRing → (♯‘{ 0 }) ≠ (♯‘(Base‘𝑅)))
29		fveq2 6889	. . . . . . . . . 10 ⊢ ({ 0 } = (Base‘𝑅) → (♯‘{ 0 }) = (♯‘(Base‘𝑅)))
30	29	necon3i 2974	. . . . . . . . 9 ⊢ ((♯‘{ 0 }) ≠ (♯‘(Base‘𝑅)) → { 0 } ≠ (Base‘𝑅))
31	28, 30	syl 17	. . . . . . . 8 ⊢ (𝑅 ∈ NzRing → { 0 } ≠ (Base‘𝑅))
32	18, 31	jca 513	. . . . . . 7 ⊢ (𝑅 ∈ NzRing → ({ 0 } ∈ (LIdeal‘𝑅) ∧ { 0 } ≠ (Base‘𝑅)))
33	32	adantl 483	. . . . . 6 ⊢ ((𝑅 ∈ CRing ∧ 𝑅 ∈ NzRing) → ({ 0 } ∈ (LIdeal‘𝑅) ∧ { 0 } ≠ (Base‘𝑅)))
34	14, 33	impbida 800	. . . . 5 ⊢ (𝑅 ∈ CRing → (({ 0 } ∈ (LIdeal‘𝑅) ∧ { 0 } ≠ (Base‘𝑅)) ↔ 𝑅 ∈ NzRing))
35	19	elsn2 4667	. . . . . . . 8 ⊢ ((𝑥(._r‘𝑅)𝑦) ∈ { 0 } ↔ (𝑥(._r‘𝑅)𝑦) = 0 )
36		velsn 4644	. . . . . . . . 9 ⊢ (𝑥 ∈ { 0 } ↔ 𝑥 = 0 )
37		velsn 4644	. . . . . . . . 9 ⊢ (𝑦 ∈ { 0 } ↔ 𝑦 = 0 )
38	36, 37	orbi12i 914	. . . . . . . 8 ⊢ ((𝑥 ∈ { 0 } ∨ 𝑦 ∈ { 0 }) ↔ (𝑥 = 0 ∨ 𝑦 = 0 ))
39	35, 38	imbi12i 351	. . . . . . 7 ⊢ (((𝑥(._r‘𝑅)𝑦) ∈ { 0 } → (𝑥 ∈ { 0 } ∨ 𝑦 ∈ { 0 })) ↔ ((𝑥(._r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )))
40	39	2ralbii 3129	. . . . . 6 ⊢ (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) ∈ { 0 } → (𝑥 ∈ { 0 } ∨ 𝑦 ∈ { 0 })) ↔ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )))
41	40	a1i 11	. . . . 5 ⊢ (𝑅 ∈ CRing → (∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) ∈ { 0 } → (𝑥 ∈ { 0 } ∨ 𝑦 ∈ { 0 })) ↔ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 ))))
42	34, 41	anbi12d 632	. . . 4 ⊢ (𝑅 ∈ CRing → ((({ 0 } ∈ (LIdeal‘𝑅) ∧ { 0 } ≠ (Base‘𝑅)) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) ∈ { 0 } → (𝑥 ∈ { 0 } ∨ 𝑦 ∈ { 0 }))) ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )))))
43	1, 42	bitrid 283	. . 3 ⊢ (𝑅 ∈ CRing → (({ 0 } ∈ (LIdeal‘𝑅) ∧ { 0 } ≠ (Base‘𝑅) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) ∈ { 0 } → (𝑥 ∈ { 0 } ∨ 𝑦 ∈ { 0 }))) ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )))))
44	43	pm5.32i 576	. 2 ⊢ ((𝑅 ∈ CRing ∧ ({ 0 } ∈ (LIdeal‘𝑅) ∧ { 0 } ≠ (Base‘𝑅) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) ∈ { 0 } → (𝑥 ∈ { 0 } ∨ 𝑦 ∈ { 0 })))) ↔ (𝑅 ∈ CRing ∧ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )))))
45		eqid 2733	. . . 4 ⊢ (._r‘𝑅) = (._r‘𝑅)
46	7, 45	isprmidlc 32555	. . 3 ⊢ (𝑅 ∈ CRing → ({ 0 } ∈ (PrmIdeal‘𝑅) ↔ ({ 0 } ∈ (LIdeal‘𝑅) ∧ { 0 } ≠ (Base‘𝑅) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) ∈ { 0 } → (𝑥 ∈ { 0 } ∨ 𝑦 ∈ { 0 })))))
47	46	pm5.32i 576	. 2 ⊢ ((𝑅 ∈ CRing ∧ { 0 } ∈ (PrmIdeal‘𝑅)) ↔ (𝑅 ∈ CRing ∧ ({ 0 } ∈ (LIdeal‘𝑅) ∧ { 0 } ≠ (Base‘𝑅) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) ∈ { 0 } → (𝑥 ∈ { 0 } ∨ 𝑦 ∈ { 0 })))))
48		df-idom 20894	. . . 4 ⊢ IDomn = (CRing ∩ Domn)
49	48	eleq2i 2826	. . 3 ⊢ (𝑅 ∈ IDomn ↔ 𝑅 ∈ (CRing ∩ Domn))
50		elin 3964	. . 3 ⊢ (𝑅 ∈ (CRing ∩ Domn) ↔ (𝑅 ∈ CRing ∧ 𝑅 ∈ Domn))
51	7, 45, 8	isdomn 20903	. . . 4 ⊢ (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 ))))
52	51	anbi2i 624	. . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑅 ∈ Domn) ↔ (𝑅 ∈ CRing ∧ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )))))
53	49, 50, 52	3bitri 297	. 2 ⊢ (𝑅 ∈ IDomn ↔ (𝑅 ∈ CRing ∧ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(._r‘𝑅)𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )))))
54	44, 47, 53	3bitr4i 303	1 ⊢ ((𝑅 ∈ CRing ∧ { 0 } ∈ (PrmIdeal‘𝑅)) ↔ 𝑅 ∈ IDomn)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∀wral 3062 Vcvv 3475 ∩ cin 3947 {csn 4628 class class class wbr 5148 ‘cfv 6541 (class class class)co 7406 ℝcr 11106 1c1 11108 < clt 11245 ♯chash 14287 Basecbs 17141 ._rcmulr 17195 0_gc0g 17382 Ringcrg 20050 CRingccrg 20051 NzRingcnzr 20284 LIdealclidl 20776 Domncdomn 20889 IDomncidom 20890 PrmIdealcprmidl 32542

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-1st 7972 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-1o 8463 df-oadd 8467 df-er 8700 df-en 8937 df-dom 8938 df-sdom 8939 df-fin 8940 df-dju 9893 df-card 9931 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-nn 12210 df-2 12272 df-3 12273 df-4 12274 df-5 12275 df-6 12276 df-7 12277 df-8 12278 df-n0 12470 df-xnn0 12542 df-z 12556 df-uz 12820 df-fz 13482 df-hash 14288 df-sets 17094 df-slot 17112 df-ndx 17124 df-base 17142 df-ress 17171 df-plusg 17207 df-mulr 17208 df-sca 17210 df-vsca 17211 df-ip 17212 df-0g 17384 df-mgm 18558 df-sgrp 18607 df-mnd 18623 df-grp 18819 df-minusg 18820 df-sbg 18821 df-subg 18998 df-cmn 19645 df-mgp 19983 df-ur 20000 df-ring 20052 df-cring 20053 df-nzr 20285 df-subrg 20354 df-lmod 20466 df-lss 20536 df-lsp 20576 df-sra 20778 df-rgmod 20779 df-lidl 20780 df-rsp 20781 df-domn 20893 df-idom 20894 df-prmidl 32543

This theorem is referenced by: ply1annprmidl 32757

W3C validator