Theorem isidlc 38554

Description: Obsolete theorem, use df2idl2crng 21392 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 38539	. . 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 38553	. . 3 ⊢ (𝑅 ∈ RingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))))
7	1, 6	syl 18	. 2 ⊢ (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))))
8		ssel2 3940	. . . . . . . 8 ⊢ ((𝐼 ⊆ 𝑋 ∧ 𝑥 ∈ 𝐼) → 𝑥 ∈ 𝑋)
9	2, 3, 4	crngocom 38540	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → (𝑥𝐻𝑧) = (𝑧𝐻𝑥))
10	9	eleq1d 2854	. . . . . . . . . . . . . 14 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → ((𝑥𝐻𝑧) ∈ 𝐼 ↔ (𝑧𝐻𝑥) ∈ 𝐼))
11	10	biimprd 251	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 → (𝑥𝐻𝑧) ∈ 𝐼))
12	11	3expa 1134	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 → (𝑥𝐻𝑧) ∈ 𝐼))
13	12	pm4.71d 570	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → ((𝑧𝐻𝑥) ∈ 𝐼 ↔ ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)))
14	13	bicomd 226	. . . . . . . . . 10 ⊢ (((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) ∧ 𝑧 ∈ 𝑋) → (((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) ↔ (𝑧𝐻𝑥) ∈ 𝐼))
15	14	ralbidva 3192	. . . . . . . . 9 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) → (∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼) ↔ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))
16	15	anbi2d 641	. . . . . . . 8 ⊢ ((𝑅 ∈ CRingOps ∧ 𝑥 ∈ 𝑋) → ((∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
17	8, 16	sylan2 604	. . . . . . 7 ⊢ ((𝑅 ∈ CRingOps ∧ (𝐼 ⊆ 𝑋 ∧ 𝑥 ∈ 𝐼)) → ((∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
18	17	anassrs 472	. . . . . 6 ⊢ (((𝑅 ∈ CRingOps ∧ 𝐼 ⊆ 𝑋) ∧ 𝑥 ∈ 𝐼) → ((∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
19	18	ralbidva 3192	. . . . 5 ⊢ ((𝑅 ∈ CRingOps ∧ 𝐼 ⊆ 𝑋) → (∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
20	19	adantrr 729	. . . 4 ⊢ ((𝑅 ∈ CRingOps ∧ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼)) → (∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼)) ↔ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
21	20	pm5.32da 589	. . 3 ⊢ (𝑅 ∈ CRingOps → (((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
22		df-3an 1103	. . 3 ⊢ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))))
23		df-3an 1103	. . 3 ⊢ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)) ↔ ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼) ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼)))
24	21, 22, 23	3bitr4g 317	. 2 ⊢ (𝑅 ∈ CRingOps → ((𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝐼 ∧ (𝑥𝐻𝑧) ∈ 𝐼))) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))
25	7, 24	bitrd 282	1 ⊢ (𝑅 ∈ CRingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ 𝑋 ∧ 𝑍 ∈ 𝐼 ∧ ∀𝑥 ∈ 𝐼 (∀𝑦 ∈ 𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ 𝑋 (𝑧𝐻𝑥) ∈ 𝐼))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149  ∀wral 3085   ⊆ wss 3913  ran crn 5663  ‘cfv 6537  (class class class)co 7411  1^st c1st 7984  2^nd c2nd 7985  GIdcgi 30783  RingOpscrngo 38433  CRingOpsccring 38532  Idlcidl 38546

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7414  df-1st 7986  df-2nd 7987  df-rngo 38434  df-com2 38529  df-crngo 38533  df-idl 38549

This theorem is referenced by:  prnc  38606