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

Theorem idlval 38771
Description: Obsolete theorem, use 2idlval 21459 instead. The class of ideals of a ring. (Contributed by Jeff Madsen, 10-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
idlval.1 𝐺 = (1st𝑅)
idlval.2 𝐻 = (2nd𝑅)
idlval.3 𝑋 = ran 𝐺
idlval.4 𝑍 = (GId‘𝐺)
Assertion
Ref Expression
idlval (𝑅 ∈ RingOps → (Idl‘𝑅) = {𝑖 ∈ 𝒫 𝑋 ∣ (𝑍𝑖 ∧ ∀𝑥𝑖 (∀𝑦𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))})
Distinct variable groups:   𝑥,𝑅,𝑦,𝑧,𝑖   𝑧,𝑋,𝑖   𝑖,𝑍   𝑖,𝐺   𝑖,𝐻
Allowed substitution hints:   𝐺(𝑥, 𝑦, 𝑧)   𝐻(𝑥, 𝑦, 𝑧)   𝑋(𝑥, 𝑦)   𝑍(𝑥, 𝑦, 𝑧)

Proof of Theorem idlval
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6882 . . . . . . 7 (𝑟 = 𝑅 → (1st𝑟) = (1st𝑅))
2 idlval.1 . . . . . . 7 𝐺 = (1st𝑅)
31, 2eqtr4di 2815 . . . . . 6 (𝑟 = 𝑅 → (1st𝑟) = 𝐺)
43rneqd 5926 . . . . 5 (𝑟 = 𝑅 → ran (1st𝑟) = ran 𝐺)
5 idlval.3 . . . . 5 𝑋 = ran 𝐺
64, 5eqtr4di 2815 . . . 4 (𝑟 = 𝑅 → ran (1st𝑟) = 𝑋)
76pweqd 4577 . . 3 (𝑟 = 𝑅 → 𝒫 ran (1st𝑟) = 𝒫 𝑋)
83fveq2d 6886 . . . . . 6 (𝑟 = 𝑅 → (GId‘(1st𝑟)) = (GId‘𝐺))
9 idlval.4 . . . . . 6 𝑍 = (GId‘𝐺)
108, 9eqtr4di 2815 . . . . 5 (𝑟 = 𝑅 → (GId‘(1st𝑟)) = 𝑍)
1110eleq1d 2847 . . . 4 (𝑟 = 𝑅 → ((GId‘(1st𝑟)) ∈ 𝑖𝑍𝑖))
123oveqd 7434 . . . . . . . 8 (𝑟 = 𝑅 → (𝑥(1st𝑟)𝑦) = (𝑥𝐺𝑦))
1312eleq1d 2847 . . . . . . 7 (𝑟 = 𝑅 → ((𝑥(1st𝑟)𝑦) ∈ 𝑖 ↔ (𝑥𝐺𝑦) ∈ 𝑖))
1413ralbidv 3187 . . . . . 6 (𝑟 = 𝑅 → (∀𝑦𝑖 (𝑥(1st𝑟)𝑦) ∈ 𝑖 ↔ ∀𝑦𝑖 (𝑥𝐺𝑦) ∈ 𝑖))
15 fveq2 6882 . . . . . . . . . . 11 (𝑟 = 𝑅 → (2nd𝑟) = (2nd𝑅))
16 idlval.2 . . . . . . . . . . 11 𝐻 = (2nd𝑅)
1715, 16eqtr4di 2815 . . . . . . . . . 10 (𝑟 = 𝑅 → (2nd𝑟) = 𝐻)
1817oveqd 7434 . . . . . . . . 9 (𝑟 = 𝑅 → (𝑧(2nd𝑟)𝑥) = (𝑧𝐻𝑥))
1918eleq1d 2847 . . . . . . . 8 (𝑟 = 𝑅 → ((𝑧(2nd𝑟)𝑥) ∈ 𝑖 ↔ (𝑧𝐻𝑥) ∈ 𝑖))
2017oveqd 7434 . . . . . . . . 9 (𝑟 = 𝑅 → (𝑥(2nd𝑟)𝑧) = (𝑥𝐻𝑧))
2120eleq1d 2847 . . . . . . . 8 (𝑟 = 𝑅 → ((𝑥(2nd𝑟)𝑧) ∈ 𝑖 ↔ (𝑥𝐻𝑧) ∈ 𝑖))
2219, 21anbi12d 644 . . . . . . 7 (𝑟 = 𝑅 → (((𝑧(2nd𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd𝑟)𝑧) ∈ 𝑖) ↔ ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))
236, 22raleqbidv 3336 . . . . . 6 (𝑟 = 𝑅 → (∀𝑧 ∈ ran (1st𝑟)((𝑧(2nd𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd𝑟)𝑧) ∈ 𝑖) ↔ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))
2414, 23anbi12d 644 . . . . 5 (𝑟 = 𝑅 → ((∀𝑦𝑖 (𝑥(1st𝑟)𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ ran (1st𝑟)((𝑧(2nd𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd𝑟)𝑧) ∈ 𝑖)) ↔ (∀𝑦𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖))))
2524ralbidv 3187 . . . 4 (𝑟 = 𝑅 → (∀𝑥𝑖 (∀𝑦𝑖 (𝑥(1st𝑟)𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ ran (1st𝑟)((𝑧(2nd𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd𝑟)𝑧) ∈ 𝑖)) ↔ ∀𝑥𝑖 (∀𝑦𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖))))
2611, 25anbi12d 644 . . 3 (𝑟 = 𝑅 → (((GId‘(1st𝑟)) ∈ 𝑖 ∧ ∀𝑥𝑖 (∀𝑦𝑖 (𝑥(1st𝑟)𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ ran (1st𝑟)((𝑧(2nd𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd𝑟)𝑧) ∈ 𝑖))) ↔ (𝑍𝑖 ∧ ∀𝑥𝑖 (∀𝑦𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))))
277, 26rabeqbidv 3432 . 2 (𝑟 = 𝑅 → {𝑖 ∈ 𝒫 ran (1st𝑟) ∣ ((GId‘(1st𝑟)) ∈ 𝑖 ∧ ∀𝑥𝑖 (∀𝑦𝑖 (𝑥(1st𝑟)𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ ran (1st𝑟)((𝑧(2nd𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd𝑟)𝑧) ∈ 𝑖)))} = {𝑖 ∈ 𝒫 𝑋 ∣ (𝑍𝑖 ∧ ∀𝑥𝑖 (∀𝑦𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))})
28 df-idl 38768 . 2 Idl = (𝑟 ∈ RingOps ↦ {𝑖 ∈ 𝒫 ran (1st𝑟) ∣ ((GId‘(1st𝑟)) ∈ 𝑖 ∧ ∀𝑥𝑖 (∀𝑦𝑖 (𝑥(1st𝑟)𝑦) ∈ 𝑖 ∧ ∀𝑧 ∈ ran (1st𝑟)((𝑧(2nd𝑟)𝑥) ∈ 𝑖 ∧ (𝑥(2nd𝑟)𝑧) ∈ 𝑖)))})
292fvexi 6896 . . . . . 6 𝐺 ∈ V
3029rnex 7911 . . . . 5 ran 𝐺 ∈ V
315, 30eqeltri 2858 . . . 4 𝑋 ∈ V
3231pwex 5349 . . 3 𝒫 𝑋 ∈ V
3332rabex 5307 . 2 {𝑖 ∈ 𝒫 𝑋 ∣ (𝑍𝑖 ∧ ∀𝑥𝑖 (∀𝑦𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))} ∈ V
3427, 28, 33fvmpt 6990 1 (𝑅 ∈ RingOps → (Idl‘𝑅) = {𝑖 ∈ 𝒫 𝑋 ∣ (𝑍𝑖 ∧ ∀𝑥𝑖 (∀𝑦𝑖 (𝑥𝐺𝑦) ∈ 𝑖 ∧ ∀𝑧𝑋 ((𝑧𝐻𝑥) ∈ 𝑖 ∧ (𝑥𝐻𝑧) ∈ 𝑖)))})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wral 3078  {crab 3414  Vcvv 3453  𝒫 cpw 4560  ran crn 5660  cfv 6537  (class class class)co 7417  1st c1st 7988  2nd c2nd 7989  GIdcgi 30979  RingOpscrngo 38652  Idlcidl 38765
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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740
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 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-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7420  df-idl 38768
This theorem is used by:  isidl  38772
  Copyright terms: Public domain W3C validator