| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > df-stab | Unicode version | ||
| Description: Propositions where a
double-negative can be removed are called stable.
See Chapter 2 [Moschovakis] p. 2.
Our notation for stability is a connective STAB which we
place before
the formula in question. For example, STAB (Contributed by David A. Wheeler, 13-Aug-2018.) |
| Ref | Expression |
|---|---|
| df-stab |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wph |
. . 3
| |
| 2 | 1 | wstab 772 |
. 2
|
| 3 | 1 | wn 3 |
. . . 4
|
| 4 | 3 | wn 3 |
. . 3
|
| 5 | 4, 1 | wi 4 |
. 2
|
| 6 | 2, 5 | wb 103 |
1
|
| Colors of variables: wff set class |
| This definition is referenced by: stabnot 774 dcimpstab 785 stabtestimpdc 857 ddifstab 3104 bdstab 10618 |
| Copyright terms: Public domain | W3C validator |