Theorem caovdi 7631

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

Syntax hints:   ∧ wa 395   ∧ w3a 1086   = wceq 1540  ⊤wtru 1541   ∈ wcel 2109  Vcvv 3464  (class class class)co 7410

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2715  df-cleq 2728  df-clel 2810  df-ral 3053  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-iota 6489  df-fv 6544  df-ov 7413

This theorem is referenced by:  caovdir  7646  caovlem2  7648