Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dff12 | Structured version Visualization version GIF version |
Description: Alternate definition of a one-to-one function. (Contributed by NM, 31-Dec-1996.) |
Ref | Expression |
---|---|
dff12 | ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦∃*𝑥 𝑥𝐹𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-f1 5893 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
2 | funcnv2 5957 | . . 3 ⊢ (Fun ◡𝐹 ↔ ∀𝑦∃*𝑥 𝑥𝐹𝑦) | |
3 | 2 | anbi2i 730 | . 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦∃*𝑥 𝑥𝐹𝑦)) |
4 | 1, 3 | bitri 264 | 1 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦∃*𝑥 𝑥𝐹𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∧ wa 384 ∀wal 1481 ∃*wmo 2471 class class class wbr 4653 ◡ccnv 5113 Fun wfun 5882 ⟶wf 5884 –1-1→wf1 5885 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-br 4654 df-opab 4713 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-fun 5890 df-f1 5893 |
This theorem is referenced by: dff13 6512 fseqenlem2 8848 s4f1o 13663 2ndcdisj 21259 usgrexmplef 26151 phpreu 33393 |
Copyright terms: Public domain | W3C validator |