Theorem caovdig 7636

Description: Convert an operation distributive law to class notation. (Contributed by NM, 25-Aug-1995.) (Revised by Mario Carneiro, 26-Jul-2014.)

Hypothesis

Ref	Expression
caovdig.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)))

Assertion

Ref	Expression
caovdig	⊢ ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝐺,𝑦,𝑧   𝑥,𝐻,𝑦,𝑧   𝑥,𝐾,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧

Proof of Theorem caovdig

Step	Hyp	Ref	Expression
1		caovdig.1	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)))
2	1	ralrimivvva 3208	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐾 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)))
3		oveq1 7428	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝐺(𝑦𝐹𝑧)) = (𝐴𝐺(𝑦𝐹𝑧)))
4		oveq1 7428	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥𝐺𝑦) = (𝐴𝐺𝑦))
5		oveq1 7428	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥𝐺𝑧) = (𝐴𝐺𝑧))
6	4, 5	oveq12d 7439	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)) = ((𝐴𝐺𝑦)𝐻(𝐴𝐺𝑧)))
7	3, 6	eqeq12d 2776	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)) ↔ (𝐴𝐺(𝑦𝐹𝑧)) = ((𝐴𝐺𝑦)𝐻(𝐴𝐺𝑧))))
8		oveq1 7428	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦𝐹𝑧) = (𝐵𝐹𝑧))
9	8	oveq2d 7437	. . . 4 ⊢ (𝑦 = 𝐵 → (𝐴𝐺(𝑦𝐹𝑧)) = (𝐴𝐺(𝐵𝐹𝑧)))
10		oveq2 7429	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴𝐺𝑦) = (𝐴𝐺𝐵))
11	10	oveq1d 7436	. . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴𝐺𝑦)𝐻(𝐴𝐺𝑧)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝑧)))
12	9, 11	eqeq12d 2776	. . 3 ⊢ (𝑦 = 𝐵 → ((𝐴𝐺(𝑦𝐹𝑧)) = ((𝐴𝐺𝑦)𝐻(𝐴𝐺𝑧)) ↔ (𝐴𝐺(𝐵𝐹𝑧)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝑧))))
13		oveq2 7429	. . . . 5 ⊢ (𝑧 = 𝐶 → (𝐵𝐹𝑧) = (𝐵𝐹𝐶))
14	13	oveq2d 7437	. . . 4 ⊢ (𝑧 = 𝐶 → (𝐴𝐺(𝐵𝐹𝑧)) = (𝐴𝐺(𝐵𝐹𝐶)))
15		oveq2 7429	. . . . 5 ⊢ (𝑧 = 𝐶 → (𝐴𝐺𝑧) = (𝐴𝐺𝐶))
16	15	oveq2d 7437	. . . 4 ⊢ (𝑧 = 𝐶 → ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝑧)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶)))
17	14, 16	eqeq12d 2776	. . 3 ⊢ (𝑧 = 𝐶 → ((𝐴𝐺(𝐵𝐹𝑧)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝑧)) ↔ (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶))))
18	7, 12, 17	rspc3v 3591	. 2 ⊢ ((𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (∀𝑥 ∈ 𝐾 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶))))
19	2, 18	mpan9 516	1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  (class class class)co 7421

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6547  df-ov 7424

This theorem is used by:  caovdid  7637  caovdi  7641  srgdilem  20424  ringdilem  20482