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 38742
Description: Obsolete theorem, use rspcl 21375 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 38740 . 2 ((𝑅 ∈ RingOps ∧ 𝑆𝑋) → (𝑅 IdlGen 𝑆) = {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆𝑗})
41, 2rngoidl 38703 . . . . 5 (𝑅 ∈ RingOps → 𝑋 ∈ (Idl‘𝑅))
5 sseq2 3962 . . . . . 6 (𝑗 = 𝑋 → (𝑆𝑗𝑆𝑋))
65rspcev 3580 . . . . 5 ((𝑋 ∈ (Idl‘𝑅) ∧ 𝑆𝑋) → ∃𝑗 ∈ (Idl‘𝑅)𝑆𝑗)
74, 6sylan 591 . . . 4 ((𝑅 ∈ RingOps ∧ 𝑆𝑋) → ∃𝑗 ∈ (Idl‘𝑅)𝑆𝑗)
8 rabn0 4345 . . . 4 ({𝑗 ∈ (Idl‘𝑅) ∣ 𝑆𝑗} ≠ ∅ ↔ ∃𝑗 ∈ (Idl‘𝑅)𝑆𝑗)
97, 8sylibr 237 . . 3 ((𝑅 ∈ RingOps ∧ 𝑆𝑋) → {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆𝑗} ≠ ∅)
10 ssrab2 4033 . . . 4 {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆𝑗} ⊆ (Idl‘𝑅)
11 intidl 38708 . . . 4 ((𝑅 ∈ RingOps ∧ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆𝑗} ≠ ∅ ∧ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆𝑗} ⊆ (Idl‘𝑅)) → {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆𝑗} ∈ (Idl‘𝑅))
1210, 11mp3an3 1478 . . 3 ((𝑅 ∈ RingOps ∧ {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆𝑗} ≠ ∅) → {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆𝑗} ∈ (Idl‘𝑅))
139, 12syldan 602 . 2 ((𝑅 ∈ RingOps ∧ 𝑆𝑋) → {𝑗 ∈ (Idl‘𝑅) ∣ 𝑆𝑗} ∈ (Idl‘𝑅))
143, 13eqeltrd 2862 1 ((𝑅 ∈ RingOps ∧ 𝑆𝑋) → (𝑅 IdlGen 𝑆) ∈ (Idl‘𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400   = wceq 1569  wcel 2142  wne 2957  wrex 3088  {crab 3415  wss 3904  c0 4285   cint 4911  ran crn 5661  cfv 6536  (class class class)co 7412  1st c1st 7982  RingOpscrngo 38573  Idlcidl 38686   IdlGen cigen 38738
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fo 6542  df-fv 6544  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7984  df-2nd 7985  df-grpo 30856  df-gid 30857  df-ablo 30908  df-rngo 38574  df-idl 38689  df-igen 38739
This theorem is used by:  igenval2  38745  isfldidl  38747  ispridlc  38749
  Copyright terms: Public domain W3C validator