Theorem f1ocnvd 6235

Description: Describe an implicit one-to-one onto function. (Contributed by Mario Carneiro, 30-Apr-2015.)

Hypotheses

Ref	Expression
f1od.1	|- F = ( x e. A |-> C )
f1od.2	|- ( ( ph /\ x e. A ) -> C e. W )
f1od.3	|- ( ( ph /\ y e. B ) -> D e. X )
f1od.4	|- ( ph -> ( ( x e. A /\ y = C ) <-> ( y e. B /\ x = D ) ) )

Assertion

Ref	Expression
f1ocnvd	|- ( ph -> ( F : A -1-1-onto-> B /\ `' F = ( y e. B |-> D ) ) )

Distinct variable groups:   x, y, A   x, B, y   y, C   x, D   ph, x, y

Allowed substitution hints:   C( x)   D( y)   F( x, y)   W( x, y)   X( x, y)

Proof of Theorem f1ocnvd

Step	Hyp	Ref	Expression
1		f1od.2	. . . . 5 |- ( ( ph /\ x e. A ) -> C e. W )
2	1	ralrimiva 2606	. . . 4 |- ( ph -> A. x e. A C e. W )
3		f1od.1	. . . . 5 |- F = ( x e. A |-> C )
4	3	fnmpt 5466	. . . 4 |- ( A. x e. A C e. W -> F Fn A )
5	2, 4	syl 14	. . 3 |- ( ph -> F Fn A )
6		f1od.3	. . . . . 6 |- ( ( ph /\ y e. B ) -> D e. X )
7	6	ralrimiva 2606	. . . . 5 |- ( ph -> A. y e. B D e. X )
8		eqid 2231	. . . . . 6 |- ( y e. B |-> D ) = ( y e. B |-> D )
9	8	fnmpt 5466	. . . . 5 |- ( A. y e. B D e. X -> ( y e. B |-> D ) Fn B )
10	7, 9	syl 14	. . . 4 |- ( ph -> ( y e. B |-> D ) Fn B )
11		f1od.4	. . . . . . 7 |- ( ph -> ( ( x e. A /\ y = C ) <-> ( y e. B /\ x = D ) ) )
12	11	opabbidv 4160	. . . . . 6 |- ( ph -> { <. y , x >. | ( x e. A /\ y = C ) } = { <. y , x >. | ( y e. B /\ x = D ) } )
13		df-mpt 4157	. . . . . . . . 9 |- ( x e. A |-> C ) = { <. x , y >. | ( x e. A /\ y = C ) }
14	3, 13	eqtri 2252	. . . . . . . 8 |- F = { <. x , y >. | ( x e. A /\ y = C ) }
15	14	cnveqi 4911	. . . . . . 7 |- `' F = `' { <. x , y >. | ( x e. A /\ y = C ) }
16		cnvopab 5145	. . . . . . 7 |- `' { <. x , y >. | ( x e. A /\ y = C ) } = { <. y , x >. | ( x e. A /\ y = C ) }
17	15, 16	eqtri 2252	. . . . . 6 |- `' F = { <. y , x >. | ( x e. A /\ y = C ) }
18		df-mpt 4157	. . . . . 6 |- ( y e. B |-> D ) = { <. y , x >. | ( y e. B /\ x = D ) }
19	12, 17, 18	3eqtr4g 2289	. . . . 5 |- ( ph -> `' F = ( y e. B |-> D ) )
20	19	fneq1d 5427	. . . 4 |- ( ph -> ( `' F Fn B <-> ( y e. B |-> D ) Fn B ) )
21	10, 20	mpbird 167	. . 3 |- ( ph -> `' F Fn B )
22		dff1o4 5600	. . 3 |- ( F : A -1-1-onto-> B <-> ( F Fn A /\ `' F Fn B ) )
23	5, 21, 22	sylanbrc 417	. 2 |- ( ph -> F : A -1-1-onto-> B )
24	23, 19	jca 306	1 |- ( ph -> ( F : A -1-1-onto-> B /\ `' F = ( y e. B |-> D ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   e. wcel 2202   A.wral 2511   {copab 4154   |-> cmpt 4155   `'ccnv 4730   Fn wfn 5328   -1-1-onto->wf1o 5332

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-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-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  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-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340

This theorem is referenced by:  f1od  6236  f1ocnv2d  6237