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 1454 | . . 3 | |
2 | nfeu.1 | . . . 4 | |
3 | 2 | a1i 9 | . . 3 |
4 | 1, 3 | nfmod 2031 | . 2 |
5 | 4 | mptru 1352 | 1 |
Colors of variables: wff set class |
Syntax hints: wtru 1344 wnf 1448 wmo 2015 |
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 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 |
This theorem depends on definitions: df-bi 116 df-tru 1346 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 |
This theorem is referenced by: euexex 2099 nfdisjv 3971 reusv1 4436 mosubopt 4669 dffun6f 5201 |
Copyright terms: Public domain | W3C validator |