Theorem o2timesd 20416

Description: An element of a ring-like structure plus itself is two times the element. "Two" in such a structure is the sum of the unity element with itself. This (formerly) part of the proof for ringcom 20489 depends on the (right) distributivity and the existence of a (left) multiplicative identity only. (Contributed by Gérard Lang, 4-Dec-2014.) (Revised by AV, 1-Feb-2025.)

Hypotheses

Ref	Expression
o2timesd.e	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) · 𝑧) = ((𝑥 · 𝑧) + (𝑦 · 𝑧)))
o2timesd.u	⊢ (𝜑 → 1 ∈ 𝐵)
o2timesd.i	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ( 1 · 𝑥) = 𝑥)
o2timesd.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)

Assertion

Ref	Expression
o2timesd	⊢ (𝜑 → (𝑋 + 𝑋) = (( 1 + 1 ) · 𝑋))

Distinct variable groups:   𝑥,𝐵,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧   𝑥, 1 ,𝑦,𝑧   𝑥, · ,𝑦,𝑧   𝑥, + ,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧)

Proof of Theorem o2timesd

Step	Hyp	Ref	Expression
1		o2timesd.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
2		o2timesd.i	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ( 1 · 𝑥) = 𝑥)
3		oveq2 7420	. . . . . . 7 ⊢ (𝑥 = 𝑋 → ( 1 · 𝑥) = ( 1 · 𝑋))
4		id 23	. . . . . . 7 ⊢ (𝑥 = 𝑋 → 𝑥 = 𝑋)
5	3, 4	eqeq12d 2777	. . . . . 6 ⊢ (𝑥 = 𝑋 → (( 1 · 𝑥) = 𝑥 ↔ ( 1 · 𝑋) = 𝑋))
6	5	rspcva 3575	. . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ( 1 · 𝑥) = 𝑥) → ( 1 · 𝑋) = 𝑋)
7	6	eqcomd 2767	. . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ( 1 · 𝑥) = 𝑥) → 𝑋 = ( 1 · 𝑋))
8	1, 2, 7	syl2anc 596	. . 3 ⊢ (𝜑 → 𝑋 = ( 1 · 𝑋))
9	8, 8	oveq12d 7430	. 2 ⊢ (𝜑 → (𝑋 + 𝑋) = (( 1 · 𝑋) + ( 1 · 𝑋)))
10		o2timesd.u	. . . 4 ⊢ (𝜑 → 1 ∈ 𝐵)
11	10, 10, 1	3jca 1146	. . 3 ⊢ (𝜑 → ( 1 ∈ 𝐵 ∧ 1 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵))
12		o2timesd.e	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) · 𝑧) = ((𝑥 · 𝑧) + (𝑦 · 𝑧)))
13		oveq1 7419	. . . . . 6 ⊢ (𝑥 = 1 → (𝑥 + 𝑦) = ( 1 + 𝑦))
14	13	oveq1d 7427	. . . . 5 ⊢ (𝑥 = 1 → ((𝑥 + 𝑦) · 𝑧) = (( 1 + 𝑦) · 𝑧))
15		oveq1 7419	. . . . . 6 ⊢ (𝑥 = 1 → (𝑥 · 𝑧) = ( 1 · 𝑧))
16	15	oveq1d 7427	. . . . 5 ⊢ (𝑥 = 1 → ((𝑥 · 𝑧) + (𝑦 · 𝑧)) = (( 1 · 𝑧) + (𝑦 · 𝑧)))
17	14, 16	eqeq12d 2777	. . . 4 ⊢ (𝑥 = 1 → (((𝑥 + 𝑦) · 𝑧) = ((𝑥 · 𝑧) + (𝑦 · 𝑧)) ↔ (( 1 + 𝑦) · 𝑧) = (( 1 · 𝑧) + (𝑦 · 𝑧))))
18		oveq2 7420	. . . . . 6 ⊢ (𝑦 = 1 → ( 1 + 𝑦) = ( 1 + 1 ))
19	18	oveq1d 7427	. . . . 5 ⊢ (𝑦 = 1 → (( 1 + 𝑦) · 𝑧) = (( 1 + 1 ) · 𝑧))
20		oveq1 7419	. . . . . 6 ⊢ (𝑦 = 1 → (𝑦 · 𝑧) = ( 1 · 𝑧))
21	20	oveq2d 7428	. . . . 5 ⊢ (𝑦 = 1 → (( 1 · 𝑧) + (𝑦 · 𝑧)) = (( 1 · 𝑧) + ( 1 · 𝑧)))
22	19, 21	eqeq12d 2777	. . . 4 ⊢ (𝑦 = 1 → ((( 1 + 𝑦) · 𝑧) = (( 1 · 𝑧) + (𝑦 · 𝑧)) ↔ (( 1 + 1 ) · 𝑧) = (( 1 · 𝑧) + ( 1 · 𝑧))))
23		oveq2 7420	. . . . 5 ⊢ (𝑧 = 𝑋 → (( 1 + 1 ) · 𝑧) = (( 1 + 1 ) · 𝑋))
24		oveq2 7420	. . . . . 6 ⊢ (𝑧 = 𝑋 → ( 1 · 𝑧) = ( 1 · 𝑋))
25	24, 24	oveq12d 7430	. . . . 5 ⊢ (𝑧 = 𝑋 → (( 1 · 𝑧) + ( 1 · 𝑧)) = (( 1 · 𝑋) + ( 1 · 𝑋)))
26	23, 25	eqeq12d 2777	. . . 4 ⊢ (𝑧 = 𝑋 → ((( 1 + 1 ) · 𝑧) = (( 1 · 𝑧) + ( 1 · 𝑧)) ↔ (( 1 + 1 ) · 𝑋) = (( 1 · 𝑋) + ( 1 · 𝑋))))
27	17, 22, 26	rspc3v 3592	. . 3 ⊢ (( 1 ∈ 𝐵 ∧ 1 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 + 𝑦) · 𝑧) = ((𝑥 · 𝑧) + (𝑦 · 𝑧)) → (( 1 + 1 ) · 𝑋) = (( 1 · 𝑋) + ( 1 · 𝑋))))
28	11, 12, 27	sylc 66	. 2 ⊢ (𝜑 → (( 1 + 1 ) · 𝑋) = (( 1 · 𝑋) + ( 1 · 𝑋)))
29	9, 28	eqtr4d 2799	1 ⊢ (𝜑 → (𝑋 + 𝑋) = (( 1 + 1 ) · 𝑋))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  (class class class)co 7412

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-ext 2733

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-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  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-iota 6487  df-fv 6539  df-ov 7415

This theorem is used by:  rglcom4d  20417  srgo2times  20418  ringo2times  20484