![]() |
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 6568 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
2 | funcnv2 6636 | . . 3 ⊢ (Fun ◡𝐹 ↔ ∀𝑦∃*𝑥 𝑥𝐹𝑦) | |
3 | 2 | anbi2i 623 | . 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦∃*𝑥 𝑥𝐹𝑦)) |
4 | 1, 3 | bitri 275 | 1 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦∃*𝑥 𝑥𝐹𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 ∀wal 1535 ∃*wmo 2536 class class class wbr 5148 ◡ccnv 5688 Fun wfun 6557 ⟶wf 6559 –1-1→wf1 6560 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-mo 2538 df-clab 2713 df-cleq 2727 df-clel 2814 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-br 5149 df-opab 5211 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-fun 6565 df-f1 6568 |
This theorem is referenced by: dff13 7275 fseqenlem2 10063 s4f1o 14954 2ndcdisj 23480 usgrexmplef 29291 phpreu 37591 |
Copyright terms: Public domain | W3C validator |