mulgass2 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > mulgass2		GIF version

Theorem mulgass2 13240

Description: An associative property between group multiple and ring multiplication. (Contributed by Mario Carneiro, 14-Jun-2015.)

**Hypotheses**
Ref	Expression
mulgass2.b	⊢ 𝐵 = (Base‘𝑅)
mulgass2.m	⊢ · = (._g‘𝑅)
mulgass2.t	⊢ × = (._r‘𝑅)

**Assertion**
Ref	Expression
mulgass2	⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑁 · 𝑋) × 𝑌) = (𝑁 · (𝑋 × 𝑌)))

Proof of Theorem mulgass2 Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq1 5884	. . . . . . 7 ⊢ (𝑥 = 0 → (𝑥 · 𝑋) = (0 · 𝑋))
2	1	oveq1d 5892	. . . . . 6 ⊢ (𝑥 = 0 → ((𝑥 · 𝑋) × 𝑌) = ((0 · 𝑋) × 𝑌))
3		oveq1 5884	. . . . . 6 ⊢ (𝑥 = 0 → (𝑥 · (𝑋 × 𝑌)) = (0 · (𝑋 × 𝑌)))
4	2, 3	eqeq12d 2192	. . . . 5 ⊢ (𝑥 = 0 → (((𝑥 · 𝑋) × 𝑌) = (𝑥 · (𝑋 × 𝑌)) ↔ ((0 · 𝑋) × 𝑌) = (0 · (𝑋 × 𝑌))))
5		oveq1 5884	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 · 𝑋) = (𝑦 · 𝑋))
6	5	oveq1d 5892	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝑥 · 𝑋) × 𝑌) = ((𝑦 · 𝑋) × 𝑌))
7		oveq1 5884	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 · (𝑋 × 𝑌)) = (𝑦 · (𝑋 × 𝑌)))
8	6, 7	eqeq12d 2192	. . . . 5 ⊢ (𝑥 = 𝑦 → (((𝑥 · 𝑋) × 𝑌) = (𝑥 · (𝑋 × 𝑌)) ↔ ((𝑦 · 𝑋) × 𝑌) = (𝑦 · (𝑋 × 𝑌))))
9		oveq1 5884	. . . . . . 7 ⊢ (𝑥 = (𝑦 + 1) → (𝑥 · 𝑋) = ((𝑦 + 1) · 𝑋))
10	9	oveq1d 5892	. . . . . 6 ⊢ (𝑥 = (𝑦 + 1) → ((𝑥 · 𝑋) × 𝑌) = (((𝑦 + 1) · 𝑋) × 𝑌))
11		oveq1 5884	. . . . . 6 ⊢ (𝑥 = (𝑦 + 1) → (𝑥 · (𝑋 × 𝑌)) = ((𝑦 + 1) · (𝑋 × 𝑌)))
12	10, 11	eqeq12d 2192	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → (((𝑥 · 𝑋) × 𝑌) = (𝑥 · (𝑋 × 𝑌)) ↔ (((𝑦 + 1) · 𝑋) × 𝑌) = ((𝑦 + 1) · (𝑋 × 𝑌))))
13		oveq1 5884	. . . . . . 7 ⊢ (𝑥 = -𝑦 → (𝑥 · 𝑋) = (-𝑦 · 𝑋))
14	13	oveq1d 5892	. . . . . 6 ⊢ (𝑥 = -𝑦 → ((𝑥 · 𝑋) × 𝑌) = ((-𝑦 · 𝑋) × 𝑌))
15		oveq1 5884	. . . . . 6 ⊢ (𝑥 = -𝑦 → (𝑥 · (𝑋 × 𝑌)) = (-𝑦 · (𝑋 × 𝑌)))
16	14, 15	eqeq12d 2192	. . . . 5 ⊢ (𝑥 = -𝑦 → (((𝑥 · 𝑋) × 𝑌) = (𝑥 · (𝑋 × 𝑌)) ↔ ((-𝑦 · 𝑋) × 𝑌) = (-𝑦 · (𝑋 × 𝑌))))
17		oveq1 5884	. . . . . . 7 ⊢ (𝑥 = 𝑁 → (𝑥 · 𝑋) = (𝑁 · 𝑋))
18	17	oveq1d 5892	. . . . . 6 ⊢ (𝑥 = 𝑁 → ((𝑥 · 𝑋) × 𝑌) = ((𝑁 · 𝑋) × 𝑌))
19		oveq1 5884	. . . . . 6 ⊢ (𝑥 = 𝑁 → (𝑥 · (𝑋 × 𝑌)) = (𝑁 · (𝑋 × 𝑌)))
20	18, 19	eqeq12d 2192	. . . . 5 ⊢ (𝑥 = 𝑁 → (((𝑥 · 𝑋) × 𝑌) = (𝑥 · (𝑋 × 𝑌)) ↔ ((𝑁 · 𝑋) × 𝑌) = (𝑁 · (𝑋 × 𝑌))))
21		mulgass2.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅)
22		mulgass2.t	. . . . . . . 8 ⊢ × = (._r‘𝑅)
23		eqid 2177	. . . . . . . 8 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
24	21, 22, 23	ringlz 13227	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵) → ((0_g‘𝑅) × 𝑌) = (0_g‘𝑅))
25	24	3adant3 1017	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((0_g‘𝑅) × 𝑌) = (0_g‘𝑅))
26		simp3 999	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵)
27		mulgass2.m	. . . . . . . . 9 ⊢ · = (._g‘𝑅)
28	21, 23, 27	mulg0 12993	. . . . . . . 8 ⊢ (𝑋 ∈ 𝐵 → (0 · 𝑋) = (0_g‘𝑅))
29	26, 28	syl 14	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (0 · 𝑋) = (0_g‘𝑅))
30	29	oveq1d 5892	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((0 · 𝑋) × 𝑌) = ((0_g‘𝑅) × 𝑌))
31	21, 22	ringcl 13201	. . . . . . . 8 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 × 𝑌) ∈ 𝐵)
32	31	3com23 1209	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑋 × 𝑌) ∈ 𝐵)
33	21, 23, 27	mulg0 12993	. . . . . . 7 ⊢ ((𝑋 × 𝑌) ∈ 𝐵 → (0 · (𝑋 × 𝑌)) = (0_g‘𝑅))
34	32, 33	syl 14	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (0 · (𝑋 × 𝑌)) = (0_g‘𝑅))
35	25, 30, 34	3eqtr4d 2220	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((0 · 𝑋) × 𝑌) = (0 · (𝑋 × 𝑌)))
36		oveq1 5884	. . . . . . 7 ⊢ (((𝑦 · 𝑋) × 𝑌) = (𝑦 · (𝑋 × 𝑌)) → (((𝑦 · 𝑋) × 𝑌)(+_g‘𝑅)(𝑋 × 𝑌)) = ((𝑦 · (𝑋 × 𝑌))(+_g‘𝑅)(𝑋 × 𝑌)))
37		simpl1 1000	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → 𝑅 ∈ Ring)
38		ringgrp 13189	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp)
39	37, 38	syl 14	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → 𝑅 ∈ Grp)
40		nn0z 9275	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℕ₀ → 𝑦 ∈ ℤ)
41	40	adantl 277	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → 𝑦 ∈ ℤ)
42	26	adantr 276	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → 𝑋 ∈ 𝐵)
43		eqid 2177	. . . . . . . . . . . 12 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
44	21, 27, 43	mulgp1 13021	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Grp ∧ 𝑦 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → ((𝑦 + 1) · 𝑋) = ((𝑦 · 𝑋)(+_g‘𝑅)𝑋))
45	39, 41, 42, 44	syl3anc 1238	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → ((𝑦 + 1) · 𝑋) = ((𝑦 · 𝑋)(+_g‘𝑅)𝑋))
46	45	oveq1d 5892	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → (((𝑦 + 1) · 𝑋) × 𝑌) = (((𝑦 · 𝑋)(+_g‘𝑅)𝑋) × 𝑌))
47	38	3ad2ant1 1018	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → 𝑅 ∈ Grp)
48	47	adantr 276	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → 𝑅 ∈ Grp)
49	21, 27	mulgcl 13005	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Grp ∧ 𝑦 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (𝑦 · 𝑋) ∈ 𝐵)
50	48, 41, 42, 49	syl3anc 1238	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → (𝑦 · 𝑋) ∈ 𝐵)
51		simpl2 1001	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → 𝑌 ∈ 𝐵)
52	21, 43, 22	ringdir 13207	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ ((𝑦 · 𝑋) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (((𝑦 · 𝑋)(+_g‘𝑅)𝑋) × 𝑌) = (((𝑦 · 𝑋) × 𝑌)(+_g‘𝑅)(𝑋 × 𝑌)))
53	37, 50, 42, 51, 52	syl13anc 1240	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → (((𝑦 · 𝑋)(+_g‘𝑅)𝑋) × 𝑌) = (((𝑦 · 𝑋) × 𝑌)(+_g‘𝑅)(𝑋 × 𝑌)))
54	46, 53	eqtrd 2210	. . . . . . . 8 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → (((𝑦 + 1) · 𝑋) × 𝑌) = (((𝑦 · 𝑋) × 𝑌)(+_g‘𝑅)(𝑋 × 𝑌)))
55	32	adantr 276	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → (𝑋 × 𝑌) ∈ 𝐵)
56	21, 27, 43	mulgp1 13021	. . . . . . . . 9 ⊢ ((𝑅 ∈ Grp ∧ 𝑦 ∈ ℤ ∧ (𝑋 × 𝑌) ∈ 𝐵) → ((𝑦 + 1) · (𝑋 × 𝑌)) = ((𝑦 · (𝑋 × 𝑌))(+_g‘𝑅)(𝑋 × 𝑌)))
57	39, 41, 55, 56	syl3anc 1238	. . . . . . . 8 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → ((𝑦 + 1) · (𝑋 × 𝑌)) = ((𝑦 · (𝑋 × 𝑌))(+_g‘𝑅)(𝑋 × 𝑌)))
58	54, 57	eqeq12d 2192	. . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → ((((𝑦 + 1) · 𝑋) × 𝑌) = ((𝑦 + 1) · (𝑋 × 𝑌)) ↔ (((𝑦 · 𝑋) × 𝑌)(+_g‘𝑅)(𝑋 × 𝑌)) = ((𝑦 · (𝑋 × 𝑌))(+_g‘𝑅)(𝑋 × 𝑌))))
59	36, 58	imbitrrid 156	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ₀) → (((𝑦 · 𝑋) × 𝑌) = (𝑦 · (𝑋 × 𝑌)) → (((𝑦 + 1) · 𝑋) × 𝑌) = ((𝑦 + 1) · (𝑋 × 𝑌))))
60	59	ex 115	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑦 ∈ ℕ₀ → (((𝑦 · 𝑋) × 𝑌) = (𝑦 · (𝑋 × 𝑌)) → (((𝑦 + 1) · 𝑋) × 𝑌) = ((𝑦 + 1) · (𝑋 × 𝑌)))))
61		fveq2 5517	. . . . . . 7 ⊢ (((𝑦 · 𝑋) × 𝑌) = (𝑦 · (𝑋 × 𝑌)) → ((inv_g‘𝑅)‘((𝑦 · 𝑋) × 𝑌)) = ((inv_g‘𝑅)‘(𝑦 · (𝑋 × 𝑌))))
62	47	adantr 276	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → 𝑅 ∈ Grp)
63		nnz 9274	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℤ)
64	63	adantl 277	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → 𝑦 ∈ ℤ)
65	26	adantr 276	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → 𝑋 ∈ 𝐵)
66		eqid 2177	. . . . . . . . . . . 12 ⊢ (inv_g‘𝑅) = (inv_g‘𝑅)
67	21, 27, 66	mulgneg 13006	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Grp ∧ 𝑦 ∈ ℤ ∧ 𝑋 ∈ 𝐵) → (-𝑦 · 𝑋) = ((inv_g‘𝑅)‘(𝑦 · 𝑋)))
68	62, 64, 65, 67	syl3anc 1238	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → (-𝑦 · 𝑋) = ((inv_g‘𝑅)‘(𝑦 · 𝑋)))
69	68	oveq1d 5892	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → ((-𝑦 · 𝑋) × 𝑌) = (((inv_g‘𝑅)‘(𝑦 · 𝑋)) × 𝑌))
70		simpl1 1000	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → 𝑅 ∈ Ring)
71	62, 64, 65, 49	syl3anc 1238	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → (𝑦 · 𝑋) ∈ 𝐵)
72		simpl2 1001	. . . . . . . . . 10 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → 𝑌 ∈ 𝐵)
73	21, 22, 66, 70, 71, 72	ringmneg1 13235	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → (((inv_g‘𝑅)‘(𝑦 · 𝑋)) × 𝑌) = ((inv_g‘𝑅)‘((𝑦 · 𝑋) × 𝑌)))
74	69, 73	eqtrd 2210	. . . . . . . 8 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → ((-𝑦 · 𝑋) × 𝑌) = ((inv_g‘𝑅)‘((𝑦 · 𝑋) × 𝑌)))
75	32	adantr 276	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → (𝑋 × 𝑌) ∈ 𝐵)
76	21, 27, 66	mulgneg 13006	. . . . . . . . 9 ⊢ ((𝑅 ∈ Grp ∧ 𝑦 ∈ ℤ ∧ (𝑋 × 𝑌) ∈ 𝐵) → (-𝑦 · (𝑋 × 𝑌)) = ((inv_g‘𝑅)‘(𝑦 · (𝑋 × 𝑌))))
77	62, 64, 75, 76	syl3anc 1238	. . . . . . . 8 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → (-𝑦 · (𝑋 × 𝑌)) = ((inv_g‘𝑅)‘(𝑦 · (𝑋 × 𝑌))))
78	74, 77	eqeq12d 2192	. . . . . . 7 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → (((-𝑦 · 𝑋) × 𝑌) = (-𝑦 · (𝑋 × 𝑌)) ↔ ((inv_g‘𝑅)‘((𝑦 · 𝑋) × 𝑌)) = ((inv_g‘𝑅)‘(𝑦 · (𝑋 × 𝑌)))))
79	61, 78	imbitrrid 156	. . . . . 6 ⊢ (((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ ℕ) → (((𝑦 · 𝑋) × 𝑌) = (𝑦 · (𝑋 × 𝑌)) → ((-𝑦 · 𝑋) × 𝑌) = (-𝑦 · (𝑋 × 𝑌))))
80	79	ex 115	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑦 ∈ ℕ → (((𝑦 · 𝑋) × 𝑌) = (𝑦 · (𝑋 × 𝑌)) → ((-𝑦 · 𝑋) × 𝑌) = (-𝑦 · (𝑋 × 𝑌)))))
81	4, 8, 12, 16, 20, 35, 60, 80	zindd 9373	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑁 ∈ ℤ → ((𝑁 · 𝑋) × 𝑌) = (𝑁 · (𝑋 × 𝑌))))
82	81	3exp 1202	. . 3 ⊢ (𝑅 ∈ Ring → (𝑌 ∈ 𝐵 → (𝑋 ∈ 𝐵 → (𝑁 ∈ ℤ → ((𝑁 · 𝑋) × 𝑌) = (𝑁 · (𝑋 × 𝑌))))))
83	82	com24 87	. 2 ⊢ (𝑅 ∈ Ring → (𝑁 ∈ ℤ → (𝑋 ∈ 𝐵 → (𝑌 ∈ 𝐵 → ((𝑁 · 𝑋) × 𝑌) = (𝑁 · (𝑋 × 𝑌))))))
84	83	3imp2 1222	1 ⊢ ((𝑅 ∈ Ring ∧ (𝑁 ∈ ℤ ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑁 · 𝑋) × 𝑌) = (𝑁 · (𝑋 × 𝑌)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 ‘cfv 5218 (class class class)co 5877 0cc0 7813 1c1 7814 + caddc 7816 -cneg 8131 ℕcn 8921 ℕ₀cn0 9178 ℤcz 9255 Basecbs 12464 +_gcplusg 12538 ._rcmulr 12539 0_gc0g 12710 Grpcgrp 12882 inv_gcminusg 12883 ._gcmg 12988 Ringcrg 13184

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4120 ax-sep 4123 ax-nul 4131 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-iinf 4589 ax-cnex 7904 ax-resscn 7905 ax-1cn 7906 ax-1re 7907 ax-icn 7908 ax-addcl 7909 ax-addrcl 7910 ax-mulcl 7911 ax-addcom 7913 ax-addass 7915 ax-distr 7917 ax-i2m1 7918 ax-0lt1 7919 ax-0id 7921 ax-rnegex 7922 ax-cnre 7924 ax-pre-ltirr 7925 ax-pre-ltwlin 7926 ax-pre-lttrn 7927 ax-pre-ltadd 7929

This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-if 3537 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-tr 4104 df-id 4295 df-iord 4368 df-on 4370 df-ilim 4371 df-suc 4373 df-iom 4592 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-f1 5223 df-fo 5224 df-f1o 5225 df-fv 5226 df-riota 5833 df-ov 5880 df-oprab 5881 df-mpo 5882 df-1st 6143 df-2nd 6144 df-recs 6308 df-frec 6394 df-pnf 7996 df-mnf 7997 df-xr 7998 df-ltxr 7999 df-le 8000 df-sub 8132 df-neg 8133 df-inn 8922 df-2 8980 df-3 8981 df-n0 9179 df-z 9256 df-uz 9531 df-fz 10011 df-seqfrec 10448 df-ndx 12467 df-slot 12468 df-base 12470 df-sets 12471 df-plusg 12551 df-mulr 12552 df-0g 12712 df-mgm 12780 df-sgrp 12813 df-mnd 12823 df-grp 12885 df-minusg 12886 df-mulg 12989 df-mgp 13136 df-ur 13148 df-ring 13186

This theorem is referenced by: mulgass3 13259

W3C validator