Theorem exmidexmid 4333

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 855, peircedc 926, or condc 865.

(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 3333	. . 3 |- { z e. { (/) } | ph } C_ { (/) }
2		df-exmid 4332	. . . 4 |- (EXMID <-> A. x ( x C_ { (/) } -> DECID (/) e. x ) )
3		p0ex 4325	. . . . . 6 |- { (/) } e. _V
4	3	rabex 4280	. . . . 5 |- { z e. { (/) } | ph } e. _V
5		sseq1 3271	. . . . . 6 |- ( x = { z e. { (/) } | ph } -> ( x C_ { (/) } <-> { z e. { (/) } | ph } C_ { (/) } ) )
6		eleq2 2302	. . . . . . 7 |- ( x = { z e. { (/) } | ph } -> ( (/) e. x <-> (/) e. { z e. { (/) } | ph } ) )
7	6	dcbid 850	. . . . . 6 |- ( x = { z e. { (/) } | ph } -> (DECID (/) e. x <-> DECID (/) e. { z e. { (/) } | ph } ) )
8	5, 7	imbi12d 234	. . . . 5 |- ( x = { z e. { (/) } | ph } -> ( ( x C_ { (/) } -> DECID (/) e. x ) <-> ( { z e. { (/) } | ph } C_ { (/) } -> DECID (/) e. { z e. { (/) } | ph } ) ) )
9	4, 8	spcv 2919	. . . 4 |- ( A. x ( x C_ { (/) } -> DECID (/) e. x ) -> ( { z e. { (/) } | ph } C_ { (/) } -> DECID (/) e. { z e. { (/) } | ph } ) )
10	2, 9	sylbi 121	. . 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 4260	. . . . 5 |- (/) e. _V
13	12	snid 3740	. . . 4 |- (/) e. { (/) }
14		biidd 172	. . . . 5 |- ( z = (/) -> ( ph <-> ph ) )
15	14	elrab 2982	. . . 4 |- ( (/) e. { z e. { (/) } | ph } <-> ( (/) e. { (/) } /\ ph ) )
16	13, 15	mpbiran 953	. . 3 |- ( (/) e. { z e. { (/) } | ph } <-> ph )
17	16	dcbii 852	. 2 |- (DECID (/) e. { z e. { (/) } | ph } <-> DECID ph )
18	11, 17	sylib 122	1 |- (EXMID -> DECID ph )

This proof depends on syntax axioms:   -> wi 4  DECID wdc 846   A.wal 1400   = wceq 1402   e. wcel 2209   {crab 2532   C_ wss 3220   (/)c0 3520   {csn 3709  EXMIDwem 4331

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311

This proof depends on definitions:  df-bi 117  df-dc 847  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rab 2537  df-v 2823  df-dif 3222  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-exmid 4332

This theorem is used by:  exmidn0m  4338  exmid0el  4341  exmidel  4342  exmidundif  4343  exmidundifim  4344  exmidpw2en  7219  exmidssfi  7246  sbthlemi3  7276  sbthlemi5  7278  sbthlemi6  7279  exmidomniim  7481  exmidfodomrlemim  7553  exmidontriimlem1  7577  exmidapne  7626  pw1dceq  17035  exmidnotnotr  17036  exmidcon  17037  exmidpeirce  17038