Theorem igenval2 38267

Description: The ideal generated by a subset of a ring. (Contributed by Jeff Madsen, 10-Jun-2010.)

Hypotheses

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

Assertion

Ref	Expression
igenval2	⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → ((𝑅 IdlGen 𝑆) = 𝐼 ↔ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗))))

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

Allowed substitution hints:   𝐺(𝑗)   𝑋(𝑗)

Proof of Theorem igenval2

Dummy variable 𝑖 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		igenval2.1	. . . . 5 ⊢ 𝐺 = (1st ‘𝑅)
2		igenval2.2	. . . . 5 ⊢ 𝑋 = ran 𝐺
3	1, 2	igenidl 38264	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → (𝑅 IdlGen 𝑆) ∈ (Idl‘𝑅))
4	1, 2	igenss 38263	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → 𝑆 ⊆ (𝑅 IdlGen 𝑆))
5		igenmin 38265	. . . . . . 7 ⊢ ((𝑅 ∈ RingOps ∧ 𝑗 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝑗) → (𝑅 IdlGen 𝑆) ⊆ 𝑗)
6	5	3expia 1121	. . . . . 6 ⊢ ((𝑅 ∈ RingOps ∧ 𝑗 ∈ (Idl‘𝑅)) → (𝑆 ⊆ 𝑗 → (𝑅 IdlGen 𝑆) ⊆ 𝑗))
7	6	ralrimiva 3128	. . . . 5 ⊢ (𝑅 ∈ RingOps → ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → (𝑅 IdlGen 𝑆) ⊆ 𝑗))
8	7	adantr 480	. . . 4 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → (𝑅 IdlGen 𝑆) ⊆ 𝑗))
9	3, 4, 8	3jca 1128	. . 3 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → ((𝑅 IdlGen 𝑆) ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ (𝑅 IdlGen 𝑆) ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → (𝑅 IdlGen 𝑆) ⊆ 𝑗)))
10		eleq1 2824	. . . 4 ⊢ ((𝑅 IdlGen 𝑆) = 𝐼 → ((𝑅 IdlGen 𝑆) ∈ (Idl‘𝑅) ↔ 𝐼 ∈ (Idl‘𝑅)))
11		sseq2 3960	. . . 4 ⊢ ((𝑅 IdlGen 𝑆) = 𝐼 → (𝑆 ⊆ (𝑅 IdlGen 𝑆) ↔ 𝑆 ⊆ 𝐼))
12		sseq1 3959	. . . . . 6 ⊢ ((𝑅 IdlGen 𝑆) = 𝐼 → ((𝑅 IdlGen 𝑆) ⊆ 𝑗 ↔ 𝐼 ⊆ 𝑗))
13	12	imbi2d 340	. . . . 5 ⊢ ((𝑅 IdlGen 𝑆) = 𝐼 → ((𝑆 ⊆ 𝑗 → (𝑅 IdlGen 𝑆) ⊆ 𝑗) ↔ (𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗)))
14	13	ralbidv 3159	. . . 4 ⊢ ((𝑅 IdlGen 𝑆) = 𝐼 → (∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → (𝑅 IdlGen 𝑆) ⊆ 𝑗) ↔ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗)))
15	10, 11, 14	3anbi123d 1438	. . 3 ⊢ ((𝑅 IdlGen 𝑆) = 𝐼 → (((𝑅 IdlGen 𝑆) ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ (𝑅 IdlGen 𝑆) ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → (𝑅 IdlGen 𝑆) ⊆ 𝑗)) ↔ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗))))
16	9, 15	syl5ibcom 245	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → ((𝑅 IdlGen 𝑆) = 𝐼 → (𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗))))
17		igenmin 38265	. . . . . 6 ⊢ ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼) → (𝑅 IdlGen 𝑆) ⊆ 𝐼)
18	17	3adant3r3 1185	. . . . 5 ⊢ ((𝑅 ∈ RingOps ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗))) → (𝑅 IdlGen 𝑆) ⊆ 𝐼)
19	18	adantlr 715	. . . 4 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗))) → (𝑅 IdlGen 𝑆) ⊆ 𝐼)
20		ssint 4919	. . . . . . . 8 ⊢ (𝐼 ⊆ ∩ {𝑖 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑖} ↔ ∀𝑗 ∈ {𝑖 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑖}𝐼 ⊆ 𝑗)
21		sseq2 3960	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → (𝑆 ⊆ 𝑖 ↔ 𝑆 ⊆ 𝑗))
22	21	ralrab 3652	. . . . . . . 8 ⊢ (∀𝑗 ∈ {𝑖 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑖}𝐼 ⊆ 𝑗 ↔ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗))
23	20, 22	sylbbr 236	. . . . . . 7 ⊢ (∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗) → 𝐼 ⊆ ∩ {𝑖 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑖})
24	23	3ad2ant3 1135	. . . . . 6 ⊢ ((𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗)) → 𝐼 ⊆ ∩ {𝑖 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑖})
25	24	adantl 481	. . . . 5 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗))) → 𝐼 ⊆ ∩ {𝑖 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑖})
26	1, 2	igenval 38262	. . . . . 6 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → (𝑅 IdlGen 𝑆) = ∩ {𝑖 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑖})
27	26	adantr 480	. . . . 5 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗))) → (𝑅 IdlGen 𝑆) = ∩ {𝑖 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑖})
28	25, 27	sseqtrrd 3971	. . . 4 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗))) → 𝐼 ⊆ (𝑅 IdlGen 𝑆))
29	19, 28	eqssd 3951	. . 3 ⊢ (((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) ∧ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗))) → (𝑅 IdlGen 𝑆) = 𝐼)
30	29	ex 412	. 2 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → ((𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗)) → (𝑅 IdlGen 𝑆) = 𝐼))
31	16, 30	impbid 212	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → ((𝑅 IdlGen 𝑆) = 𝐼 ↔ (𝐼 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝐼 ∧ ∀𝑗 ∈ (Idl‘𝑅)(𝑆 ⊆ 𝑗 → 𝐼 ⊆ 𝑗))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3051  {crab 3399   ⊆ wss 3901  ∩ cint 4902  ran crn 5625  ‘cfv 6492  (class class class)co 7358  1^st c1st 7931  RingOpscrngo 38095  Idlcidl 38208   IdlGen cigen 38260

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 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fo 6498  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-grpo 30568  df-gid 30569  df-ablo 30620  df-rngo 38096  df-idl 38211  df-igen 38261

This theorem is referenced by:  prnc  38268