| 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 1480 |
. . 3
| |
| 2 | nfeu.1 |
. . . 4
| |
| 3 | 2 | a1i 9 |
. . 3
|
| 4 | 1, 3 | nfmod 2062 |
. 2
|
| 5 | 4 | mptru 1373 |
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 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 |
| This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 |
| This theorem is referenced by: euexex 2130 nfdisjv 4022 reusv1 4493 mosubopt 4728 dffun6f 5271 |
| Copyright terms: Public domain | W3C validator |