Theorem rngoid 38594

Description: Obsolete theorem, use ringid 20389 instead. The multiplication operation of a unital ring has (one or more) identity elements. (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
rngoid	⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴))

Distinct variable groups:   𝑢,𝐺   𝑢,𝐻   𝑢,𝑋   𝑢,𝐴   𝑢,𝑅

Proof of Theorem rngoid

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ringi.1	. . . . 5 ⊢ 𝐺 = (1st ‘𝑅)
2		ringi.2	. . . . 5 ⊢ 𝐻 = (2nd ‘𝑅)
3		ringi.3	. . . . 5 ⊢ 𝑋 = ran 𝐺
4	1, 2, 3	rngoi 38591	. . . 4 ⊢ (𝑅 ∈ RingOps → ((𝐺 ∈ AbelOp ∧ 𝐻:(𝑋 × 𝑋)⟶𝑋) ∧ (∀𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑢𝐻𝑥)𝐻𝑦) = (𝑢𝐻(𝑥𝐻𝑦)) ∧ (𝑢𝐻(𝑥𝐺𝑦)) = ((𝑢𝐻𝑥)𝐺(𝑢𝐻𝑦)) ∧ ((𝑢𝐺𝑥)𝐻𝑦) = ((𝑢𝐻𝑦)𝐺(𝑥𝐻𝑦))) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))))
5	4	simprrd 786	. . 3 ⊢ (𝑅 ∈ RingOps → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
6		r19.12 3317	. . 3 ⊢ (∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
7	5, 6	syl 18	. 2 ⊢ (𝑅 ∈ RingOps → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
8		oveq2 7431	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑢𝐻𝑥) = (𝑢𝐻𝐴))
9		id 23	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
10	8, 9	eqeq12d 2782	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑢𝐻𝐴) = 𝐴))
11		oveq1 7430	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝐻𝑢) = (𝐴𝐻𝑢))
12	11, 9	eqeq12d 2782	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝐻𝑢) = 𝑥 ↔ (𝐴𝐻𝑢) = 𝐴))
13	10, 12	anbi12d 644	. . . 4 ⊢ (𝑥 = 𝐴 → (((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴)))
14	13	rexbidv 3192	. . 3 ⊢ (𝑥 = 𝐴 → (∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴)))
15	14	rspccva 3583	. 2 ⊢ ((∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ∧ 𝐴 ∈ 𝑋) → ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴))
16	7, 15	sylan 592	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3082  ∃wrex 3092   × cxp 5664  ran crn 5667  ⟶wf 6539  ‘cfv 6543  (class class class)co 7423  1^st c1st 7993  2^nd c2nd 7994  AbelOpcablo 30933  RingOpscrngo 38586

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409  ax-un 7745

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7426  df-1st 7995  df-2nd 7996  df-rngo 38587

This theorem is used by:  rngo2  38599