Theorem caovdirg 7668

Description: Convert an operation reverse distributive law to class notation. (Contributed by Mario Carneiro, 19-Oct-2014.)

Hypothesis

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

Assertion

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

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

Proof of Theorem caovdirg

Step	Hyp	Ref	Expression
1		caovdirg.1	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝐾)) → ((𝑥𝐹𝑦)𝐺𝑧) = ((𝑥𝐺𝑧)𝐻(𝑦𝐺𝑧)))
2	1	ralrimivvva 3212	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝐾 ((𝑥𝐹𝑦)𝐺𝑧) = ((𝑥𝐺𝑧)𝐻(𝑦𝐺𝑧)))
3		oveq1 7456	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦))
4	3	oveq1d 7464	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥𝐹𝑦)𝐺𝑧) = ((𝐴𝐹𝑦)𝐺𝑧))
5		oveq1 7456	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥𝐺𝑧) = (𝐴𝐺𝑧))
6	5	oveq1d 7464	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥𝐺𝑧)𝐻(𝑦𝐺𝑧)) = ((𝐴𝐺𝑧)𝐻(𝑦𝐺𝑧)))
7	4, 6	eqeq12d 2779	. . 3 ⊢ (𝑥 = 𝐴 → (((𝑥𝐹𝑦)𝐺𝑧) = ((𝑥𝐺𝑧)𝐻(𝑦𝐺𝑧)) ↔ ((𝐴𝐹𝑦)𝐺𝑧) = ((𝐴𝐺𝑧)𝐻(𝑦𝐺𝑧))))
8		oveq2 7457	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵))
9	8	oveq1d 7464	. . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴𝐹𝑦)𝐺𝑧) = ((𝐴𝐹𝐵)𝐺𝑧))
10		oveq1 7456	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦𝐺𝑧) = (𝐵𝐺𝑧))
11	10	oveq2d 7465	. . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴𝐺𝑧)𝐻(𝑦𝐺𝑧)) = ((𝐴𝐺𝑧)𝐻(𝐵𝐺𝑧)))
12	9, 11	eqeq12d 2779	. . 3 ⊢ (𝑦 = 𝐵 → (((𝐴𝐹𝑦)𝐺𝑧) = ((𝐴𝐺𝑧)𝐻(𝑦𝐺𝑧)) ↔ ((𝐴𝐹𝐵)𝐺𝑧) = ((𝐴𝐺𝑧)𝐻(𝐵𝐺𝑧))))
13		oveq2 7457	. . . 4 ⊢ (𝑧 = 𝐶 → ((𝐴𝐹𝐵)𝐺𝑧) = ((𝐴𝐹𝐵)𝐺𝐶))
14		oveq2 7457	. . . . 5 ⊢ (𝑧 = 𝐶 → (𝐴𝐺𝑧) = (𝐴𝐺𝐶))
15		oveq2 7457	. . . . 5 ⊢ (𝑧 = 𝐶 → (𝐵𝐺𝑧) = (𝐵𝐺𝐶))
16	14, 15	oveq12d 7467	. . . 4 ⊢ (𝑧 = 𝐶 → ((𝐴𝐺𝑧)𝐻(𝐵𝐺𝑧)) = ((𝐴𝐺𝐶)𝐻(𝐵𝐺𝐶)))
17	13, 16	eqeq12d 2779	. . 3 ⊢ (𝑧 = 𝐶 → (((𝐴𝐹𝐵)𝐺𝑧) = ((𝐴𝐺𝑧)𝐻(𝐵𝐺𝑧)) ↔ ((𝐴𝐹𝐵)𝐺𝐶) = ((𝐴𝐺𝐶)𝐻(𝐵𝐺𝐶))))
18	7, 12, 17	rspc3v 3595	. 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝐾) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝐾 ((𝑥𝐹𝑦)𝐺𝑧) = ((𝑥𝐺𝑧)𝐻(𝑦𝐺𝑧)) → ((𝐴𝐹𝐵)𝐺𝐶) = ((𝐴𝐺𝐶)𝐻(𝐵𝐺𝐶))))
19	2, 18	mpan9 516	1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝐾)) → ((𝐴𝐹𝐵)𝐺𝐶) = ((𝐴𝐺𝐶)𝐻(𝐵𝐺𝐶)))

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

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6518  df-fv 6572  df-ov 7452

This theorem is used by:  caovdird  7669  srgdilem  20460  ringdilem  20518