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 2906 | . 2 ⊢ Ⅎ𝑥𝐹 | |
2 | nfcv 2906 | . 2 ⊢ Ⅎ𝑦𝐹 | |
3 | 1, 2 | dffun6f 6432 | 1 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 ∀wal 1537 ∃*wmo 2538 class class class wbr 5070 Rel wrel 5585 Fun wfun 6412 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ral 3068 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-opab 5133 df-id 5480 df-cnv 5588 df-co 5589 df-fun 6420 |
This theorem is referenced by: funmo 6434 dffun7 6445 fununfun 6466 funcnvsn 6468 funcnv2 6486 svrelfun 6490 fnres 6543 nfunsn 6793 dff3 6958 brdom3 10215 nqerf 10617 shftfn 14712 cnextfun 23123 perfdvf 24972 taylf 25425 funressnvmo 44426 |
Copyright terms: Public domain | W3C validator |