Theorem f1ompt 5564

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 5267	. . . . 5 |- ( F : A --> B -> F Fn A )
2		dff1o4 5368	. . . . . 6 |- ( F : A -1-1-onto-> B <-> ( F Fn A /\ `' F Fn B ) )
3	2	baib 904	. . . . 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 5234	. . . . . 6 |- ( ( `' F |` B ) Fn B <-> A. y e. B E! z y `' F z )
6		nfcv 2279	. . . . . . . . . 10 |- F/_ x z
7		fmpt.1	. . . . . . . . . . 11 |- F = ( x e. A |-> C )
8		nfmpt1 4016	. . . . . . . . . . 11 |- F/_ x ( x e. A |-> C )
9	7, 8	nfcxfr 2276	. . . . . . . . . 10 |- F/_ x F
10		nfcv 2279	. . . . . . . . . 10 |- F/_ x y
11	6, 9, 10	nfbr 3969	. . . . . . . . 9 |- F/ x z F y
12		nfv 1508	. . . . . . . . 9 |- F/ z ( x e. A /\ y = C )
13		breq1 3927	. . . . . . . . . 10 |- ( z = x -> ( z F y <-> x F y ) )
14		df-mpt 3986	. . . . . . . . . . . . 13 |- ( x e. A |-> C ) = { <. x , y >. | ( x e. A /\ y = C ) }
15	7, 14	eqtri 2158	. . . . . . . . . . . 12 |- F = { <. x , y >. | ( x e. A /\ y = C ) }
16	15	breqi 3930	. . . . . . . . . . 11 |- ( x F y <-> x { <. x , y >. | ( x e. A /\ y = C ) } y )
17		df-br 3925	. . . . . . . . . . . 12 |- ( x { <. x , y >. | ( x e. A /\ y = C ) } y <-> <. x , y >. e. { <. x , y >. | ( x e. A /\ y = C ) } )
18		opabid 4174	. . . . . . . . . . . 12 |- ( <. x , y >. e. { <. x , y >. | ( x e. A /\ y = C ) } <-> ( x e. A /\ y = C ) )
19	17, 18	bitri 183	. . . . . . . . . . 11 |- ( x { <. x , y >. | ( x e. A /\ y = C ) } y <-> ( x e. A /\ y = C ) )
20	16, 19	bitri 183	. . . . . . . . . 10 |- ( x F y <-> ( x e. A /\ y = C ) )
21	13, 20	syl6bb 195	. . . . . . . . 9 |- ( z = x -> ( z F y <-> ( x e. A /\ y = C ) ) )
22	11, 12, 21	cbveu 2021	. . . . . . . 8 |- ( E! z z F y <-> E! x ( x e. A /\ y = C ) )
23		vex 2684	. . . . . . . . . 10 |- y e. _V
24		vex 2684	. . . . . . . . . 10 |- z e. _V
25	23, 24	brcnv 4717	. . . . . . . . 9 |- ( y `' F z <-> z F y )
26	25	eubii 2006	. . . . . . . 8 |- ( E! z y `' F z <-> E! z z F y )
27		df-reu 2421	. . . . . . . 8 |- ( E! x e. A y = C <-> E! x ( x e. A /\ y = C ) )
28	22, 26, 27	3bitr4i 211	. . . . . . 7 |- ( E! z y `' F z <-> E! x e. A y = C )
29	28	ralbii 2439	. . . . . 6 |- ( A. y e. B E! z y `' F z <-> A. y e. B E! x e. A y = C )
30	5, 29	bitri 183	. . . . 5 |- ( ( `' F |` B ) Fn B <-> A. y e. B E! x e. A y = C )
31		relcnv 4912	. . . . . . 7 |- Rel `' F
32		df-rn 4545	. . . . . . . 8 |- ran F = dom `' F
33		frn 5276	. . . . . . . 8 |- ( F : A --> B -> ran F C_ B )
34	32, 33	eqsstrrid 3139	. . . . . . 7 |- ( F : A --> B -> dom `' F C_ B )
35		relssres 4852	. . . . . . 7 |- ( ( Rel `' F /\ dom `' F C_ B ) -> ( `' F |` B ) = `' F )
36	31, 34, 35	sylancr 410	. . . . . 6 |- ( F : A --> B -> ( `' F |` B ) = `' F )
37	36	fneq1d 5208	. . . . 5 |- ( F : A --> B -> ( ( `' F |` B ) Fn B <-> `' F Fn B ) )
38	30, 37	syl5bbr 193	. . . 4 |- ( F : A --> B -> ( A. y e. B E! x e. A y = C <-> `' F Fn B ) )
39	4, 38	bitr4d 190	. . 3 |- ( F : A --> B -> ( F : A -1-1-onto-> B <-> A. y e. B E! x e. A y = C ) )
40	39	pm5.32i 449	. 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 5360	. . 3 |- ( F : A -1-1-onto-> B -> F : A --> B )
42	41	pm4.71ri 389	. 2 |- ( F : A -1-1-onto-> B <-> ( F : A --> B /\ F : A -1-1-onto-> B ) )
43	7	fmpt 5563	. . 3 |- ( A. x e. A C e. B <-> F : A --> B )
44	43	anbi1i 453	. 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 211	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 103   <-> wb 104   = wceq 1331   e. wcel 1480   E!weu 1997   A.wral 2414   E!wreu 2416   C_ wss 3066   <.cop 3525   class class class wbr 3924   {copab 3983   |-> cmpt 3984   `'ccnv 4533   dom cdm 4534   ran crn 4535   |` cres 4536   Rel wrel 4539   Fn wfn 5113   -->wf 5114   -1-1-onto->wf1o 5117

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126

This theorem is referenced by:  xpf1o  6731  icoshftf1o  9767