Theorem caovdid 6099

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

Hypotheses

Ref	Expression
caovdig.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)))
caovdid.2	⊢ (𝜑 → 𝐴 ∈ 𝐾)
caovdid.3	⊢ (𝜑 → 𝐵 ∈ 𝑆)
caovdid.4	⊢ (𝜑 → 𝐶 ∈ 𝑆)

Assertion

Ref	Expression
caovdid	⊢ (𝜑 → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶)))

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

Proof of Theorem caovdid

Step	Hyp	Ref	Expression
1		id 19	. 2 ⊢ (𝜑 → 𝜑)
2		caovdid.2	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝐾)
3		caovdid.3	. 2 ⊢ (𝜑 → 𝐵 ∈ 𝑆)
4		caovdid.4	. 2 ⊢ (𝜑 → 𝐶 ∈ 𝑆)
5		caovdig.1	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧)))
6	5	caovdig 6098	. 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶)))
7	1, 2, 3, 4, 6	syl13anc 1251	1 ⊢ (𝜑 → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶)))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 980   = wceq 1364   ∈ wcel 2167  (class class class)co 5922

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-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-iota 5219  df-fv 5266  df-ov 5925

This theorem is referenced by:  caovdir2d  6100  caovlem2d  6116  caofdig  6164  ltanqg  7467