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 2955 | . 2 ⊢ Ⅎ𝑥𝐹 | |
2 | nfcv 2955 | . 2 ⊢ Ⅎ𝑦𝐹 | |
3 | 1, 2 | dffun6f 6338 | 1 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∀wal 1536 ∃*wmo 2596 class class class wbr 5030 Rel wrel 5524 Fun wfun 6318 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-opab 5093 df-id 5425 df-cnv 5527 df-co 5528 df-fun 6326 |
This theorem is referenced by: funmo 6340 dffun7 6351 fununfun 6372 funcnvsn 6374 funcnv2 6392 svrelfun 6396 fnres 6446 nfunsn 6682 dff3 6843 brdom3 9939 nqerf 10341 shftfn 14424 cnextfun 22669 perfdvf 24506 taylf 24956 funressnvmo 43637 |
Copyright terms: Public domain | W3C validator |