Theorem f1cnvcnv 6571

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 6341	. 2 ⊢ (◡◡𝐴:dom 𝐴–1-1→V ↔ (◡◡𝐴:dom 𝐴⟶V ∧ Fun ◡◡◡𝐴))
2		dffn2 6501	. . . 4 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ ◡◡𝐴:dom 𝐴⟶V)
3		dmcnvcnv 5775	. . . . 5 ⊢ dom ◡◡𝐴 = dom 𝐴
4		df-fn 6339	. . . . 5 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ (Fun ◡◡𝐴 ∧ dom ◡◡𝐴 = dom 𝐴))
5	3, 4	mpbiran2 710	. . . 4 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ Fun ◡◡𝐴)
6	2, 5	bitr3i 280	. . 3 ⊢ (◡◡𝐴:dom 𝐴⟶V ↔ Fun ◡◡𝐴)
7		relcnv 5940	. . . . 5 ⊢ Rel ◡𝐴
8		dfrel2 6019	. . . . 5 ⊢ (Rel ◡𝐴 ↔ ◡◡◡𝐴 = ◡𝐴)
9	7, 8	mpbi 233	. . . 4 ⊢ ◡◡◡𝐴 = ◡𝐴
10	9	funeqi 6357	. . 3 ⊢ (Fun ◡◡◡𝐴 ↔ Fun ◡𝐴)
11	6, 10	anbi12ci 631	. 2 ⊢ ((◡◡𝐴:dom 𝐴⟶V ∧ Fun ◡◡◡𝐴) ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴))
12	1, 11	bitri 278	1 ⊢ (◡◡𝐴:dom 𝐴–1-1→V ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴))

Syntax hints:   ↔ wb 209   ∧ wa 400   = wceq 1539  Vcvv 3410  ^◡ccnv 5524  dom cdm 5525  Rel wrel 5530  Fun wfun 6330   Fn wfn 6331  ⟶wf 6332  –1-1→wf1 6333

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2114  ax-9 2122  ax-11 2159  ax-12 2176  ax-ext 2730  ax-sep 5170  ax-nul 5177  ax-pr 5299

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 846  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2071  df-clab 2737  df-cleq 2751  df-clel 2831  df-v 3412  df-dif 3862  df-un 3864  df-in 3866  df-ss 3876  df-nul 4227  df-if 4422  df-sn 4524  df-pr 4526  df-op 4530  df-br 5034  df-opab 5096  df-xp 5531  df-rel 5532  df-cnv 5533  df-co 5534  df-dm 5535  df-rn 5536  df-fun 6338  df-fn 6339  df-f 6340  df-f1 6341

This theorem is referenced by: (None)