| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1cnvcnv | Structured version Visualization version GIF version | ||
| 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 "Un2 (A)" for one-to-one. We do not introduce a separate notation since we rarely use it. (Contributed by NM, 13-Aug-2004.) |
| Ref | Expression |
|---|---|
| f1cnvcnv | ⊢ (◡◡𝐴:dom 𝐴⟶1-1V ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-f1 6570 | . 2 ⊢ (◡◡𝐴:dom 𝐴⟶1-1V ↔ (◡◡𝐴:dom 𝐴⟶V ∧ Fun ◡◡◡𝐴)) | |
| 2 | dffn2 6740 | . . . 4 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ ◡◡𝐴:dom 𝐴⟶V) | |
| 3 | dmcnvcnv 5926 | . . . . 5 ⊢ dom ◡◡𝐴 = dom 𝐴 | |
| 4 | df-fn 6568 | . . . . 5 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ (Fun ◡◡𝐴 ∧ dom ◡◡𝐴 = dom 𝐴)) | |
| 5 | 3, 4 | mpbiran2 723 | . . . 4 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ Fun ◡◡𝐴) |
| 6 | 2, 5 | bitr3i 280 | . . 3 ⊢ (◡◡𝐴:dom 𝐴⟶V ↔ Fun ◡◡𝐴) |
| 7 | relcnv 6117 | . . . . 5 ⊢ Rel ◡𝐴 | |
| 8 | dfrel2 6198 | . . . . 5 ⊢ (Rel ◡𝐴 ↔ ◡◡◡𝐴 = ◡𝐴) | |
| 9 | 7, 8 | mpbi 233 | . . . 4 ⊢ ◡◡◡𝐴 = ◡𝐴 |
| 10 | 9 | funeqi 6587 | . . 3 ⊢ (Fun ◡◡◡𝐴 ↔ Fun ◡𝐴) |
| 11 | 6, 10 | anbi12ci 641 | . 2 ⊢ ((◡◡𝐴:dom 𝐴⟶V ∧ Fun ◡◡◡𝐴) ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴)) |
| 12 | 1, 11 | bitri 278 | 1 ⊢ (◡◡𝐴:dom 𝐴⟶1-1V ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1572 Vcvv 3453 ◡ccnv 5656 dom cdm 5657 Rel wrel 5662 Fun wfun 6559 Fn wfn 6560 ⟶wf 6561 ⟶1-1wf1 6562 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-sep 5254 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-br 5108 df-opab 5173 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |