Theorem caovdirg 6101

Description: Convert an operation reverse distributive law to class notation. (Contributed by Mario Carneiro, 19-Oct-2014.)

Hypothesis

Ref	Expression
caovdirg.1	|- ( ( ph /\ ( x e. S /\ y e. S /\ z e. K ) ) -> ( ( x F y ) G z ) = ( ( x G z ) H ( y G z ) ) )

Assertion

Ref	Expression
caovdirg	|- ( ( ph /\ ( A e. S /\ B e. S /\ C e. K ) ) -> ( ( A F B ) G C ) = ( ( A G C ) H ( B G C ) ) )

Distinct variable groups:   x, y, z, A   x, B, y, z   x, C, y, z   ph, x, y, z   x, F, y, z   x, G, y, z   x, H, y, z   x, K, y, z   x, S, y, z

Proof of Theorem caovdirg

Step	Hyp	Ref	Expression
1		caovdirg.1	. . 3 |- ( ( ph /\ ( x e. S /\ y e. S /\ z e. K ) ) -> ( ( x F y ) G z ) = ( ( x G z ) H ( y G z ) ) )
2	1	ralrimivvva 2580	. 2 |- ( ph -> A. x e. S A. y e. S A. z e. K ( ( x F y ) G z ) = ( ( x G z ) H ( y G z ) ) )
3		oveq1 5929	. . . . 5 |- ( x = A -> ( x F y ) = ( A F y ) )
4	3	oveq1d 5937	. . . 4 |- ( x = A -> ( ( x F y ) G z ) = ( ( A F y ) G z ) )
5		oveq1 5929	. . . . 5 |- ( x = A -> ( x G z ) = ( A G z ) )
6	5	oveq1d 5937	. . . 4 |- ( x = A -> ( ( x G z ) H ( y G z ) ) = ( ( A G z ) H ( y G z ) ) )
7	4, 6	eqeq12d 2211	. . 3 |- ( x = A -> ( ( ( x F y ) G z ) = ( ( x G z ) H ( y G z ) ) <-> ( ( A F y ) G z ) = ( ( A G z ) H ( y G z ) ) ) )
8		oveq2 5930	. . . . 5 |- ( y = B -> ( A F y ) = ( A F B ) )
9	8	oveq1d 5937	. . . 4 |- ( y = B -> ( ( A F y ) G z ) = ( ( A F B ) G z ) )
10		oveq1 5929	. . . . 5 |- ( y = B -> ( y G z ) = ( B G z ) )
11	10	oveq2d 5938	. . . 4 |- ( y = B -> ( ( A G z ) H ( y G z ) ) = ( ( A G z ) H ( B G z ) ) )
12	9, 11	eqeq12d 2211	. . 3 |- ( y = B -> ( ( ( A F y ) G z ) = ( ( A G z ) H ( y G z ) ) <-> ( ( A F B ) G z ) = ( ( A G z ) H ( B G z ) ) ) )
13		oveq2 5930	. . . 4 |- ( z = C -> ( ( A F B ) G z ) = ( ( A F B ) G C ) )
14		oveq2 5930	. . . . 5 |- ( z = C -> ( A G z ) = ( A G C ) )
15		oveq2 5930	. . . . 5 |- ( z = C -> ( B G z ) = ( B G C ) )
16	14, 15	oveq12d 5940	. . . 4 |- ( z = C -> ( ( A G z ) H ( B G z ) ) = ( ( A G C ) H ( B G C ) ) )
17	13, 16	eqeq12d 2211	. . 3 |- ( z = C -> ( ( ( A F B ) G z ) = ( ( A G z ) H ( B G z ) ) <-> ( ( A F B ) G C ) = ( ( A G C ) H ( B G C ) ) ) )
18	7, 12, 17	rspc3v 2884	. 2 |- ( ( A e. S /\ B e. S /\ C e. K ) -> ( A. x e. S A. y e. S A. z e. K ( ( x F y ) G z ) = ( ( x G z ) H ( y G z ) ) -> ( ( A F B ) G C ) = ( ( A G C ) H ( B G C ) ) ) )
19	2, 18	mpan9 281	1 |- ( ( ph /\ ( A e. S /\ B e. S /\ C e. K ) ) -> ( ( A F B ) G C ) = ( ( A G C ) H ( B G C ) ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 980   = wceq 1364   e. wcel 2167   A.wral 2475  (class class class)co 5922

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-iota 5219  df-fv 5266  df-ov 5925

This theorem is referenced by:  caovdird  6102  caovlem2d  6116  srgdilem  13525  ringdilem  13568