| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nfmo | Unicode version | ||
| Description: Bound-variable hypothesis builder for "at most one". (Contributed by NM, 9-Mar-1995.) |
| Ref | Expression |
|---|---|
| nfeu.1 |
|
| Ref | Expression |
|---|---|
| nfmo |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nftru 1519 |
. . 3
| |
| 2 | nfeu.1 |
. . . 4
| |
| 3 | 2 | a1i 9 |
. . 3
|
| 4 | 1, 3 | nfmod 2103 |
. 2
|
| 5 | 4 | mptru 1411 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 |
| This theorem is referenced by: euexex 2172 nfdisjv 4113 reusv1 4599 mosubopt 4835 dffun6f 5385 |
| Copyright terms: Public domain | W3C validator |