Theorem caovdi 7615

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 1564	. . 3 ⊢ ⊤
5		caovdi.4	. . . . 5 ⊢ (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐹(𝑥𝐺𝑧))
6	5	a1i 11	. . . 4 ⊢ ((⊤ ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V)) → (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐹(𝑥𝐺𝑧)))
7	6	caovdig 7610	. . 3 ⊢ ((⊤ ∧ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V)) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐹(𝐴𝐺𝐶)))
8	4, 7	mpan 700	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ V) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐹(𝐴𝐺𝐶)))
9	1, 2, 3, 8	mp3an 1482	1 ⊢ (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐹(𝐴𝐺𝐶))

Syntax hints:   ∧ wa 399   ∧ w3a 1098   = wceq 1560  ⊤wtru 1561   ∈ wcel 2142  Vcvv 3454  (class class class)co 7396

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3077  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-iota 6477  df-fv 6529  df-ov 7399

This theorem is referenced by:  caovdir  7630  caovlem2  7632