Theorem f1cnvcnv 5514

Description: Two ways to express that a set A (not necessarily a function) is one-to-one. Each side is equivalent to Definition 6.4(3) of [TakeutiZaring] p. 24, who use the notation "Un₂ (A)" for one-to-one. We do not introduce a separate notation since we rarely use it. (Contributed by NM, 13-Aug-2004.)

Assertion

Ref	Expression
f1cnvcnv	|- ( `' `' A : dom A -1-1-> _V <-> ( Fun `' A /\ Fun `' `' A ) )

Proof of Theorem f1cnvcnv

Step	Hyp	Ref	Expression
1		df-f1 5295	. 2 |- ( `' `' A : dom A -1-1-> _V <-> ( `' `' A : dom A --> _V /\ Fun `' `' `' A ) )
2		dffn2 5447	. . . 4 |- ( `' `' A Fn dom A <-> `' `' A : dom A --> _V )
3		dmcnvcnv 4921	. . . . 5 |- dom `' `' A = dom A
4		df-fn 5293	. . . . 5 |- ( `' `' A Fn dom A <-> ( Fun `' `' A /\ dom `' `' A = dom A ) )
5	3, 4	mpbiran2 944	. . . 4 |- ( `' `' A Fn dom A <-> Fun `' `' A )
6	2, 5	bitr3i 186	. . 3 |- ( `' `' A : dom A --> _V <-> Fun `' `' A )
7		relcnv 5079	. . . . 5 |- Rel `' A
8		dfrel2 5152	. . . . 5 |- ( Rel `' A <-> `' `' `' A = `' A )
9	7, 8	mpbi 145	. . . 4 |- `' `' `' A = `' A
10	9	funeqi 5311	. . 3 |- ( Fun `' `' `' A <-> Fun `' A )
11	6, 10	anbi12ci 461	. 2 |- ( ( `' `' A : dom A --> _V /\ Fun `' `' `' A ) <-> ( Fun `' A /\ Fun `' `' A ) )
12	1, 11	bitri 184	1 |- ( `' `' A : dom A -1-1-> _V <-> ( Fun `' A /\ Fun `' `' A ) )

Syntax hints:   /\ wa 104   <-> wb 105   = wceq 1373   _Vcvv 2776   `'ccnv 4692   dom cdm 4693   Rel wrel 4698   Fun wfun 5284   Fn wfn 5285   -->wf 5286   -1-1->wf1 5287

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-br 4060  df-opab 4122  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295

This theorem is referenced by: (None)