Theorem rngoid 35672

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 35669	. . . 4 ⊢ (𝑅 ∈ RingOps → ((𝐺 ∈ AbelOp ∧ 𝐻:(𝑋 × 𝑋)⟶𝑋) ∧ (∀𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑢𝐻𝑥)𝐻𝑦) = (𝑢𝐻(𝑥𝐻𝑦)) ∧ (𝑢𝐻(𝑥𝐺𝑦)) = ((𝑢𝐻𝑥)𝐺(𝑢𝐻𝑦)) ∧ ((𝑢𝐺𝑥)𝐻𝑦) = ((𝑢𝐻𝑦)𝐺(𝑥𝐻𝑦))) ∧ ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))))
5	4	simprrd 774	. . 3 ⊢ (𝑅 ∈ RingOps → ∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
6		r19.12 3233	. . 3 ⊢ (∃𝑢 ∈ 𝑋 ∀𝑥 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
7	5, 6	syl 17	. 2 ⊢ (𝑅 ∈ RingOps → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥))
8		oveq2 7172	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑢𝐻𝑥) = (𝑢𝐻𝐴))
9		id 22	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
10	8, 9	eqeq12d 2754	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑢𝐻𝑥) = 𝑥 ↔ (𝑢𝐻𝐴) = 𝐴))
11		oveq1 7171	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝐻𝑢) = (𝐴𝐻𝑢))
12	11, 9	eqeq12d 2754	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝐻𝑢) = 𝑥 ↔ (𝐴𝐻𝑢) = 𝐴))
13	10, 12	anbi12d 634	. . . 4 ⊢ (𝑥 = 𝐴 → (((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴)))
14	13	rexbidv 3206	. . 3 ⊢ (𝑥 = 𝐴 → (∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ↔ ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴)))
15	14	rspccva 3523	. 2 ⊢ ((∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝑥) = 𝑥 ∧ (𝑥𝐻𝑢) = 𝑥) ∧ 𝐴 ∈ 𝑋) → ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴))
16	7, 15	sylan 583	1 ⊢ ((𝑅 ∈ RingOps ∧ 𝐴 ∈ 𝑋) → ∃𝑢 ∈ 𝑋 ((𝑢𝐻𝐴) = 𝐴 ∧ (𝐴𝐻𝑢) = 𝐴))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1088   = wceq 1542   ∈ wcel 2113  ∀wral 3053  ∃wrex 3054   × cxp 5517  ran crn 5520  ⟶wf 6329  ‘cfv 6333  (class class class)co 7164  1^st c1st 7705  2^nd c2nd 7706  AbelOpcablo 28471  RingOpscrngo 35664

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1916  ax-6 1974  ax-7 2019  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2161  ax-12 2178  ax-ext 2710  ax-sep 5164  ax-nul 5171  ax-pr 5293  ax-un 7473

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2540  df-eu 2570  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-ne 2935  df-ral 3058  df-rex 3059  df-rab 3062  df-v 3399  df-sbc 3680  df-dif 3844  df-un 3846  df-in 3848  df-ss 3858  df-nul 4210  df-if 4412  df-sn 4514  df-pr 4516  df-op 4520  df-uni 4794  df-br 5028  df-opab 5090  df-mpt 5108  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-iota 6291  df-fun 6335  df-fn 6336  df-f 6337  df-fv 6341  df-ov 7167  df-1st 7707  df-2nd 7708  df-rngo 35665

This theorem is referenced by:  rngo2  35677