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

Theorem idladdcl 35184
Description: An ideal is closed under addition. (Contributed by Jeff Madsen, 10-Jun-2010.)
Hypothesis
Ref Expression
idladdcl.1 𝐺 = (1st𝑅)
Assertion
Ref Expression
idladdcl (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ (𝐴𝐼𝐵𝐼)) → (𝐴𝐺𝐵) ∈ 𝐼)

Proof of Theorem idladdcl
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 idladdcl.1 . . . . . 6 𝐺 = (1st𝑅)
2 eqid 2826 . . . . . 6 (2nd𝑅) = (2nd𝑅)
3 eqid 2826 . . . . . 6 ran 𝐺 = ran 𝐺
4 eqid 2826 . . . . . 6 (GId‘𝐺) = (GId‘𝐺)
51, 2, 3, 4isidl 35179 . . . . 5 (𝑅 ∈ RingOps → (𝐼 ∈ (Idl‘𝑅) ↔ (𝐼 ⊆ ran 𝐺 ∧ (GId‘𝐺) ∈ 𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ ran 𝐺((𝑧(2nd𝑅)𝑥) ∈ 𝐼 ∧ (𝑥(2nd𝑅)𝑧) ∈ 𝐼)))))
65biimpa 477 . . . 4 ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → (𝐼 ⊆ ran 𝐺 ∧ (GId‘𝐺) ∈ 𝐼 ∧ ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ ran 𝐺((𝑧(2nd𝑅)𝑥) ∈ 𝐼 ∧ (𝑥(2nd𝑅)𝑧) ∈ 𝐼))))
76simp3d 1138 . . 3 ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → ∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ ran 𝐺((𝑧(2nd𝑅)𝑥) ∈ 𝐼 ∧ (𝑥(2nd𝑅)𝑧) ∈ 𝐼)))
8 simpl 483 . . . 4 ((∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ ran 𝐺((𝑧(2nd𝑅)𝑥) ∈ 𝐼 ∧ (𝑥(2nd𝑅)𝑧) ∈ 𝐼)) → ∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼)
98ralimi 3165 . . 3 (∀𝑥𝐼 (∀𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 ∧ ∀𝑧 ∈ ran 𝐺((𝑧(2nd𝑅)𝑥) ∈ 𝐼 ∧ (𝑥(2nd𝑅)𝑧) ∈ 𝐼)) → ∀𝑥𝐼𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼)
107, 9syl 17 . 2 ((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) → ∀𝑥𝐼𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼)
11 oveq1 7157 . . . 4 (𝑥 = 𝐴 → (𝑥𝐺𝑦) = (𝐴𝐺𝑦))
1211eleq1d 2902 . . 3 (𝑥 = 𝐴 → ((𝑥𝐺𝑦) ∈ 𝐼 ↔ (𝐴𝐺𝑦) ∈ 𝐼))
13 oveq2 7158 . . . 4 (𝑦 = 𝐵 → (𝐴𝐺𝑦) = (𝐴𝐺𝐵))
1413eleq1d 2902 . . 3 (𝑦 = 𝐵 → ((𝐴𝐺𝑦) ∈ 𝐼 ↔ (𝐴𝐺𝐵) ∈ 𝐼))
1512, 14rspc2v 3637 . 2 ((𝐴𝐼𝐵𝐼) → (∀𝑥𝐼𝑦𝐼 (𝑥𝐺𝑦) ∈ 𝐼 → (𝐴𝐺𝐵) ∈ 𝐼))
1610, 15mpan9 507 1 (((𝑅 ∈ RingOps ∧ 𝐼 ∈ (Idl‘𝑅)) ∧ (𝐴𝐼𝐵𝐼)) → (𝐴𝐺𝐵) ∈ 𝐼)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1081   = wceq 1530  wcel 2107  wral 3143  wss 3940  ran crn 5555  cfv 6354  (class class class)co 7150  1st c1st 7683  2nd c2nd 7684  GIdcgi 28200  RingOpscrngo 35059  Idlcidl 35172
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2798  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5326  ax-un 7455
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2620  df-eu 2652  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ral 3148  df-rex 3149  df-rab 3152  df-v 3502  df-sbc 3777  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-nul 4296  df-if 4471  df-pw 4544  df-sn 4565  df-pr 4567  df-op 4571  df-uni 4838  df-br 5064  df-opab 5126  df-mpt 5144  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-iota 6313  df-fun 6356  df-fv 6362  df-ov 7153  df-idl 35175
This theorem is referenced by:  idlsubcl  35188  intidl  35194  unichnidl  35196
  Copyright terms: Public domain W3C validator