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 38809
Description: Obsolete theorem, use ringadd2 20485 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 38804 . 2 ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 ((𝑥𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑥) = 𝐴))
5 oveq12 7421 . . . . . . 7 (((𝑥𝐻𝐴) = 𝐴 ∧ (𝑥𝐻𝐴) = 𝐴) → ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴)) = (𝐴𝐺𝐴))
65anidms 577 . . . . . 6 ((𝑥𝐻𝐴) = 𝐴 → ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴)) = (𝐴𝐺𝐴))
76eqcomd 2767 . . . . 5 ((𝑥𝐻𝐴) = 𝐴 → (𝐴𝐺𝐴) = ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴)))
8 simpll 779 . . . . . . 7 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → 𝑅 ∈ RingOps)
9 simpr 490 . . . . . . 7 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
10 simplr 781 . . . . . . 7 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑋)
111, 2, 3rngodir 38807 . . . . . . 7 ((𝑅 ∈ RingOps ∧ (𝑥 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝑥𝐺𝑥)𝐻𝐴) = ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴)))
128, 9, 9, 10, 11syl13anc 1399 . . . . . 6 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → ((𝑥𝐺𝑥)𝐻𝐴) = ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴)))
1312eqeq2d 2772 . . . . 5 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → ((𝐴𝐺𝐴) = ((𝑥𝐺𝑥)𝐻𝐴) ↔ (𝐴𝐺𝐴) = ((𝑥𝐻𝐴)𝐺(𝑥𝐻𝐴))))
147, 13imbitrrid 249 . . . 4 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → ((𝑥𝐻𝐴) = 𝐴 → (𝐴𝐺𝐴) = ((𝑥𝐺𝑥)𝐻𝐴)))
1514adantrd 497 . . 3 (((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) ∧ 𝑥 ∈ 𝑋) → (((𝑥𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑥) = 𝐴) → (𝐴𝐺𝐴) = ((𝑥𝐺𝑥)𝐻𝐴)))
1615reximdva 3176 . 2 ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → (∃𝑥 ∈ 𝑋 ((𝑥𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑥) = 𝐴) → ∃𝑥 ∈ 𝑋 (𝐴𝐺𝐴) = ((𝑥𝐺𝑥)𝐻𝐴)))
174, 16mpd 16 1 ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 (𝐴𝐺𝐴) = ((𝑥𝐺𝑥)𝐻𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  ran crn 5652  ‘cfv 6531  (class class class)co 7412  1st c1st 7988  2nd c2nd 7989  RingOpscrngo 38796
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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539  df-ov 7415  df-1st 7990  df-2nd 7991  df-rngo 38797
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator