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 corresponds to " is stable". (Contributed by David A. Wheeler, 13-Aug-2018.) |
Ref | Expression |
---|---|
df-stab | STAB |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wph | . . 3 | |
2 | 1 | wstab 800 | . 2 STAB |
3 | 1 | wn 3 | . . . 4 |
4 | 3 | wn 3 | . . 3 |
5 | 4, 1 | wi 4 | . 2 |
6 | 2, 5 | wb 104 | 1 STAB |
Colors of variables: wff set class |
This definition is referenced by: stbid 802 stabnot 803 dcstab 814 stdcndc 815 stdcndcOLD 816 stdcn 817 const 822 imanst 858 ddifstab 3178 cnstab 8375 bj-trst 12878 bj-fast 12879 bj-nnbist 12880 bj-stim 12881 bj-stan 12882 bj-stand 12883 bj-stal 12884 bj-pm2.18st 12885 bdstab 12952 exmid1stab 13122 subctctexmid 13123 |
Copyright terms: Public domain | W3C validator |