Theorem caofcom 6333

Description: Transfer a commutative law to the function operation. (Contributed by Mario Carneiro, 26-Jul-2014.)

Hypotheses

Ref	Expression
caofref.1	|- ( ph -> A e. V )
caofref.2	|- ( ph -> F : A --> S )
caofcom.3	|- ( ph -> G : A --> S )
caofcom.4	|- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x R y ) = ( y R x ) )

Assertion

Ref	Expression
caofcom	|- ( ph -> ( F oF R G ) = ( G oF R F ) )

Distinct variable groups:   x, y, F   x, G, y   ph, x, y   x, R, y   x, S, y

Allowed substitution hints:   A( x, y)   V( x, y)

Proof of Theorem caofcom

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		caofref.2	. . . . . 6 |- ( ph -> F : A --> S )
2	1	ffvelcdmda 5843	. . . . 5 |- ( ( ph /\ w e. A ) -> ( F ` w ) e. S )
3		caofcom.3	. . . . . 6 |- ( ph -> G : A --> S )
4	3	ffvelcdmda 5843	. . . . 5 |- ( ( ph /\ w e. A ) -> ( G ` w ) e. S )
5	2, 4	jca 306	. . . 4 |- ( ( ph /\ w e. A ) -> ( ( F ` w ) e. S /\ ( G ` w ) e. S ) )
6		caofcom.4	. . . . 5 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x R y ) = ( y R x ) )
7	6	caovcomg 6245	. . . 4 |- ( ( ph /\ ( ( F ` w ) e. S /\ ( G ` w ) e. S ) ) -> ( ( F ` w ) R ( G ` w ) ) = ( ( G ` w ) R ( F ` w ) ) )
8	5, 7	syldan 282	. . 3 |- ( ( ph /\ w e. A ) -> ( ( F ` w ) R ( G ` w ) ) = ( ( G ` w ) R ( F ` w ) ) )
9	8	mpteq2dva 4221	. 2 |- ( ph -> ( w e. A |-> ( ( F ` w ) R ( G ` w ) ) ) = ( w e. A |-> ( ( G ` w ) R ( F ` w ) ) ) )
10		caofref.1	. . 3 |- ( ph -> A e. V )
11	1	feqmptd 5756	. . 3 |- ( ph -> F = ( w e. A |-> ( F ` w ) ) )
12	3	feqmptd 5756	. . 3 |- ( ph -> G = ( w e. A |-> ( G ` w ) ) )
13	10, 2, 4, 11, 12	offval2 6318	. 2 |- ( ph -> ( F oF R G ) = ( w e. A |-> ( ( F ` w ) R ( G ` w ) ) ) )
14	10, 4, 2, 12, 11	offval2 6318	. 2 |- ( ph -> ( G oF R F ) = ( w e. A |-> ( ( G ` w ) R ( F ` w ) ) ) )
15	9, 13, 14	3eqtr4d 2281	1 |- ( ph -> ( F oF R G ) = ( G oF R F ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   |-> cmpt 4192   -->wf 5373   ` cfv 5377  (class class class)co 6085   oFcof 6300

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-of 6302

This theorem is used by: (None)