Theorem dcextest 4595

Description: If it is decidable whether { x | ph } is a set, then -. ph is decidable (where x does not occur in ph). From this fact, we can deduce (outside the formal system, since we cannot quantify over classes) that if it is decidable whether any class is a set, then "weak excluded middle" (that is, any negated proposition -. ph is decidable) holds. (Contributed by Jim Kingdon, 3-Jul-2022.)

Hypothesis

Ref	Expression
dcextest.ex	|- DECID { x | ph } e. _V

Assertion

Ref	Expression
dcextest	|- DECID -. ph

Distinct variable group:   ph, x

Proof of Theorem dcextest

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dcextest.ex	. . . 4 |- DECID { x | ph } e. _V
2		exmiddc 837	. . . 4 |- (DECID { x | ph } e. _V -> ( { x | ph } e. _V \/ -. { x | ph } e. _V ) )
3	1, 2	ax-mp 5	. . 3 |- ( { x | ph } e. _V \/ -. { x | ph } e. _V )
4		vprc 4150	. . . . . . 7 |- -. _V e. _V
5		df-v 2754	. . . . . . . . 9 |- _V = { x | x = x }
6		equid 1712	. . . . . . . . . . 11 |- x = x
7		pm5.1im 173	. . . . . . . . . . 11 |- ( x = x -> ( ph -> ( x = x <-> ph ) ) )
8	6, 7	ax-mp 5	. . . . . . . . . 10 |- ( ph -> ( x = x <-> ph ) )
9	8	abbidv 2307	. . . . . . . . 9 |- ( ph -> { x | x = x } = { x | ph } )
10	5, 9	eqtr2id 2235	. . . . . . . 8 |- ( ph -> { x | ph } = _V )
11	10	eleq1d 2258	. . . . . . 7 |- ( ph -> ( { x | ph } e. _V <-> _V e. _V ) )
12	4, 11	mtbiri 676	. . . . . 6 |- ( ph -> -. { x | ph } e. _V )
13	12	con2i 628	. . . . 5 |- ( { x | ph } e. _V -> -. ph )
14		vex 2755	. . . . . . . . . 10 |- y e. _V
15		biidd 172	. . . . . . . . . 10 |- ( x = y -> ( ph <-> ph ) )
16	14, 15	elab 2896	. . . . . . . . 9 |- ( y e. { x | ph } <-> ph )
17	16	notbii 669	. . . . . . . 8 |- ( -. y e. { x | ph } <-> -. ph )
18	17	biimpri 133	. . . . . . 7 |- ( -. ph -> -. y e. { x | ph } )
19	18	eq0rdv 3482	. . . . . 6 |- ( -. ph -> { x | ph } = (/) )
20		0ex 4145	. . . . . 6 |- (/) e. _V
21	19, 20	eqeltrdi 2280	. . . . 5 |- ( -. ph -> { x | ph } e. _V )
22	13, 21	impbii 126	. . . 4 |- ( { x | ph } e. _V <-> -. ph )
23	22	notbii 669	. . . 4 |- ( -. { x | ph } e. _V <-> -. -. ph )
24	22, 23	orbi12i 765	. . 3 |- ( ( { x | ph } e. _V \/ -. { x | ph } e. _V ) <-> ( -. ph \/ -. -. ph ) )
25	3, 24	mpbi 145	. 2 |- ( -. ph \/ -. -. ph )
26		df-dc 836	. 2 |- (DECID -. ph <-> ( -. ph \/ -. -. ph ) )
27	25, 26	mpbir 146	1 |- DECID -. ph

Syntax hints:   -. wn 3   -> wi 4   <-> wb 105   \/ wo 709  DECID wdc 835   e. wcel 2160   {cab 2175   _Vcvv 2752   (/)c0 3437

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-nul 4144

This theorem depends on definitions:  df-bi 117  df-dc 836  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-v 2754  df-dif 3146  df-in 3150  df-ss 3157  df-nul 3438

This theorem is referenced by: (None)