Theorem exmidexmid 4175

Description: EXMID implies that an arbitrary proposition is decidable. That is, EXMID captures the usual meaning of excluded middle when stated in terms of propositions.

To get other propositional statements which are equivalent to excluded middle, combine this with notnotrdc 833, peircedc 904, or condc 843.

(Contributed by Jim Kingdon, 18-Jun-2022.)

Assertion

Ref	Expression
exmidexmid	|- (EXMID -> DECID ph )

Proof of Theorem exmidexmid

Dummy variables x z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrab2 3227	. . 3 |- { z e. { (/) } | ph } C_ { (/) }
2		df-exmid 4174	. . . 4 |- (EXMID <-> A. x ( x C_ { (/) } -> DECID (/) e. x ) )
3		p0ex 4167	. . . . . 6 |- { (/) } e. _V
4	3	rabex 4126	. . . . 5 |- { z e. { (/) } | ph } e. _V
5		sseq1 3165	. . . . . 6 |- ( x = { z e. { (/) } | ph } -> ( x C_ { (/) } <-> { z e. { (/) } | ph } C_ { (/) } ) )
6		eleq2 2230	. . . . . . 7 |- ( x = { z e. { (/) } | ph } -> ( (/) e. x <-> (/) e. { z e. { (/) } | ph } ) )
7	6	dcbid 828	. . . . . 6 |- ( x = { z e. { (/) } | ph } -> (DECID (/) e. x <-> DECID (/) e. { z e. { (/) } | ph } ) )
8	5, 7	imbi12d 233	. . . . 5 |- ( x = { z e. { (/) } | ph } -> ( ( x C_ { (/) } -> DECID (/) e. x ) <-> ( { z e. { (/) } | ph } C_ { (/) } -> DECID (/) e. { z e. { (/) } | ph } ) ) )
9	4, 8	spcv 2820	. . . 4 |- ( A. x ( x C_ { (/) } -> DECID (/) e. x ) -> ( { z e. { (/) } | ph } C_ { (/) } -> DECID (/) e. { z e. { (/) } | ph } ) )
10	2, 9	sylbi 120	. . 3 |- (EXMID -> ( { z e. { (/) } | ph } C_ { (/) } -> DECID (/) e. { z e. { (/) } | ph } ) )
11	1, 10	mpi 15	. 2 |- (EXMID -> DECID (/) e. { z e. { (/) } | ph } )
12		0ex 4109	. . . . 5 |- (/) e. _V
13	12	snid 3607	. . . 4 |- (/) e. { (/) }
14		biidd 171	. . . . 5 |- ( z = (/) -> ( ph <-> ph ) )
15	14	elrab 2882	. . . 4 |- ( (/) e. { z e. { (/) } | ph } <-> ( (/) e. { (/) } /\ ph ) )
16	13, 15	mpbiran 930	. . 3 |- ( (/) e. { z e. { (/) } | ph } <-> ph )
17	16	dcbii 830	. 2 |- (DECID (/) e. { z e. { (/) } | ph } <-> DECID ph )
18	11, 17	sylib 121	1 |- (EXMID -> DECID ph )

Syntax hints:   -> wi 4  DECID wdc 824   A.wal 1341   = wceq 1343   e. wcel 2136   {crab 2448   C_ wss 3116   (/)c0 3409   {csn 3576  EXMIDwem 4173

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-nul 4108  ax-pow 4153

This theorem depends on definitions:  df-bi 116  df-dc 825  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-rab 2453  df-v 2728  df-dif 3118  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-exmid 4174

This theorem is referenced by:  exmidn0m  4180  exmid0el  4183  exmidel  4184  exmidundif  4185  exmidundifim  4186  sbthlemi3  6924  sbthlemi5  6926  sbthlemi6  6927  exmidomniim  7105  exmidfodomrlemim  7157  exmidontriimlem1  7177