Theorem caofrss 6334

Description: Transfer a relation subset law to the function relation. (Contributed by Mario Carneiro, 28-Jul-2014.)

Hypotheses

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

Assertion

Ref	Expression
caofrss	|- ( ph -> ( F oR R G -> F oR T G ) )

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

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

Proof of Theorem caofrss

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		caofref.2	. . . . 5 |- ( ph -> F : A --> S )
2	1	ffvelcdmda 5843	. . . 4 |- ( ( ph /\ w e. A ) -> ( F ` w ) e. S )
3		caofcom.3	. . . . 5 |- ( ph -> G : A --> S )
4	3	ffvelcdmda 5843	. . . 4 |- ( ( ph /\ w e. A ) -> ( G ` w ) e. S )
5		caofrss.4	. . . . . 6 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x R y -> x T y ) )
6	5	ralrimivva 2632	. . . . 5 |- ( ph -> A. x e. S A. y e. S ( x R y -> x T y ) )
7	6	adantr 276	. . . 4 |- ( ( ph /\ w e. A ) -> A. x e. S A. y e. S ( x R y -> x T y ) )
8		breq1 4133	. . . . . 6 |- ( x = ( F ` w ) -> ( x R y <-> ( F ` w ) R y ) )
9		breq1 4133	. . . . . 6 |- ( x = ( F ` w ) -> ( x T y <-> ( F ` w ) T y ) )
10	8, 9	imbi12d 234	. . . . 5 |- ( x = ( F ` w ) -> ( ( x R y -> x T y ) <-> ( ( F ` w ) R y -> ( F ` w ) T y ) ) )
11		breq2 4134	. . . . . 6 |- ( y = ( G ` w ) -> ( ( F ` w ) R y <-> ( F ` w ) R ( G ` w ) ) )
12		breq2 4134	. . . . . 6 |- ( y = ( G ` w ) -> ( ( F ` w ) T y <-> ( F ` w ) T ( G ` w ) ) )
13	11, 12	imbi12d 234	. . . . 5 |- ( y = ( G ` w ) -> ( ( ( F ` w ) R y -> ( F ` w ) T y ) <-> ( ( F ` w ) R ( G ` w ) -> ( F ` w ) T ( G ` w ) ) ) )
14	10, 13	rspc2va 2944	. . . 4 |- ( ( ( ( F ` w ) e. S /\ ( G ` w ) e. S ) /\ A. x e. S A. y e. S ( x R y -> x T y ) ) -> ( ( F ` w ) R ( G ` w ) -> ( F ` w ) T ( G ` w ) ) )
15	2, 4, 7, 14	syl21anc 1277	. . 3 |- ( ( ph /\ w e. A ) -> ( ( F ` w ) R ( G ` w ) -> ( F ` w ) T ( G ` w ) ) )
16	15	ralimdva 2617	. 2 |- ( ph -> ( A. w e. A ( F ` w ) R ( G ` w ) -> A. w e. A ( F ` w ) T ( G ` w ) ) )
17		ffn 5533	. . . 4 |- ( F : A --> S -> F Fn A )
18	1, 17	syl 14	. . 3 |- ( ph -> F Fn A )
19		ffn 5533	. . . 4 |- ( G : A --> S -> G Fn A )
20	3, 19	syl 14	. . 3 |- ( ph -> G Fn A )
21		caofref.1	. . 3 |- ( ph -> A e. V )
22		inidm 3440	. . 3 |- ( A i^i A ) = A
23		eqidd 2239	. . 3 |- ( ( ph /\ w e. A ) -> ( F ` w ) = ( F ` w ) )
24		eqidd 2239	. . 3 |- ( ( ph /\ w e. A ) -> ( G ` w ) = ( G ` w ) )
25	18, 20, 21, 21, 22, 23, 24	ofrfval 6311	. 2 |- ( ph -> ( F oR R G <-> A. w e. A ( F ` w ) R ( G ` w ) ) )
26	18, 20, 21, 21, 22, 23, 24	ofrfval 6311	. 2 |- ( ph -> ( F oR T G <-> A. w e. A ( F ` w ) T ( G ` w ) ) )
27	16, 25, 26	3imtr4d 203	1 |- ( ph -> ( F oR R G -> F oR T G ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   A.wral 2528   class class class wbr 4130   Fn wfn 5372   -->wf 5373   ` cfv 5377   oRcofr 6301

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-ofr 6303

This theorem is used by: (None)