Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > funoprab | Structured version Visualization version Unicode version |
Description: "At most one" is a sufficient condition for an operation class abstraction to be a function. (Contributed by NM, 17-Mar-1995.) |
Ref | Expression |
---|---|
funoprab.1 |
Ref | Expression |
---|---|
funoprab |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | funoprab.1 | . . 3 | |
2 | 1 | gen2 1723 | . 2 |
3 | funoprabg 6759 | . 2 | |
4 | 2, 3 | ax-mp 5 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wal 1481 wmo 2471 wfun 5882 coprab 6651 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-br 4654 df-opab 4713 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-fun 5890 df-oprab 6654 |
This theorem is referenced by: mpt2fun 6762 ovidig 6778 ovigg 6781 oprabex 7156 axaddf 9966 axmulf 9967 funtransport 32138 funray 32247 funline 32249 |
Copyright terms: Public domain | W3C validator |