Theorem caovdi 6128

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 1377	. . 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 6123	. . 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 424	. 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 1350	1 |- ( A G ( B F C ) ) = ( ( A G B ) F ( A G C ) )

Syntax hints:   /\ wa 104   /\ w3a 981   = wceq 1373   T. wtru 1374   e. wcel 2176   _Vcvv 2772  (class class class)co 5946

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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-un 3170  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4046  df-iota 5233  df-fv 5280  df-ov 5949

This theorem is referenced by: (None)