Definition df-stab 836

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 x = y corresponds to " x = y is stable".

(Contributed by David A. Wheeler, 13-Aug-2018.)

Assertion

Ref	Expression
df-stab	|- (STAB ph <-> ( -. -. ph -> ph ) )

Detailed syntax breakdown of Definition df-stab

Step	Hyp	Ref	Expression
1		wph	. . 3 wff ph
2	1	wstab 835	. 2 wff STAB ph
3	1	wn 3	. . . 4 wff -. ph
4	3	wn 3	. . 3 wff -. -. ph
5	4, 1	wi 4	. 2 wff ( -. -. ph -> ph )
6	2, 5	wb 105	1 wff (STAB ph <-> ( -. -. ph -> ph ) )

This definition is referenced by:  stbid  837  stabnot  838  dcstab  849  stdcndc  850  stdcndcOLD  851  stdcn  852  const  857  imanst  893  ddifstab  3336  exmid1stab  4292  2omotap  7456  bj-trst  16158  bj-fast  16160  bj-nnbist  16163  bj-stim  16165  bj-stan  16166  bj-stand  16167  bj-stal  16168  bj-pm2.18st  16169  bj-con1st  16170  bdstab  16245  subctctexmid  16425