Theorem rngoid 38099

Description: 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.)

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 38096	. . . 4 ⊢ (𝑅 ∈ RingOps → ((𝐺 ∈ AbelOp ∧ 𝐻:(𝑋 × 𝑋)⟶𝑋) ∧ (∀𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑢𝐻𝑥)𝐻𝑦) = (𝑢𝐻(𝑥𝐻𝑦)) ∧ (𝑢𝐻(𝑥𝐺𝑦)) = ((𝑢𝐻𝑥)𝐺(𝑢𝐻𝑦)) ∧ ((𝑢𝐺𝑥)𝐻𝑦) = ((𝑢𝐻𝑦)𝐺(𝑥𝐻𝑦))) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))))
5	4	simprrd 773	. . 3 ⊢ (𝑅 ∈ RingOps → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
6		r19.12 3285	. . 3 ⊢ (∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
7	5, 6	syl 17	. 2 ⊢ (𝑅 ∈ RingOps → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
8		oveq2 7366	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑢𝐻𝑥) = (𝑢𝐻𝐴))
9		id 22	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
10	8, 9	eqeq12d 2752	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑢𝐻𝐴) = 𝐴))
11		oveq1 7365	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝐻𝑢) = (𝐴𝐻𝑢))
12	11, 9	eqeq12d 2752	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝐻𝑢) = 𝑥 ↔ (𝐴𝐻𝑢) = 𝐴))
13	10, 12	anbi12d 632	. . . 4 ⊢ (𝑥 = 𝐴 → (((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴)))
14	13	rexbidv 3160	. . 3 ⊢ (𝑥 = 𝐴 → (∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴)))
15	14	rspccva 3575	. 2 ⊢ ((∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ∧ 𝐴 ∈ 𝑋) → ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴))
16	7, 15	sylan 580	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3051  ∃wrex 3060   × cxp 5622  ran crn 5625  ⟶wf 6488  ‘cfv 6492  (class class class)co 7358  1^st c1st 7931  2^nd c2nd 7932  AbelOpcablo 30619  RingOpscrngo 38091

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-ov 7361  df-1st 7933  df-2nd 7934  df-rngo 38092

This theorem is referenced by:  rngo2  38104