Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfmod | Unicode version |
Description: Bound-variable hypothesis builder for "at most one." (Contributed by Mario Carneiro, 14-Nov-2016.) |
Ref | Expression |
---|---|
nfeud.1 | |
nfeud.2 |
Ref | Expression |
---|---|
nfmod |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-mo 1981 | . 2 | |
2 | nfeud.1 | . . . 4 | |
3 | nfeud.2 | . . . 4 | |
4 | 2, 3 | nfexd 1719 | . . 3 |
5 | 2, 3 | nfeud 1993 | . . 3 |
6 | 4, 5 | nfimd 1549 | . 2 |
7 | 1, 6 | nfxfrd 1436 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wnf 1421 wex 1453 weu 1977 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: nfmo 1997 |
Copyright terms: Public domain | W3C validator |