Theorem f1cnvcnv 5553

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 5331	. 2 |- ( `' `' A : dom A -1-1-> _V <-> ( `' `' A : dom A --> _V /\ Fun `' `' `' A ) )
2		dffn2 5484	. . . 4 |- ( `' `' A Fn dom A <-> `' `' A : dom A --> _V )
3		dmcnvcnv 4956	. . . . 5 |- dom `' `' A = dom A
4		df-fn 5329	. . . . 5 |- ( `' `' A Fn dom A <-> ( Fun `' `' A /\ dom `' `' A = dom A ) )
5	3, 4	mpbiran2 949	. . . 4 |- ( `' `' A Fn dom A <-> Fun `' `' A )
6	2, 5	bitr3i 186	. . 3 |- ( `' `' A : dom A --> _V <-> Fun `' `' A )
7		relcnv 5114	. . . . 5 |- Rel `' A
8		dfrel2 5187	. . . . 5 |- ( Rel `' A <-> `' `' `' A = `' A )
9	7, 8	mpbi 145	. . . 4 |- `' `' `' A = `' A
10	9	funeqi 5347	. . 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 1397   _Vcvv 2802   `'ccnv 4724   dom cdm 4725   Rel wrel 4730   Fun wfun 5320   Fn wfn 5321   -->wf 5322   -1-1->wf1 5323

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331

This theorem is referenced by: (None)