Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dffun6 | Structured version Visualization version GIF version |
Description: Alternate definition of a function using "at most one" notation. (Contributed by NM, 9-Mar-1995.) |
Ref | Expression |
---|---|
dffun6 | ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2764 | . 2 ⊢ Ⅎ𝑥𝐹 | |
2 | nfcv 2764 | . 2 ⊢ Ⅎ𝑦𝐹 | |
3 | 1, 2 | dffun6f 5902 | 1 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∧ wa 384 ∀wal 1481 ∃*wmo 2471 class class class wbr 4653 Rel wrel 5119 Fun wfun 5882 |
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-cnv 5122 df-co 5123 df-fun 5890 |
This theorem is referenced by: funmo 5904 dffun7 5915 fununfun 5934 funcnvsn 5936 funcnv2 5957 svrelfun 5961 fnres 6007 nfunsn 6225 dff3 6372 brdom3 9350 nqerf 9752 shftfn 13813 cnextfun 21868 perfdvf 23667 taylf 24115 |
Copyright terms: Public domain | W3C validator |