Theorem f1veqaeq 5978

Description: If the values of a one-to-one function for two arguments are equal, the arguments themselves must be equal. (Contributed by Alexander van der Vekens, 12-Nov-2017.)

Assertion

Ref	Expression
f1veqaeq	|- ( ( F : A -1-1-> B /\ ( C e. A /\ D e. A ) ) -> ( ( F ` C ) = ( F ` D ) -> C = D ) )

Proof of Theorem f1veqaeq

Dummy variables c d are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dff13 5977	. . 3 |- ( F : A -1-1-> B <-> ( F : A --> B /\ A. c e. A A. d e. A ( ( F ` c ) = ( F ` d ) -> c = d ) ) )
2		fveq2 5698	. . . . . . . 8 |- ( c = C -> ( F ` c ) = ( F ` C ) )
3	2	eqeq1d 2247	. . . . . . 7 |- ( c = C -> ( ( F ` c ) = ( F ` d ) <-> ( F ` C ) = ( F ` d ) ) )
4		eqeq1 2245	. . . . . . 7 |- ( c = C -> ( c = d <-> C = d ) )
5	3, 4	imbi12d 234	. . . . . 6 |- ( c = C -> ( ( ( F ` c ) = ( F ` d ) -> c = d ) <-> ( ( F ` C ) = ( F ` d ) -> C = d ) ) )
6		fveq2 5698	. . . . . . . 8 |- ( d = D -> ( F ` d ) = ( F ` D ) )
7	6	eqeq2d 2250	. . . . . . 7 |- ( d = D -> ( ( F ` C ) = ( F ` d ) <-> ( F ` C ) = ( F ` D ) ) )
8		eqeq2 2248	. . . . . . 7 |- ( d = D -> ( C = d <-> C = D ) )
9	7, 8	imbi12d 234	. . . . . 6 |- ( d = D -> ( ( ( F ` C ) = ( F ` d ) -> C = d ) <-> ( ( F ` C ) = ( F ` D ) -> C = D ) ) )
10	5, 9	rspc2v 2943	. . . . 5 |- ( ( C e. A /\ D e. A ) -> ( A. c e. A A. d e. A ( ( F ` c ) = ( F ` d ) -> c = d ) -> ( ( F ` C ) = ( F ` D ) -> C = D ) ) )
11	10	com12 30	. . . 4 |- ( A. c e. A A. d e. A ( ( F ` c ) = ( F ` d ) -> c = d ) -> ( ( C e. A /\ D e. A ) -> ( ( F ` C ) = ( F ` D ) -> C = D ) ) )
12	11	adantl 277	. . 3 |- ( ( F : A --> B /\ A. c e. A A. d e. A ( ( F ` c ) = ( F ` d ) -> c = d ) ) -> ( ( C e. A /\ D e. A ) -> ( ( F ` C ) = ( F ` D ) -> C = D ) ) )
13	1, 12	sylbi 121	. 2 |- ( F : A -1-1-> B -> ( ( C e. A /\ D e. A ) -> ( ( F ` C ) = ( F ` D ) -> C = D ) ) )
14	13	imp 124	1 |- ( ( F : A -1-1-> B /\ ( C e. A /\ D e. A ) ) -> ( ( F ` C ) = ( F ` D ) -> C = D ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   A.wral 2528   -->wf 5376   -1-1->wf1 5377   ` cfv 5380

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fv 5388

This theorem is used by:  f1fveq  5981  f1ocnvfvrneq  5991  f1o2ndf1  6468  1dom1el  7111  fidceq  7175  difinfsnlem  7445  difinfsn  7446  pr2cv1  7547  iseqf1olemab  10960  iseqf1olemnanb  10961  f1ghm0to0  14134  uspgr2wlkeq  16811  3dom  17223  pwle2  17233