MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rrgval Structured version   Visualization version   GIF version

Theorem rrgval 19489
Description: Value of the set or left-regular elements in a ring. (Contributed by Stefan O'Rear, 22-Mar-2015.)
Hypotheses
Ref Expression
rrgval.e 𝐸 = (RLReg‘𝑅)
rrgval.b 𝐵 = (Base‘𝑅)
rrgval.t · = (.r𝑅)
rrgval.z 0 = (0g𝑅)
Assertion
Ref Expression
rrgval 𝐸 = {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )}
Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦
Allowed substitution hints:   · (𝑥,𝑦)   𝐸(𝑥,𝑦)   0 (𝑥,𝑦)

Proof of Theorem rrgval
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 rrgval.e . 2 𝐸 = (RLReg‘𝑅)
2 fveq2 6352 . . . . . 6 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
3 rrgval.b . . . . . 6 𝐵 = (Base‘𝑅)
42, 3syl6eqr 2812 . . . . 5 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
5 fveq2 6352 . . . . . . . . . 10 (𝑟 = 𝑅 → (.r𝑟) = (.r𝑅))
6 rrgval.t . . . . . . . . . 10 · = (.r𝑅)
75, 6syl6eqr 2812 . . . . . . . . 9 (𝑟 = 𝑅 → (.r𝑟) = · )
87oveqd 6830 . . . . . . . 8 (𝑟 = 𝑅 → (𝑥(.r𝑟)𝑦) = (𝑥 · 𝑦))
9 fveq2 6352 . . . . . . . . 9 (𝑟 = 𝑅 → (0g𝑟) = (0g𝑅))
10 rrgval.z . . . . . . . . 9 0 = (0g𝑅)
119, 10syl6eqr 2812 . . . . . . . 8 (𝑟 = 𝑅 → (0g𝑟) = 0 )
128, 11eqeq12d 2775 . . . . . . 7 (𝑟 = 𝑅 → ((𝑥(.r𝑟)𝑦) = (0g𝑟) ↔ (𝑥 · 𝑦) = 0 ))
1311eqeq2d 2770 . . . . . . 7 (𝑟 = 𝑅 → (𝑦 = (0g𝑟) ↔ 𝑦 = 0 ))
1412, 13imbi12d 333 . . . . . 6 (𝑟 = 𝑅 → (((𝑥(.r𝑟)𝑦) = (0g𝑟) → 𝑦 = (0g𝑟)) ↔ ((𝑥 · 𝑦) = 0𝑦 = 0 )))
154, 14raleqbidv 3291 . . . . 5 (𝑟 = 𝑅 → (∀𝑦 ∈ (Base‘𝑟)((𝑥(.r𝑟)𝑦) = (0g𝑟) → 𝑦 = (0g𝑟)) ↔ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )))
164, 15rabeqbidv 3335 . . . 4 (𝑟 = 𝑅 → {𝑥 ∈ (Base‘𝑟) ∣ ∀𝑦 ∈ (Base‘𝑟)((𝑥(.r𝑟)𝑦) = (0g𝑟) → 𝑦 = (0g𝑟))} = {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )})
17 df-rlreg 19485 . . . 4 RLReg = (𝑟 ∈ V ↦ {𝑥 ∈ (Base‘𝑟) ∣ ∀𝑦 ∈ (Base‘𝑟)((𝑥(.r𝑟)𝑦) = (0g𝑟) → 𝑦 = (0g𝑟))})
18 fvex 6362 . . . . . 6 (Base‘𝑅) ∈ V
193, 18eqeltri 2835 . . . . 5 𝐵 ∈ V
2019rabex 4964 . . . 4 {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )} ∈ V
2116, 17, 20fvmpt 6444 . . 3 (𝑅 ∈ V → (RLReg‘𝑅) = {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )})
22 fvprc 6346 . . . 4 𝑅 ∈ V → (RLReg‘𝑅) = ∅)
23 fvprc 6346 . . . . . . 7 𝑅 ∈ V → (Base‘𝑅) = ∅)
243, 23syl5eq 2806 . . . . . 6 𝑅 ∈ V → 𝐵 = ∅)
25 rabeq 3332 . . . . . 6 (𝐵 = ∅ → {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )} = {𝑥 ∈ ∅ ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )})
2624, 25syl 17 . . . . 5 𝑅 ∈ V → {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )} = {𝑥 ∈ ∅ ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )})
27 rab0 4098 . . . . 5 {𝑥 ∈ ∅ ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )} = ∅
2826, 27syl6eq 2810 . . . 4 𝑅 ∈ V → {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )} = ∅)
2922, 28eqtr4d 2797 . . 3 𝑅 ∈ V → (RLReg‘𝑅) = {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )})
3021, 29pm2.61i 176 . 2 (RLReg‘𝑅) = {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )}
311, 30eqtri 2782 1 𝐸 = {𝑥𝐵 ∣ ∀𝑦𝐵 ((𝑥 · 𝑦) = 0𝑦 = 0 )}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1632  wcel 2139  wral 3050  {crab 3054  Vcvv 3340  c0 4058  cfv 6049  (class class class)co 6813  Basecbs 16059  .rcmulr 16144  0gc0g 16302  RLRegcrlreg 19481
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-sbc 3577  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-sn 4322  df-pr 4324  df-op 4328  df-uni 4589  df-br 4805  df-opab 4865  df-mpt 4882  df-id 5174  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-iota 6012  df-fun 6051  df-fv 6057  df-ov 6816  df-rlreg 19485
This theorem is referenced by:  isrrg  19490  rrgeq0  19492  rrgss  19494
  Copyright terms: Public domain W3C validator