Theorem f1cnvcnv 6740

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 6498	. 2 ⊢ (◡◡𝐴:dom 𝐴–1-1→V ↔ (◡◡𝐴:dom 𝐴⟶V ∧ Fun ◡◡◡𝐴))
2		dffn2 6665	. . . 4 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ ◡◡𝐴:dom 𝐴⟶V)
3		dmcnvcnv 5883	. . . . 5 ⊢ dom ◡◡𝐴 = dom 𝐴
4		df-fn 6496	. . . . 5 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ (Fun ◡◡𝐴 ∧ dom ◡◡𝐴 = dom 𝐴))
5	3, 4	mpbiran2 711	. . . 4 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ Fun ◡◡𝐴)
6	2, 5	bitr3i 277	. . 3 ⊢ (◡◡𝐴:dom 𝐴⟶V ↔ Fun ◡◡𝐴)
7		relcnv 6064	. . . . 5 ⊢ Rel ◡𝐴
8		dfrel2 6148	. . . . 5 ⊢ (Rel ◡𝐴 ↔ ◡◡◡𝐴 = ◡𝐴)
9	7, 8	mpbi 230	. . . 4 ⊢ ◡◡◡𝐴 = ◡𝐴
10	9	funeqi 6514	. . 3 ⊢ (Fun ◡◡◡𝐴 ↔ Fun ◡𝐴)
11	6, 10	anbi12ci 630	. 2 ⊢ ((◡◡𝐴:dom 𝐴⟶V ∧ Fun ◡◡◡𝐴) ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴))
12	1, 11	bitri 275	1 ⊢ (◡◡𝐴:dom 𝐴–1-1→V ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1542  Vcvv 3441  ^◡ccnv 5624  dom cdm 5625  Rel wrel 5630  Fun wfun 6487   Fn wfn 6488  ⟶wf 6489  –1-1→wf1 6490

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pr 5378

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4287  df-if 4481  df-sn 4582  df-pr 4584  df-op 4588  df-br 5100  df-opab 5162  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498

This theorem is referenced by: (None)