Theorem isidlc 38155

Description: The predicate "is an ideal of the commutative ring 𝑅". (Contributed by Jeff Madsen, 10-Jun-2010.)

Hypotheses

Ref	Expression
idlval.1	⊢ 𝐺 = (1st ‘𝑅)
idlval.2	⊢ 𝐻 = (2nd ‘𝑅)
idlval.3	⊢ 𝑋 = ran 𝐺
idlval.4	⊢ 𝑍 = (GId‘𝐺)

Assertion

Ref	Expression
isidlc	⊢ (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))

Distinct variable groups:   𝑥,𝑅,𝑦,𝑧   𝑧,𝑋   𝑥,𝐼,𝑦,𝑧   𝑥,𝑋

Allowed substitution hints:   𝐺(𝑥,𝑦,𝑧)   𝐻(𝑥,𝑦,𝑧)   𝑋(𝑦)   𝑍(𝑥,𝑦,𝑧)

Proof of Theorem isidlc

Step	Hyp	Ref	Expression
1		crngorngo 38140	. . 3 ⊢ (𝑅 ∈ CRingOps → 𝑅 ∈ RingOps)
2		idlval.1	. . . 4 ⊢ 𝐺 = (1st ‘𝑅)
3		idlval.2	. . . 4 ⊢ 𝐻 = (2nd ‘𝑅)
4		idlval.3	. . . 4 ⊢ 𝑋 = ran 𝐺
5		idlval.4	. . . 4 ⊢ 𝑍 = (GId‘𝐺)
6	2, 3, 4, 5	isidl 38154	. . 3 ⊢ (𝑅 ∈ RingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))))
7	1, 6	syl 17	. 2 ⊢ (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))))
8		ssel2 3926	. . . . . . . 8 ⊢ ((𝐼 ⊆ 𝑋 ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝑋)
9	2, 3, 4	crngocom 38141	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → (𝑥𝐻𝑧) = (𝑧𝐻𝑥))
10	9	eleq1d 2819	. . . . . . . . . . . . . 14 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → ((𝑥𝐻𝑧) ∈ 𝐼 ↔ (𝑧𝐻𝑥) ∈ 𝐼))
11	10	biimprd 248	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 → (𝑥𝐻𝑧) ∈ 𝐼))
12	11	3expa 1118	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 → (𝑥𝐻𝑧) ∈ 𝐼))
13	12	pm4.71d 561	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 ↔ ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))
14	13	bicomd 223	. . . . . . . . . 10 ⊢ (((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → (((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) ↔ (𝑧𝐻𝑥) ∈ 𝐼))
15	14	ralbidva 3155	. . . . . . . . 9 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) → (∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) ↔ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))
16	15	anbi2d 630	. . . . . . . 8 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) → ((∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
17	8, 16	sylan2 593	. . . . . . 7 ⊢ ((𝑅 ∈ CRingOps ∧ (𝐼 ⊆ 𝑋 ∧ 𝑥 ∈ 𝐼)) → ((∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
18	17	anassrs 467	. . . . . 6 ⊢ (((𝑅 ∈ CRingOps ∧ 𝐼 ⊆ 𝑋) ∧ 𝑥 ∈ 𝐼) → ((∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
19	18	ralbidva 3155	. . . . 5 ⊢ ((𝑅 ∈ CRingOps ∧ 𝐼 ⊆ 𝑋) → (∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
20	19	adantrr 717	. . . 4 ⊢ ((𝑅 ∈ CRingOps ∧ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼)) → (∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
21	20	pm5.32da 579	. . 3 ⊢ (𝑅 ∈ CRingOps → (((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
22		df-3an 1088	. . 3 ⊢ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))))
23		df-3an 1088	. . 3 ⊢ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)) ↔ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
24	21, 22, 23	3bitr4g 314	. 2 ⊢ (𝑅 ∈ CRingOps → ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
25	7, 24	bitrd 279	1 ⊢ (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3049   ⊆ wss 3899  ran crn 5623  ‘cfv 6490  (class class class)co 7356  1^st c1st 7929  2^nd c2nd 7930  GIdcgi 30514  RingOpscrngo 38034  CRingOpsccring 38133  Idlcidl 38147

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-iota 6446  df-fun 6492  df-fv 6498  df-ov 7359  df-1st 7931  df-2nd 7932  df-rngo 38035  df-com2 38130  df-crngo 38134  df-idl 38150

This theorem is referenced by:  prnc  38207