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 3089 | . . 3 | |
2 | 1 | biantru 300 | . 2 |
3 | df-f 5097 | . 2 | |
4 | 2, 3 | bitr4i 186 | 1 |
Colors of variables: wff set class |
Syntax hints: wa 103 wb 104 cvv 2660 wss 3041 crn 4510 wfn 5088 wf 5089 |
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-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-11 1469 ax-4 1472 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-nf 1422 df-sb 1721 df-clab 2104 df-cleq 2110 df-clel 2113 df-v 2662 df-in 3047 df-ss 3054 df-f 5097 |
This theorem is referenced by: f1cnvcnv 5309 fcoconst 5559 fnressn 5574 1stcof 6029 2ndcof 6030 fnmpo 6068 tposfn 6138 tfrlemibfn 6193 tfr1onlembfn 6209 mptelixpg 6596 |
Copyright terms: Public domain | W3C validator |