Theorem idlval 39150

Description: Obsolete theorem, use 2idlval 21577 instead. The class of ideals of a 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
idlval	⊢ (𝑅 ∈ RingOps → (Idl‘𝑅) = {𝑖 ∈ 𝒫 𝑋 ∣ (𝑍 ∈ 𝑖 ∧ ∀𝑥 ∈ 𝑖 (∀𝑦 ∈ 𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))})

Distinct variable groups:   𝑥,𝑅,𝑦,𝑧,𝑖   𝑧,𝑋,𝑖   𝑖,𝑍   𝑖,𝐺   𝑖,𝐻

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

Proof of Theorem idlval

Dummy variable 𝑟 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6911	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (1st ‘𝑟) = (1st ‘𝑅))
2		idlval.1	. . . . . . 7 ⊢ 𝐺 = (1st ‘𝑅)
3	1, 2	eqtr4di 2816	. . . . . 6 ⊢ (𝑟 = 𝑅 → (1st ‘𝑟) = 𝐺)
4	3	rneqd 5928	. . . . 5 ⊢ (𝑟 = 𝑅 → ran (1st ‘𝑟) = ran 𝐺)
5		idlval.3	. . . . 5 ⊢ 𝑋 = ran 𝐺
6	4, 5	eqtr4di 2816	. . . 4 ⊢ (𝑟 = 𝑅 → ran (1st ‘𝑟) = 𝑋)
7	6	pweqd 4577	. . 3 ⊢ (𝑟 = 𝑅 → 𝒫 ran (1st ‘𝑟) = 𝒫 𝑋)
8	3	fveq2d 6915	. . . . . 6 ⊢ (𝑟 = 𝑅 → (GId‘(1st ‘𝑟)) = (GId‘𝐺))
9		idlval.4	. . . . . 6 ⊢ 𝑍 = (GId‘𝐺)
10	8, 9	eqtr4di 2816	. . . . 5 ⊢ (𝑟 = 𝑅 → (GId‘(1st ‘𝑟)) = 𝑍)
11	10	eleq1d 2849	. . . 4 ⊢ (𝑟 = 𝑅 → ((GId‘(1st ‘𝑟)) ∈ 𝑖 ↔ 𝑍 ∈ 𝑖))
12	3	oveqd 7463	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑥(1st ‘𝑟)𝑦) = (𝑥𝐺𝑦))
13	12	eleq1d 2849	. . . . . . 7 ⊢ (𝑟 = 𝑅 → ((𝑥(1st ‘𝑟)𝑦) ∈ 𝑖 ↔ (𝑥𝐺𝑦) ∈ 𝑖))
14	13	ralbidv 3189	. . . . . 6 ⊢ (𝑟 = 𝑅 → (∀𝑦 ∈ 𝑖 (𝑥(1st ‘𝑟)𝑦) ∈ 𝑖 ↔ ∀𝑦 ∈ 𝑖 (𝑥𝐺𝑦) ∈ 𝑖))
15		fveq2 6911	. . . . . . . . . . 11 ⊢ (𝑟 = 𝑅 → (2nd ‘𝑟) = (2nd ‘𝑅))
16		idlval.2	. . . . . . . . . . 11 ⊢ 𝐻 = (2nd ‘𝑅)
17	15, 16	eqtr4di 2816	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (2nd ‘𝑟) = 𝐻)
18	17	oveqd 7463	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (𝑧(2nd ‘𝑟)𝑥) = (𝑧𝐻𝑥))
19	18	eleq1d 2849	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → ((𝑧(2nd ‘𝑟)𝑥) ∈ 𝑖 ↔ (𝑧𝐻𝑥) ∈ 𝑖))
20	17	oveqd 7463	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (𝑥(2nd ‘𝑟)𝑧) = (𝑥𝐻𝑧))
21	20	eleq1d 2849	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → ((𝑥(2nd ‘𝑟)𝑧) ∈ 𝑖 ↔ (𝑥𝐻𝑧) ∈ 𝑖))
22	19, 21	anbi12d 644	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (((𝑧(2nd ‘𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd ‘𝑟)𝑧) ∈ 𝑖) ↔ ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))
23	6, 22	raleqbidv 3338	. . . . . 6 ⊢ (𝑟 = 𝑅 → (∀𝑧 ∈ ran (1st ‘𝑟)((𝑧(2nd ‘𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd ‘𝑟)𝑧) ∈ 𝑖) ↔ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))
24	14, 23	anbi12d 644	. . . . 5 ⊢ (𝑟 = 𝑅 → ((∀𝑦 ∈ 𝑖 (𝑥(1st ‘𝑟)𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ ran (1st ‘𝑟)((𝑧(2nd ‘𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd ‘𝑟)𝑧) ∈ 𝑖)) ↔ (∀𝑦 ∈ 𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖))))
25	24	ralbidv 3189	. . . 4 ⊢ (𝑟 = 𝑅 → (∀𝑥 ∈ 𝑖 (∀𝑦 ∈ 𝑖 (𝑥(1st ‘𝑟)𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ ran (1st ‘𝑟)((𝑧(2nd ‘𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd ‘𝑟)𝑧) ∈ 𝑖)) ↔ ∀𝑥 ∈ 𝑖 (∀𝑦 ∈ 𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖))))
26	11, 25	anbi12d 644	. . 3 ⊢ (𝑟 = 𝑅 → (((GId‘(1st ‘𝑟)) ∈ 𝑖 ∧ ∀𝑥 ∈ 𝑖 (∀𝑦 ∈ 𝑖 (𝑥(1st ‘𝑟)𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ ran (1st ‘𝑟)((𝑧(2nd ‘𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd ‘𝑟)𝑧) ∈ 𝑖))) ↔ (𝑍 ∈ 𝑖 ∧ ∀𝑥 ∈ 𝑖 (∀𝑦 ∈ 𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))))
27	7, 26	rabeqbidv 3433	. 2 ⊢ (𝑟 = 𝑅 → {𝑖 ∈ 𝒫 ran (1st ‘𝑟) ∣ ((GId‘(1st ‘𝑟)) ∈ 𝑖 ∧ ∀𝑥 ∈ 𝑖 (∀𝑦 ∈ 𝑖 (𝑥(1st ‘𝑟)𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ ran (1st ‘𝑟)((𝑧(2nd ‘𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd ‘𝑟)𝑧) ∈ 𝑖)))} = {𝑖 ∈ 𝒫 𝑋 ∣ (𝑍 ∈ 𝑖 ∧ ∀𝑥 ∈ 𝑖 (∀𝑦 ∈ 𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))})
28		df-idl 39147	. 2 ⊢ Idl = (𝑟 ∈ RingOps ↦ {𝑖 ∈ 𝒫 ran (1st ‘𝑟) ∣ ((GId‘(1st ‘𝑟)) ∈ 𝑖 ∧ ∀𝑥 ∈ 𝑖 (∀𝑦 ∈ 𝑖 (𝑥(1st ‘𝑟)𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ ran (1st ‘𝑟)((𝑧(2nd ‘𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd ‘𝑟)𝑧) ∈ 𝑖)))})
29	2	fvexi 6925	. . . . . 6 ⊢ 𝐺 ∈ V
30	29	rnex 7949	. . . . 5 ⊢ ran 𝐺 ∈ V
31	5, 30	eqeltri 2860	. . . 4 ⊢ 𝑋 ∈ V
32	31	pwex 5347	. . 3 ⊢ 𝒫 𝑋 ∈ V
33	32	rabex 5305	. 2 ⊢ {𝑖 ∈ 𝒫 𝑋 ∣ (𝑍 ∈ 𝑖 ∧ ∀𝑥 ∈ 𝑖 (∀𝑦 ∈ 𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))} ∈ V
34	27, 28, 33	fvmpt 7019	1 ⊢ (𝑅 ∈ RingOps → (Idl‘𝑅) = {𝑖 ∈ 𝒫 𝑋 ∣ (𝑍 ∈ 𝑖 ∧ ∀𝑥 ∈ 𝑖 (∀𝑦 ∈ 𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ 𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454  𝒫 cpw 4560  ran crn 5657  ‘cfv 6561  (class class class)co 7446  1^st c1st 8026  2^nd c2nd 8027  GIdcgi 31125  RingOpscrngo 39031  Idlcidl 39144

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-iota 6515  df-fun 6563  df-fv 6569  df-ov 7449  df-idl 39147

This theorem is used by:  isidl  39151