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

Theorem rngo2 38934
Description: Obsolete theorem, use ringadd2 20510 instead. A ring element plus itself is two times the element. (Contributed by Steve Rodriguez, 9-Sep-2007.) (Revised by Mario Carneiro, 22-Dec-2013.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypotheses
Ref Expression
ringi.1 𝐺 = (1st ‘𝑅)
ringi.2 𝐻 = (2nd ‘𝑅)
ringi.3 𝑋 = ran 𝐺
Assertion
Ref Expression
rngo2 ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 (𝐴𝐺𝐴) = ((𝑥𝐺𝑥)𝐻𝐴))
Distinct variable groups:   𝑥,𝐺   𝑥,𝐻   𝑥,𝑋   𝑥,𝐴   𝑥,𝑅

Proof of Theorem rngo2
StepHypRef Expression
1 ringi.1 . . 3 𝐺 = (1st ‘𝑅)
2 ringi.2 . . 3 𝐻 = (2nd ‘𝑅)
3 ringi.3 . . 3 𝑋 = ran 𝐺
41, 2, 3rngoid 38929 . 2 ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 ((𝑥𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑥) = 𝐴))
5 oveq12 7429 . . . . . . 7 (((𝑥𝐻𝐴) = 𝐴 ∧ (𝑥𝐻𝐴) = 𝐴) → ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴)) = (𝐴𝐺𝐴))
65anidms 577 . . . . . 6 ((𝑥𝐻𝐴) = 𝐴 → ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴)) = (𝐴𝐺𝐴))
76eqcomd 2766 . . . . 5 ((𝑥𝐻𝐴) = 𝐴 → (𝐴𝐺𝐴) = ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴)))
8 simpll 779 . . . . . . 7 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → 𝑅 ∈ RingOps)
9 simpr 490 . . . . . . 7 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
10 simplr 781 . . . . . . 7 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑋)
111, 2, 3rngodir 38932 . . . . . . 7 ((𝑅 ∈ RingOps ∧ (𝑥 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝑥𝐺𝑥)𝐻𝐴) = ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴)))
128, 9, 9, 10, 11syl13anc 1399 . . . . . 6 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → ((𝑥𝐺𝑥)𝐻𝐴) = ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴)))
1312eqeq2d 2771 . . . . 5 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → ((𝐴𝐺𝐴) = ((𝑥𝐺𝑥)𝐻𝐴) ↔ (𝐴𝐺𝐴) = ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴))))
147, 13imbitrrid 249 . . . 4 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → ((𝑥𝐻𝐴) = 𝐴 → (𝐴𝐺𝐴) = ((𝑥𝐺𝑥)𝐻𝐴)))
1514adantrd 497 . . 3 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → (((𝑥𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑥) = 𝐴) → (𝐴𝐺𝐴) = ((𝑥𝐺𝑥)𝐻𝐴)))
1615reximdva 3175 . 2 ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (∃𝑥 ∈ 𝑋 ((𝑥𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑥) = 𝐴) → ∃𝑥 ∈ 𝑋 (𝐴𝐺𝐴) = ((𝑥𝐺𝑥)𝐻𝐴)))
174, 16mpd 16 1 ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 (𝐴𝐺𝐴) = ((𝑥𝐺𝑥)𝐻𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  ran crn 5651  ‘cfv 6538  (class class class)co 7420  1st c1st 7999  2nd c2nd 8000  RingOpscrngo 38921
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7423  df-1st 8001  df-2nd 8002  df-rngo 38922
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator