Theorem f1ompt 5716

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 5410	. . . . 5 |- ( F : A --> B -> F Fn A )
2		dff1o4 5515	. . . . . 6 |- ( F : A -1-1-onto-> B <-> ( F Fn A /\ `' F Fn B ) )
3	2	baib 920	. . . . 5 |- ( F Fn A -> ( F : A -1-1-onto-> B <-> `' F Fn B ) )
4	1, 3	syl 14	. . . 4 |- ( F : A --> B -> ( F : A -1-1-onto-> B <-> `' F Fn B ) )
5		fnres 5377	. . . . . 6 |- ( ( `' F |` B ) Fn B <-> A. y e. B E! z y `' F z )
6		nfcv 2339	. . . . . . . . . 10 |- F/_ x z
7		fmpt.1	. . . . . . . . . . 11 |- F = ( x e. A |-> C )
8		nfmpt1 4127	. . . . . . . . . . 11 |- F/_ x ( x e. A |-> C )
9	7, 8	nfcxfr 2336	. . . . . . . . . 10 |- F/_ x F
10		nfcv 2339	. . . . . . . . . 10 |- F/_ x y
11	6, 9, 10	nfbr 4080	. . . . . . . . 9 |- F/ x z F y
12		nfv 1542	. . . . . . . . 9 |- F/ z ( x e. A /\ y = C )
13		breq1 4037	. . . . . . . . . 10 |- ( z = x -> ( z F y <-> x F y ) )
14		df-mpt 4097	. . . . . . . . . . . . 13 |- ( x e. A |-> C ) = { <. x , y >. | ( x e. A /\ y = C ) }
15	7, 14	eqtri 2217	. . . . . . . . . . . 12 |- F = { <. x , y >. | ( x e. A /\ y = C ) }
16	15	breqi 4040	. . . . . . . . . . 11 |- ( x F y <-> x { <. x , y >. | ( x e. A /\ y = C ) } y )
17		df-br 4035	. . . . . . . . . . . 12 |- ( x { <. x , y >. | ( x e. A /\ y = C ) } y <-> <. x , y >. e. { <. x , y >. | ( x e. A /\ y = C ) } )
18		opabid 4291	. . . . . . . . . . . 12 |- ( <. x , y >. e. { <. x , y >. | ( x e. A /\ y = C ) } <-> ( x e. A /\ y = C ) )
19	17, 18	bitri 184	. . . . . . . . . . 11 |- ( x { <. x , y >. | ( x e. A /\ y = C ) } y <-> ( x e. A /\ y = C ) )
20	16, 19	bitri 184	. . . . . . . . . 10 |- ( x F y <-> ( x e. A /\ y = C ) )
21	13, 20	bitrdi 196	. . . . . . . . 9 |- ( z = x -> ( z F y <-> ( x e. A /\ y = C ) ) )
22	11, 12, 21	cbveu 2069	. . . . . . . 8 |- ( E! z z F y <-> E! x ( x e. A /\ y = C ) )
23		vex 2766	. . . . . . . . . 10 |- y e. _V
24		vex 2766	. . . . . . . . . 10 |- z e. _V
25	23, 24	brcnv 4850	. . . . . . . . 9 |- ( y `' F z <-> z F y )
26	25	eubii 2054	. . . . . . . 8 |- ( E! z y `' F z <-> E! z z F y )
27		df-reu 2482	. . . . . . . 8 |- ( E! x e. A y = C <-> E! x ( x e. A /\ y = C ) )
28	22, 26, 27	3bitr4i 212	. . . . . . 7 |- ( E! z y `' F z <-> E! x e. A y = C )
29	28	ralbii 2503	. . . . . 6 |- ( A. y e. B E! z y `' F z <-> A. y e. B E! x e. A y = C )
30	5, 29	bitri 184	. . . . 5 |- ( ( `' F |` B ) Fn B <-> A. y e. B E! x e. A y = C )
31		relcnv 5048	. . . . . . 7 |- Rel `' F
32		df-rn 4675	. . . . . . . 8 |- ran F = dom `' F
33		frn 5419	. . . . . . . 8 |- ( F : A --> B -> ran F C_ B )
34	32, 33	eqsstrrid 3231	. . . . . . 7 |- ( F : A --> B -> dom `' F C_ B )
35		relssres 4985	. . . . . . 7 |- ( ( Rel `' F /\ dom `' F C_ B ) -> ( `' F |` B ) = `' F )
36	31, 34, 35	sylancr 414	. . . . . 6 |- ( F : A --> B -> ( `' F |` B ) = `' F )
37	36	fneq1d 5349	. . . . 5 |- ( F : A --> B -> ( ( `' F |` B ) Fn B <-> `' F Fn B ) )
38	30, 37	bitr3id 194	. . . 4 |- ( F : A --> B -> ( A. y e. B E! x e. A y = C <-> `' F Fn B ) )
39	4, 38	bitr4d 191	. . 3 |- ( F : A --> B -> ( F : A -1-1-onto-> B <-> A. y e. B E! x e. A y = C ) )
40	39	pm5.32i 454	. 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 5507	. . 3 |- ( F : A -1-1-onto-> B -> F : A --> B )
42	41	pm4.71ri 392	. 2 |- ( F : A -1-1-onto-> B <-> ( F : A --> B /\ F : A -1-1-onto-> B ) )
43	7	fmpt 5715	. . 3 |- ( A. x e. A C e. B <-> F : A --> B )
44	43	anbi1i 458	. 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 212	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:   /\ wa 104   <-> wb 105   = wceq 1364   E!weu 2045   e. wcel 2167   A.wral 2475   E!wreu 2477   C_ wss 3157   <.cop 3626   class class class wbr 4034   {copab 4094   |-> cmpt 4095   `'ccnv 4663   dom cdm 4664   ran crn 4665   |` cres 4666   Rel wrel 4669   Fn wfn 5254   -->wf 5255   -1-1-onto->wf1o 5258

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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267

This theorem is referenced by:  xpf1o  6914  icoshftf1o  10083