Theorem fvopab3g 5266

Description: Value of a function given by ordered-pair class abstraction. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 28-Apr-2015.)

Hypotheses

Ref	Expression
fvopab3g.2	|- ( x = A -> ( ph <-> ps ) )
fvopab3g.3	|- ( y = B -> ( ps <-> ch ) )
fvopab3g.4	|- ( x e. C -> E! y ph )
fvopab3g.5	|- F = { <. x , y >. | ( x e. C /\ ph ) }

Assertion

Ref	Expression
fvopab3g	|- ( ( A e. C /\ B e. D ) -> ( ( F ` A ) = B <-> ch ) )

Distinct variable groups:   x, y, A   x, B, y   x, C, y   ch, x, y

Allowed substitution hints:   ph( x, y)   ps( x, y)   D( x, y)   F( x, y)

Proof of Theorem fvopab3g

Step	Hyp	Ref	Expression
1		eleq1 2141	. . . 4 |- ( x = A -> ( x e. C <-> A e. C ) )
2		fvopab3g.2	. . . 4 |- ( x = A -> ( ph <-> ps ) )
3	1, 2	anbi12d 456	. . 3 |- ( x = A -> ( ( x e. C /\ ph ) <-> ( A e. C /\ ps ) ) )
4		fvopab3g.3	. . . 4 |- ( y = B -> ( ps <-> ch ) )
5	4	anbi2d 451	. . 3 |- ( y = B -> ( ( A e. C /\ ps ) <-> ( A e. C /\ ch ) ) )
6	3, 5	opelopabg 4023	. 2 |- ( ( A e. C /\ B e. D ) -> ( <. A , B >. e. { <. x , y >. | ( x e. C /\ ph ) } <-> ( A e. C /\ ch ) ) )
7		fvopab3g.4	. . . . . 6 |- ( x e. C -> E! y ph )
8		fvopab3g.5	. . . . . 6 |- F = { <. x , y >. | ( x e. C /\ ph ) }
9	7, 8	fnopab 5043	. . . . 5 |- F Fn C
10		fnopfvb 5236	. . . . 5 |- ( ( F Fn C /\ A e. C ) -> ( ( F ` A ) = B <-> <. A , B >. e. F ) )
11	9, 10	mpan 414	. . . 4 |- ( A e. C -> ( ( F ` A ) = B <-> <. A , B >. e. F ) )
12	8	eleq2i 2145	. . . 4 |- ( <. A , B >. e. F <-> <. A , B >. e. { <. x , y >. | ( x e. C /\ ph ) } )
13	11, 12	syl6bb 194	. . 3 |- ( A e. C -> ( ( F ` A ) = B <-> <. A , B >. e. { <. x , y >. | ( x e. C /\ ph ) } ) )
14	13	adantr 270	. 2 |- ( ( A e. C /\ B e. D ) -> ( ( F ` A ) = B <-> <. A , B >. e. { <. x , y >. | ( x e. C /\ ph ) } ) )
15		ibar 295	. . 3 |- ( A e. C -> ( ch <-> ( A e. C /\ ch ) ) )
16	15	adantr 270	. 2 |- ( ( A e. C /\ B e. D ) -> ( ch <-> ( A e. C /\ ch ) ) )
17	6, 14, 16	3bitr4d 218	1 |- ( ( A e. C /\ B e. D ) -> ( ( F ` A ) = B <-> ch ) )

Syntax hints:   -> wi 4   /\ wa 102   <-> wb 103   = wceq 1284   e. wcel 1433   E!weu 1941   <.cop 3401   {copab 3838   Fn wfn 4917   ` cfv 4922

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964

This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-sbc 2816  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-iota 4887  df-fun 4924  df-fn 4925  df-fv 4930

This theorem is referenced by:  recmulnqg  6581