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 𝑥 = 𝑦 corresponds to "𝑥 = 𝑦 is stable".

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

Assertion

Ref	Expression
df-stab	⊢ (STAB 𝜑 ↔ (¬ ¬ 𝜑 → 𝜑))

Detailed syntax breakdown of Definition df-stab

Step	Hyp	Ref	Expression
1		wph	. . 3 wff 𝜑
2	1	wstab 835	. 2 wff STAB 𝜑
3	1	wn 3	. . . 4 wff ¬ 𝜑
4	3	wn 3	. . 3 wff ¬ ¬ 𝜑
5	4, 1	wi 4	. 2 wff (¬ ¬ 𝜑 → 𝜑)
6	2, 5	wb 105	1 wff (STAB 𝜑 ↔ (¬ ¬ 𝜑 → 𝜑))

This definition is referenced by:  stbid  837  stabnot  838  dcstab  849  stdcndc  850  stdcndcOLD  851  stdcn  852  const  857  imanst  893  ddifstab  3337  exmid1stab  4296  2omotap  7471  bj-trst  16285  bj-fast  16287  bj-nnbist  16290  bj-stim  16292  bj-stan  16293  bj-stand  16294  bj-stal  16295  bj-pm2.18st  16296  bj-con1st  16297  bdstab  16372  subctctexmid  16551