Theorem ofrval 6255

Description: Exhibit a function relation at a point. (Contributed by Mario Carneiro, 28-Jul-2014.)

Hypotheses

Ref	Expression
offval.1	|- ( ph -> F Fn A )
offval.2	|- ( ph -> G Fn B )
offval.3	|- ( ph -> A e. V )
offval.4	|- ( ph -> B e. W )
offval.5	|- ( A i^i B ) = S
ofrval.6	|- ( ( ph /\ X e. A ) -> ( F ` X ) = C )
ofrval.7	|- ( ( ph /\ X e. B ) -> ( G ` X ) = D )

Assertion

Ref	Expression
ofrval	|- ( ( ph /\ F oR R G /\ X e. S ) -> C R D )

Proof of Theorem ofrval

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		offval.1	. . . . . 6 |- ( ph -> F Fn A )
2		offval.2	. . . . . 6 |- ( ph -> G Fn B )
3		offval.3	. . . . . 6 |- ( ph -> A e. V )
4		offval.4	. . . . . 6 |- ( ph -> B e. W )
5		offval.5	. . . . . 6 |- ( A i^i B ) = S
6		eqidd 2232	. . . . . 6 |- ( ( ph /\ x e. A ) -> ( F ` x ) = ( F ` x ) )
7		eqidd 2232	. . . . . 6 |- ( ( ph /\ x e. B ) -> ( G ` x ) = ( G ` x ) )
8	1, 2, 3, 4, 5, 6, 7	ofrfval 6253	. . . . 5 |- ( ph -> ( F oR R G <-> A. x e. S ( F ` x ) R ( G ` x ) ) )
9	8	biimpa 296	. . . 4 |- ( ( ph /\ F oR R G ) -> A. x e. S ( F ` x ) R ( G ` x ) )
10		fveq2 5648	. . . . . 6 |- ( x = X -> ( F ` x ) = ( F ` X ) )
11		fveq2 5648	. . . . . 6 |- ( x = X -> ( G ` x ) = ( G ` X ) )
12	10, 11	breq12d 4106	. . . . 5 |- ( x = X -> ( ( F ` x ) R ( G ` x ) <-> ( F ` X ) R ( G ` X ) ) )
13	12	rspccv 2908	. . . 4 |- ( A. x e. S ( F ` x ) R ( G ` x ) -> ( X e. S -> ( F ` X ) R ( G ` X ) ) )
14	9, 13	syl 14	. . 3 |- ( ( ph /\ F oR R G ) -> ( X e. S -> ( F ` X ) R ( G ` X ) ) )
15	14	3impia 1227	. 2 |- ( ( ph /\ F oR R G /\ X e. S ) -> ( F ` X ) R ( G ` X ) )
16		simp1 1024	. . 3 |- ( ( ph /\ F oR R G /\ X e. S ) -> ph )
17		inss1 3429	. . . . 5 |- ( A i^i B ) C_ A
18	5, 17	eqsstrri 3261	. . . 4 |- S C_ A
19		simp3 1026	. . . 4 |- ( ( ph /\ F oR R G /\ X e. S ) -> X e. S )
20	18, 19	sselid 3226	. . 3 |- ( ( ph /\ F oR R G /\ X e. S ) -> X e. A )
21		ofrval.6	. . 3 |- ( ( ph /\ X e. A ) -> ( F ` X ) = C )
22	16, 20, 21	syl2anc 411	. 2 |- ( ( ph /\ F oR R G /\ X e. S ) -> ( F ` X ) = C )
23		inss2 3430	. . . . 5 |- ( A i^i B ) C_ B
24	5, 23	eqsstrri 3261	. . . 4 |- S C_ B
25	24, 19	sselid 3226	. . 3 |- ( ( ph /\ F oR R G /\ X e. S ) -> X e. B )
26		ofrval.7	. . 3 |- ( ( ph /\ X e. B ) -> ( G ` X ) = D )
27	16, 25, 26	syl2anc 411	. 2 |- ( ( ph /\ F oR R G /\ X e. S ) -> ( G ` X ) = D )
28	15, 22, 27	3brtr3d 4124	1 |- ( ( ph /\ F oR R G /\ X e. S ) -> C R D )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   e. wcel 2202   A.wral 2511   i^i cin 3200   class class class wbr 4093   Fn wfn 5328   ` cfv 5333   oRcofr 6243

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ofr 6245

This theorem is referenced by:  psrbaglesuppg  14768