Theorem igenval 38572

Description: The ideal generated by a subset of a ring. (Contributed by Jeff Madsen, 10-Jun-2010.) (Proof shortened by Mario Carneiro, 20-Dec-2013.)

Hypotheses

Ref	Expression
igenval.1	⊢ 𝐺 = (1st ‘𝑅)
igenval.2	⊢ 𝑋 = ran 𝐺

Assertion

Ref	Expression
igenval	⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → (𝑅 IdlGen 𝑆) = ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗})

Distinct variable groups:   𝑅,𝑗   𝑆,𝑗   𝑗,𝑋

Allowed substitution hint:   𝐺(𝑗)

Proof of Theorem igenval

Dummy variables 𝑟 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		igenval.1	. . . . . 6 ⊢ 𝐺 = (1st ‘𝑅)
2		igenval.2	. . . . . 6 ⊢ 𝑋 = ran 𝐺
3	1, 2	rngoidl 38535	. . . . 5 ⊢ (𝑅 ∈ RingOps → 𝑋 ∈ (Idl‘𝑅))
4		sseq2 3965	. . . . . 6 ⊢ (𝑗 = 𝑋 → (𝑆 ⊆ 𝑗 ↔ 𝑆 ⊆ 𝑋))
5	4	rspcev 3584	. . . . 5 ⊢ ((𝑋 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝑋) → ∃𝑗 ∈ (Idl‘𝑅)𝑆 ⊆ 𝑗)
6	3, 5	sylan 591	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → ∃𝑗 ∈ (Idl‘𝑅)𝑆 ⊆ 𝑗)
7		rabn0 4346	. . . 4 ⊢ ({𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ≠ ∅ ↔ ∃𝑗 ∈ (Idl‘𝑅)𝑆 ⊆ 𝑗)
8	6, 7	sylibr 237	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ≠ ∅)
9		intex 5305	. . 3 ⊢ ({𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ≠ ∅ ↔ ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ∈ V)
10	8, 9	sylib 221	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ∈ V)
11	1	fvexi 6885	. . . . . 6 ⊢ 𝐺 ∈ V
12	11	rnex 7895	. . . . 5 ⊢ ran 𝐺 ∈ V
13	2, 12	eqeltri 2861	. . . 4 ⊢ 𝑋 ∈ V
14	13	elpw2 5295	. . 3 ⊢ (𝑆 ∈ 𝒫 𝑋 ↔ 𝑆 ⊆ 𝑋)
15		simpl 487	. . . . . . 7 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → 𝑟 = 𝑅)
16	15	fveq2d 6875	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (Idl‘𝑟) = (Idl‘𝑅))
17		sseq1 3964	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (𝑠 ⊆ 𝑗 ↔ 𝑆 ⊆ 𝑗))
18	17	adantl 486	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (𝑠 ⊆ 𝑗 ↔ 𝑆 ⊆ 𝑗))
19	16, 18	rabeqbidv 3435	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → {𝑗 ∈ (Idl‘𝑟) ∣ 𝑠 ⊆ 𝑗} = {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗})
20	19	inteqd 4913	. . . 4 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → ∩ {𝑗 ∈ (Idl‘𝑟) ∣ 𝑠 ⊆ 𝑗} = ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗})
21		fveq2 6871	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (1st ‘𝑟) = (1st ‘𝑅))
22	21, 1	eqtr4di 2818	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (1st ‘𝑟) = 𝐺)
23	22	rneqd 5919	. . . . . 6 ⊢ (𝑟 = 𝑅 → ran (1st ‘𝑟) = ran 𝐺)
24	23, 2	eqtr4di 2818	. . . . 5 ⊢ (𝑟 = 𝑅 → ran (1st ‘𝑟) = 𝑋)
25	24	pweqd 4575	. . . 4 ⊢ (𝑟 = 𝑅 → 𝒫 ran (1st ‘𝑟) = 𝒫 𝑋)
26		df-igen 38571	. . . 4 ⊢ IdlGen = (𝑟 ∈ RingOps, 𝑠 ∈ 𝒫 ran (1st ‘𝑟) ↦ ∩ {𝑗 ∈ (Idl‘𝑟) ∣ 𝑠 ⊆ 𝑗})
27	20, 25, 26	ovmpox 7553	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ∈ 𝒫 𝑋 ∧ ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ∈ V) → (𝑅 IdlGen 𝑆) = ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗})
28	14, 27	syl3an2br 1430	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋 ∧ ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ∈ V) → (𝑅 IdlGen 𝑆) = ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗})
29	10, 28	mpd3an3 1486	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → (𝑅 IdlGen 𝑆) = ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗})

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1563   ∈ wcel 2145   ≠ wne 2960  ∃wrex 3089  {crab 3417  Vcvv 3457   ⊆ wss 3907  ∅c0 4288  𝒫 cpw 4558  ∩ cint 4908  ran crn 5653  ‘cfv 6525  (class class class)co 7400  1^st c1st 7972  RingOpscrngo 38405  Idlcidl 38518   IdlGen cigen 38570

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-int 4909  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-fo 6531  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-1st 7974  df-2nd 7975  df-grpo 30754  df-gid 30755  df-ablo 30806  df-rngo 38406  df-idl 38521  df-igen 38571

This theorem is referenced by:  igenss  38573  igenidl  38574  igenmin  38575  igenidl2  38576  igenval2  38577