Theorem f1cnvcnv 5612

Description: Two ways to express that a set 𝐴 (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	⊢ (◡◡𝐴:dom 𝐴–1-1→V ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴))

Proof of Theorem f1cnvcnv

Step	Hyp	Ref	Expression
1		df-f1 5385	. 2 ⊢ (◡◡𝐴:dom 𝐴–1-1→V ↔ (◡◡𝐴:dom 𝐴⟶V ∧ Fun ◡◡◡𝐴))
2		dffn2 5538	. . . 4 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ ◡◡𝐴:dom 𝐴⟶V)
3		dmcnvcnv 5008	. . . . 5 ⊢ dom ◡◡𝐴 = dom 𝐴
4		df-fn 5383	. . . . 5 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ (Fun ◡◡𝐴 ∧ dom ◡◡𝐴 = dom 𝐴))
5	3, 4	mpbiran2 954	. . . 4 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ Fun ◡◡𝐴)
6	2, 5	bitr3i 186	. . 3 ⊢ (◡◡𝐴:dom 𝐴⟶V ↔ Fun ◡◡𝐴)
7		relcnv 5168	. . . . 5 ⊢ Rel ◡𝐴
8		dfrel2 5241	. . . . 5 ⊢ (Rel ◡𝐴 ↔ ◡◡◡𝐴 = ◡𝐴)
9	7, 8	mpbi 145	. . . 4 ⊢ ◡◡◡𝐴 = ◡𝐴
10	9	funeqi 5401	. . 3 ⊢ (Fun ◡◡◡𝐴 ↔ Fun ◡𝐴)
11	6, 10	anbi12ci 465	. 2 ⊢ ((◡◡𝐴:dom 𝐴⟶V ∧ Fun ◡◡◡𝐴) ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴))
12	1, 11	bitri 184	1 ⊢ (◡◡𝐴:dom 𝐴–1-1→V ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴))

This proof depends on syntax axioms:   ∧ wa 104   ↔ wb 105   = wceq 1402  Vcvv 2821  ^◡ccnv 4775  dom cdm 4776  Rel wrel 4781  Fun wfun 5374   Fn wfn 5375  ⟶wf 5376  –1-1→wf1 5377

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-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4132  df-opab 4194  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385

This theorem is used by: (None)