Theorem f1ompt 6382

Description: Express bijection for a mapping operation. (Contributed by Mario Carneiro, 30-May-2015.) (Revised by Mario Carneiro, 4-Dec-2016.)

Hypothesis

Ref	Expression
fmpt.1	|- F = ( x e. A |-> C )

Assertion

Ref	Expression
f1ompt	|- ( F : A -1-1-onto-> B <-> ( A. x e. A C e. B /\ A. y e. B E! x e. A y = C ) )

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

Allowed substitution hints:   C( x)   F( x)

Proof of Theorem f1ompt

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ffn 6045	. . . . 5 |- ( F : A --> B -> F Fn A )
2		dff1o4 6145	. . . . . 6 |- ( F : A -1-1-onto-> B <-> ( F Fn A /\ `' F Fn B ) )
3	2	baib 944	. . . . 5 |- ( F Fn A -> ( F : A -1-1-onto-> B <-> `' F Fn B ) )
4	1, 3	syl 17	. . . 4 |- ( F : A --> B -> ( F : A -1-1-onto-> B <-> `' F Fn B ) )
5		fnres 6007	. . . . . 6 |- ( ( `' F |` B ) Fn B <-> A. y e. B E! z y `' F z )
6		nfcv 2764	. . . . . . . . . 10 |- F/_ x z
7		fmpt.1	. . . . . . . . . . 11 |- F = ( x e. A |-> C )
8		nfmpt1 4747	. . . . . . . . . . 11 |- F/_ x ( x e. A |-> C )
9	7, 8	nfcxfr 2762	. . . . . . . . . 10 |- F/_ x F
10		nfcv 2764	. . . . . . . . . 10 |- F/_ x y
11	6, 9, 10	nfbr 4699	. . . . . . . . 9 |- F/ x z F y
12		nfv 1843	. . . . . . . . 9 |- F/ z ( x e. A /\ y = C )
13		breq1 4656	. . . . . . . . . 10 |- ( z = x -> ( z F y <-> x F y ) )
14		df-mpt 4730	. . . . . . . . . . . . 13 |- ( x e. A |-> C ) = { <. x , y >. | ( x e. A /\ y = C ) }
15	7, 14	eqtri 2644	. . . . . . . . . . . 12 |- F = { <. x , y >. | ( x e. A /\ y = C ) }
16	15	breqi 4659	. . . . . . . . . . 11 |- ( x F y <-> x { <. x , y >. | ( x e. A /\ y = C ) } y )
17		df-br 4654	. . . . . . . . . . . 12 |- ( x { <. x , y >. | ( x e. A /\ y = C ) } y <-> <. x , y >. e. { <. x , y >. | ( x e. A /\ y = C ) } )
18		opabid 4982	. . . . . . . . . . . 12 |- ( <. x , y >. e. { <. x , y >. | ( x e. A /\ y = C ) } <-> ( x e. A /\ y = C ) )
19	17, 18	bitri 264	. . . . . . . . . . 11 |- ( x { <. x , y >. | ( x e. A /\ y = C ) } y <-> ( x e. A /\ y = C ) )
20	16, 19	bitri 264	. . . . . . . . . 10 |- ( x F y <-> ( x e. A /\ y = C ) )
21	13, 20	syl6bb 276	. . . . . . . . 9 |- ( z = x -> ( z F y <-> ( x e. A /\ y = C ) ) )
22	11, 12, 21	cbveu 2505	. . . . . . . 8 |- ( E! z z F y <-> E! x ( x e. A /\ y = C ) )
23		vex 3203	. . . . . . . . . 10 |- y e. _V
24		vex 3203	. . . . . . . . . 10 |- z e. _V
25	23, 24	brcnv 5305	. . . . . . . . 9 |- ( y `' F z <-> z F y )
26	25	eubii 2492	. . . . . . . 8 |- ( E! z y `' F z <-> E! z z F y )
27		df-reu 2919	. . . . . . . 8 |- ( E! x e. A y = C <-> E! x ( x e. A /\ y = C ) )
28	22, 26, 27	3bitr4i 292	. . . . . . 7 |- ( E! z y `' F z <-> E! x e. A y = C )
29	28	ralbii 2980	. . . . . 6 |- ( A. y e. B E! z y `' F z <-> A. y e. B E! x e. A y = C )
30	5, 29	bitri 264	. . . . 5 |- ( ( `' F |` B ) Fn B <-> A. y e. B E! x e. A y = C )
31		relcnv 5503	. . . . . . 7 |- Rel `' F
32		df-rn 5125	. . . . . . . 8 |- ran F = dom `' F
33		frn 6053	. . . . . . . 8 |- ( F : A --> B -> ran F C_ B )
34	32, 33	syl5eqssr 3650	. . . . . . 7 |- ( F : A --> B -> dom `' F C_ B )
35		relssres 5437	. . . . . . 7 |- ( ( Rel `' F /\ dom `' F C_ B ) -> ( `' F |` B ) = `' F )
36	31, 34, 35	sylancr 695	. . . . . 6 |- ( F : A --> B -> ( `' F |` B ) = `' F )
37	36	fneq1d 5981	. . . . 5 |- ( F : A --> B -> ( ( `' F |` B ) Fn B <-> `' F Fn B ) )
38	30, 37	syl5bbr 274	. . . 4 |- ( F : A --> B -> ( A. y e. B E! x e. A y = C <-> `' F Fn B ) )
39	4, 38	bitr4d 271	. . 3 |- ( F : A --> B -> ( F : A -1-1-onto-> B <-> A. y e. B E! x e. A y = C ) )
40	39	pm5.32i 669	. 2 |- ( ( F : A --> B /\ F : A -1-1-onto-> B ) <-> ( F : A --> B /\ A. y e. B E! x e. A y = C ) )
41		f1of 6137	. . 3 |- ( F : A -1-1-onto-> B -> F : A --> B )
42	41	pm4.71ri 665	. 2 |- ( F : A -1-1-onto-> B <-> ( F : A --> B /\ F : A -1-1-onto-> B ) )
43	7	fmpt 6381	. . 3 |- ( A. x e. A C e. B <-> F : A --> B )
44	43	anbi1i 731	. 2 |- ( ( A. x e. A C e. B /\ A. y e. B E! x e. A y = C ) <-> ( F : A --> B /\ A. y e. B E! x e. A y = C ) )
45	40, 42, 44	3bitr4i 292	1 |- ( F : A -1-1-onto-> B <-> ( A. x e. A C e. B /\ A. y e. B E! x e. A y = C ) )

Syntax hints:   <-> wb 196   /\ wa 384   = wceq 1483   e. wcel 1990   E!weu 2470   A.wral 2912   E!wreu 2914   C_ wss 3574   <.cop 4183   class class class wbr 4653   {copab 4712   |-> cmpt 4729   `'ccnv 5113   dom cdm 5114   ran crn 5115   |` cres 5116   Rel wrel 5119   Fn wfn 5883   -->wf 5884   -1-1-onto->wf1o 5887

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896

This theorem is referenced by:  oaf1o  7643  xpf1o  8122  icoshftf1o  12295  fprodser  14679  dfod2  17981  gsummptf1o  18362  nbusgrf1o0  26271  cusgrfilem2  26352  numclwlk2lem2f1o  27238  f1mptrn  29435  xrmulc1cn  29976  poimirlem4  33413  poimirlem16  33425  poimirlem17  33426  poimirlem19  33428  poimirlem20  33429