Theorem caovdi 5950

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	|- A e. _V
caovdi.2	|- B e. _V
caovdi.3	|- C e. _V
caovdi.4	|- ( x G ( y F z ) ) = ( ( x G y ) F ( x G z ) )

Assertion

Ref	Expression
caovdi	|- ( A G ( B F C ) ) = ( ( A G B ) F ( A G C ) )

Distinct variable groups:   x, y, z, A   x, B, y, z   x, C, y, z   x, F, y, z   x, G, y, z

Proof of Theorem caovdi

Step	Hyp	Ref	Expression
1		caovdi.1	. 2 |- A e. _V
2		caovdi.2	. 2 |- B e. _V
3		caovdi.3	. 2 |- C e. _V
4		tru 1335	. . 3 |- T.
5		caovdi.4	. . . . 5 |- ( x G ( y F z ) ) = ( ( x G y ) F ( x G z ) )
6	5	a1i 9	. . . 4 |- ( ( T. /\ ( x e. _V /\ y e. _V /\ z e. _V ) ) -> ( x G ( y F z ) ) = ( ( x G y ) F ( x G z ) ) )
7	6	caovdig 5945	. . 3 |- ( ( T. /\ ( A e. _V /\ B e. _V /\ C e. _V ) ) -> ( A G ( B F C ) ) = ( ( A G B ) F ( A G C ) ) )
8	4, 7	mpan 420	. 2 |- ( ( A e. _V /\ B e. _V /\ C e. _V ) -> ( A G ( B F C ) ) = ( ( A G B ) F ( A G C ) ) )
9	1, 2, 3, 8	mp3an 1315	1 |- ( A G ( B F C ) ) = ( ( A G B ) F ( A G C ) )

Syntax hints:   /\ wa 103   /\ w3a 962   = wceq 1331   T. wtru 1332   e. wcel 1480   _Vcvv 2686  (class class class)co 5774

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 2121

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-un 3075  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-iota 5088  df-fv 5131  df-ov 5777

This theorem is referenced by: (None)