| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > f1cnvcnv | 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-1→V ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-f1 5323 | . 2 ⊢ (◡◡𝐴:dom 𝐴–1-1→V ↔ (◡◡𝐴:dom 𝐴⟶V ∧ Fun ◡◡◡𝐴)) | |
| 2 | dffn2 5475 | . . . 4 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ ◡◡𝐴:dom 𝐴⟶V) | |
| 3 | dmcnvcnv 4948 | . . . . 5 ⊢ dom ◡◡𝐴 = dom 𝐴 | |
| 4 | df-fn 5321 | . . . . 5 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ (Fun ◡◡𝐴 ∧ dom ◡◡𝐴 = dom 𝐴)) | |
| 5 | 3, 4 | mpbiran2 947 | . . . 4 ⊢ (◡◡𝐴 Fn dom 𝐴 ↔ Fun ◡◡𝐴) |
| 6 | 2, 5 | bitr3i 186 | . . 3 ⊢ (◡◡𝐴:dom 𝐴⟶V ↔ Fun ◡◡𝐴) |
| 7 | relcnv 5106 | . . . . 5 ⊢ Rel ◡𝐴 | |
| 8 | dfrel2 5179 | . . . . 5 ⊢ (Rel ◡𝐴 ↔ ◡◡◡𝐴 = ◡𝐴) | |
| 9 | 7, 8 | mpbi 145 | . . . 4 ⊢ ◡◡◡𝐴 = ◡𝐴 |
| 10 | 9 | funeqi 5339 | . . 3 ⊢ (Fun ◡◡◡𝐴 ↔ Fun ◡𝐴) |
| 11 | 6, 10 | anbi12ci 461 | . 2 ⊢ ((◡◡𝐴:dom 𝐴⟶V ∧ Fun ◡◡◡𝐴) ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴)) |
| 12 | 1, 11 | bitri 184 | 1 ⊢ (◡◡𝐴:dom 𝐴–1-1→V ↔ (Fun ◡𝐴 ∧ Fun ◡◡𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1395 Vcvv 2799 ◡ccnv 4718 dom cdm 4719 Rel wrel 4724 Fun wfun 5312 Fn wfn 5313 ⟶wf 5314 –1-1→wf1 5315 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-br 4084 df-opab 4146 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |