![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > dffun6 | 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 2282 | . 2 ⊢ Ⅎ𝑥𝐹 | |
2 | nfcv 2282 | . 2 ⊢ Ⅎ𝑦𝐹 | |
3 | 1, 2 | dffun6f 5144 | 1 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑥∃*𝑦 𝑥𝐹𝑦)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 ↔ wb 104 ∀wal 1330 ∃*wmo 2001 class class class wbr 3937 Rel wrel 4552 Fun wfun 5125 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 df-v 2691 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-br 3938 df-opab 3998 df-id 4223 df-cnv 4555 df-co 4556 df-fun 5133 |
This theorem is referenced by: funmo 5146 dffun7 5158 funcnvsn 5176 funcnv2 5191 svrelfun 5196 fnres 5247 nfunsn 5463 shftfn 10628 dvfgg 12865 |
Copyright terms: Public domain | W3C validator |