Theorem caovdi 5943

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

Hypotheses

Ref	Expression
caovdi.1	⊢ 𝐴 ∈ V
caovdi.2	⊢ 𝐵 ∈ V
caovdi.3	⊢ 𝐶 ∈ V
caovdi.4	⊢ (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐹(𝑥𝐺𝑧))

Assertion

Ref	Expression
caovdi	⊢ (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐹(𝐴𝐺𝐶))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧   𝑥,𝐺,𝑦,𝑧

Proof of Theorem caovdi

Step	Hyp	Ref	Expression
1		caovdi.1	. 2 ⊢ 𝐴 ∈ V
2		caovdi.2	. 2 ⊢ 𝐵 ∈ V
3		caovdi.3	. 2 ⊢ 𝐶 ∈ V
4		tru 1335	. . 3 ⊢ ⊤
5		caovdi.4	. . . . 5 ⊢ (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐹(𝑥𝐺𝑧))
6	5	a1i 9	. . . 4 ⊢ ((⊤ ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V)) → (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐹(𝑥𝐺𝑧)))
7	6	caovdig 5938	. . 3 ⊢ ((⊤ ∧ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V)) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐹(𝐴𝐺𝐶)))
8	4, 7	mpan 420	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐹(𝐴𝐺𝐶)))
9	1, 2, 3, 8	mp3an 1315	1 ⊢ (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐹(𝐴𝐺𝐶))

Syntax hints:   ∧ wa 103   ∧ w3a 962   = wceq 1331  ⊤wtru 1332   ∈ wcel 1480  Vcvv 2681  (class class class)co 5767

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-iota 5083  df-fv 5126  df-ov 5770

This theorem is referenced by: (None)