Theorem isidlc 38768

Description: Obsolete theorem, use df2idl2crng 21487 instead. The predicate "is an ideal of the commutative ring 𝑅". (Contributed by Jeff Madsen, 10-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.)

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 38753	. . 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 38767	. . 3 ⊢ (𝑅 ∈ RingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))))
7	1, 6	syl 18	. 2 ⊢ (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))))
8		ssel2 3926	. . . . . . . 8 ⊢ ((𝐼 ⊆ 𝑋 ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝑋)
9	2, 3, 4	crngocom 38754	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → (𝑥𝐻𝑧) = (𝑧𝐻𝑥))
10	9	eleq1d 2845	. . . . . . . . . . . . . 14 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → ((𝑥𝐻𝑧) ∈ 𝐼 ↔ (𝑧𝐻𝑥) ∈ 𝐼))
11	10	biimprd 251	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 → (𝑥𝐻𝑧) ∈ 𝐼))
12	11	3expa 1136	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 → (𝑥𝐻𝑧) ∈ 𝐼))
13	12	pm4.71d 571	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 ↔ ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))
14	13	bicomd 226	. . . . . . . . . 10 ⊢ (((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → (((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) ↔ (𝑧𝐻𝑥) ∈ 𝐼))
15	14	ralbidva 3183	. . . . . . . . 9 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) → (∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) ↔ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))
16	15	anbi2d 642	. . . . . . . 8 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) → ((∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
17	8, 16	sylan2 605	. . . . . . 7 ⊢ ((𝑅 ∈ CRingOps ∧ (𝐼 ⊆ 𝑋 ∧ 𝑥 ∈ 𝐼)) → ((∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
18	17	anassrs 473	. . . . . 6 ⊢ (((𝑅 ∈ CRingOps ∧ 𝐼 ⊆ 𝑋) ∧ 𝑥 ∈ 𝐼) → ((∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
19	18	ralbidva 3183	. . . . 5 ⊢ ((𝑅 ∈ CRingOps ∧ 𝐼 ⊆ 𝑋) → (∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
20	19	adantrr 730	. . . 4 ⊢ ((𝑅 ∈ CRingOps ∧ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼)) → (∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
21	20	pm5.32da 590	. . 3 ⊢ (𝑅 ∈ CRingOps → (((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
22		df-3an 1105	. . 3 ⊢ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))))
23		df-3an 1105	. . 3 ⊢ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)) ↔ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
24	21, 22, 23	3bitr4g 317	. 2 ⊢ (𝑅 ∈ CRingOps → ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
25	7, 24	bitrd 282	1 ⊢ (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076   ⊆ wss 3899  ran crn 5656  ‘cfv 6533  (class class class)co 7414  1^st c1st 7985  2^nd c2nd 7986  GIdcgi 30974  RingOpscrngo 38647  CRingOpsccring 38746  Idlcidl 38760

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-pow 5330  ax-pr 5398  ax-un 7737

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-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-rn 5666  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7417  df-1st 7987  df-2nd 7988  df-rngo 38648  df-com2 38743  df-crngo 38747  df-idl 38763

This theorem is used by:  prnc  38820