Theorem f1ompt 5709

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 5403	. . . . 5 |- ( F : A --> B -> F Fn A )
2		dff1o4 5508	. . . . . 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 5370	. . . . . 6 |- ( ( `' F |` B ) Fn B <-> A. y e. B E! z y `' F z )
6		nfcv 2336	. . . . . . . . . 10 |- F/_ x z
7		fmpt.1	. . . . . . . . . . 11 |- F = ( x e. A |-> C )
8		nfmpt1 4122	. . . . . . . . . . 11 |- F/_ x ( x e. A |-> C )
9	7, 8	nfcxfr 2333	. . . . . . . . . 10 |- F/_ x F
10		nfcv 2336	. . . . . . . . . 10 |- F/_ x y
11	6, 9, 10	nfbr 4075	. . . . . . . . 9 |- F/ x z F y
12		nfv 1539	. . . . . . . . 9 |- F/ z ( x e. A /\ y = C )
13		breq1 4032	. . . . . . . . . 10 |- ( z = x -> ( z F y <-> x F y ) )
14		df-mpt 4092	. . . . . . . . . . . . 13 |- ( x e. A |-> C ) = { <. x , y >. | ( x e. A /\ y = C ) }
15	7, 14	eqtri 2214	. . . . . . . . . . . 12 |- F = { <. x , y >. | ( x e. A /\ y = C ) }
16	15	breqi 4035	. . . . . . . . . . 11 |- ( x F y <-> x { <. x , y >. | ( x e. A /\ y = C ) } y )
17		df-br 4030	. . . . . . . . . . . 12 |- ( x { <. x , y >. | ( x e. A /\ y = C ) } y <-> <. x , y >. e. { <. x , y >. | ( x e. A /\ y = C ) } )
18		opabid 4286	. . . . . . . . . . . 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 2066	. . . . . . . 8 |- ( E! z z F y <-> E! x ( x e. A /\ y = C ) )
23		vex 2763	. . . . . . . . . 10 |- y e. _V
24		vex 2763	. . . . . . . . . 10 |- z e. _V
25	23, 24	brcnv 4845	. . . . . . . . 9 |- ( y `' F z <-> z F y )
26	25	eubii 2051	. . . . . . . 8 |- ( E! z y `' F z <-> E! z z F y )
27		df-reu 2479	. . . . . . . 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 2500	. . . . . 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 5043	. . . . . . 7 |- Rel `' F
32		df-rn 4670	. . . . . . . 8 |- ran F = dom `' F
33		frn 5412	. . . . . . . 8 |- ( F : A --> B -> ran F C_ B )
34	32, 33	eqsstrrid 3226	. . . . . . 7 |- ( F : A --> B -> dom `' F C_ B )
35		relssres 4980	. . . . . . 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 5344	. . . . 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 5500	. . 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 5708	. . 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 2042   e. wcel 2164   A.wral 2472   E!wreu 2474   C_ wss 3153   <.cop 3621   class class class wbr 4029   {copab 4089   |-> cmpt 4090   `'ccnv 4658   dom cdm 4659   ran crn 4660   |` cres 4661   Rel wrel 4664   Fn wfn 5249   -->wf 5250   -1-1-onto->wf1o 5253

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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2986  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262

This theorem is referenced by:  xpf1o  6900  icoshftf1o  10057