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 1427 | . . 3 | |
2 | nfeu.1 | . . . 4 | |
3 | 2 | a1i 9 | . . 3 |
4 | 1, 3 | nfmod 1994 | . 2 |
5 | 4 | mptru 1325 | 1 |
Colors of variables: wff set class |
Syntax hints: wtru 1317 wnf 1421 wmo 1978 |
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 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 |
This theorem depends on definitions: df-bi 116 df-tru 1319 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 |
This theorem is referenced by: euexex 2062 nfdisjv 3888 reusv1 4349 mosubopt 4574 dffun6f 5106 |
Copyright terms: Public domain | W3C validator |