Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > dffn2 | Unicode version |
Description: Any function is a mapping into . (Contributed by NM, 31-Oct-1995.) (Proof shortened by Andrew Salmon, 17-Sep-2011.) |
Ref | Expression |
---|---|
dffn2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssv 3019 | . . 3 | |
2 | 1 | biantru 296 | . 2 |
3 | df-f 4926 | . 2 | |
4 | 2, 3 | bitr4i 185 | 1 |
Colors of variables: wff set class |
Syntax hints: wa 102 wb 103 cvv 2601 wss 2973 crn 4364 wfn 4917 wf 4918 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-11 1437 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-v 2603 df-in 2979 df-ss 2986 df-f 4926 |
This theorem is referenced by: f1cnvcnv 5120 fcoconst 5355 fnressn 5370 1stcof 5810 2ndcof 5811 fnmpt2 5848 tposfn 5911 tfrlemibfn 5965 |
Copyright terms: Public domain | W3C validator |