Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  igenidl Structured version   Visualization version   GIF version

Theorem igenidl 38917
Description: Obsolete theorem, use rspcl 21479 instead. The ideal generated by a set is an ideal. (Contributed by Jeff Madsen, 10-Jun-2010.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
igenval.1 𝐺 = (1st ‘𝑅)
igenval.2 𝑋 = ran 𝐺
Assertion
Ref Expression
igenidl ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → (𝑅 IdlGen 𝑆) ∈ (Idl‘𝑅))

Proof of Theorem igenidl
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 igenval.1 . . 3 𝐺 = (1st ‘𝑅)
2 igenval.2 . . 3 𝑋 = ran 𝐺
31, 2igenval 38915 . 2 ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → (𝑅 IdlGen 𝑆) = ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗})
41, 2rngoidl 38878 . . . . 5 (𝑅 ∈ RingOps → 𝑋 ∈ (Idl‘𝑅))
5 sseq2 3956 . . . . . 6 (𝑗 = 𝑋 → (𝑆 ⊆ 𝑗 ↔ 𝑆 ⊆ 𝑋))
65rspcev 3576 . . . . 5 ((𝑋 ∈ (Idl‘𝑅) ∧ 𝑆 ⊆ 𝑋) → ∃𝑗 ∈ (Idl‘𝑅)𝑆 ⊆ 𝑗)
74, 6sylan 592 . . . 4 ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → ∃𝑗 ∈ (Idl‘𝑅)𝑆 ⊆ 𝑗)
8 rabn0 4338 . . . 4 ({𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ≠ ∅ ↔ ∃𝑗 ∈ (Idl‘𝑅)𝑆 ⊆ 𝑗)
97, 8sylibr 237 . . 3 ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ≠ ∅)
10 ssrab2 4027 . . . 4 {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ⊆ (Idl‘𝑅)
11 intidl 38883 . . . 4 ((𝑅 ∈ RingOps ∧ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ≠ ∅ ∧ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ⊆ (Idl‘𝑅)) → ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ∈ (Idl‘𝑅))
1210, 11mp3an3 1479 . . 3 ((𝑅 ∈ RingOps ∧ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ≠ ∅) → ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ∈ (Idl‘𝑅))
139, 12syldan 603 . 2 ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → ∩ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆 ⊆ 𝑗} ∈ (Idl‘𝑅))
143, 13eqeltrd 2860 1 ((𝑅 ∈ RingOps ∧ 𝑆 ⊆ 𝑋) → (𝑅 IdlGen 𝑆) ∈ (Idl‘𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ∃wrex 3086  {crab 3412   ⊆ wss 3898  ∅c0 4278  ∩ cint 4906  ran crn 5648  ‘cfv 6527  (class class class)co 7408  1st c1st 7982  RingOpscrngo 38748  Idlcidl 38861   IdlGen cigen 38913
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 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
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-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-fo 6533  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7984  df-2nd 7985  df-grpo 31028  df-gid 31029  df-ablo 31080  df-rngo 38749  df-idl 38864  df-igen 38914
This theorem is used by:  igenval2  38920  isfldidl  38922  ispridlc  38924
  Copyright terms: Public domain W3C validator