Theorem bj-d0clsepcl 16288

Description: Δ₀-classical logic and separation implies classical logic. (Contributed by BJ, 2-Jan-2020.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-d0clsepcl	|- DECID ph

Proof of Theorem bj-d0clsepcl

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

Step	Hyp	Ref	Expression
1		0ex 4211	. . . . . . 7 |- (/) e. _V
2	1	bj-snex 16276	. . . . . 6 |- { (/) } e. _V
3	2	zfauscl 4204	. . . . 5 |- E. a A. x ( x e. a <-> ( x e. { (/) } /\ ph ) )
4		eleq1 2292	. . . . . . 7 |- ( x = (/) -> ( x e. a <-> (/) e. a ) )
5		eleq1 2292	. . . . . . . 8 |- ( x = (/) -> ( x e. { (/) } <-> (/) e. { (/) } ) )
6	5	anbi1d 465	. . . . . . 7 |- ( x = (/) -> ( ( x e. { (/) } /\ ph ) <-> ( (/) e. { (/) } /\ ph ) ) )
7	4, 6	bibi12d 235	. . . . . 6 |- ( x = (/) -> ( ( x e. a <-> ( x e. { (/) } /\ ph ) ) <-> ( (/) e. a <-> ( (/) e. { (/) } /\ ph ) ) ) )
8	1, 7	spcv 2897	. . . . 5 |- ( A. x ( x e. a <-> ( x e. { (/) } /\ ph ) ) -> ( (/) e. a <-> ( (/) e. { (/) } /\ ph ) ) )
9	3, 8	eximii 1648	. . . 4 |- E. a ( (/) e. a <-> ( (/) e. { (/) } /\ ph ) )
10	1	snid 3697	. . . . . . . 8 |- (/) e. { (/) }
11	10	biantrur 303	. . . . . . 7 |- ( ph <-> ( (/) e. { (/) } /\ ph ) )
12	11	bicomi 132	. . . . . 6 |- ( ( (/) e. { (/) } /\ ph ) <-> ph )
13	12	bibi2i 227	. . . . 5 |- ( ( (/) e. a <-> ( (/) e. { (/) } /\ ph ) ) <-> ( (/) e. a <-> ph ) )
14	13	exbii 1651	. . . 4 |- ( E. a ( (/) e. a <-> ( (/) e. { (/) } /\ ph ) ) <-> E. a ( (/) e. a <-> ph ) )
15	9, 14	mpbi 145	. . 3 |- E. a ( (/) e. a <-> ph )
16		bj-bd0el 16231	. . . . 5 |- BOUNDED (/) e. a
17	16	ax-bj-d0cl 16287	. . . 4 |- DECID (/) e. a
18		dcbiit 844	. . . 4 |- ( ( (/) e. a <-> ph ) -> (DECID (/) e. a <-> DECID ph ) )
19	17, 18	mpbii 148	. . 3 |- ( ( (/) e. a <-> ph ) -> DECID ph )
20	15, 19	eximii 1648	. 2 |- E. aDECID ph
21		bj-ex 16126	. 2 |- ( E. aDECID ph -> DECID ph )
22	20, 21	ax-mp 5	1 |- DECID ph

Syntax hints:   /\ wa 104   <-> wb 105  DECID wdc 839   A.wal 1393   = wceq 1395   E.wex 1538   e. wcel 2200   (/)c0 3491   {csn 3666

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-nul 4210  ax-pr 4293  ax-bd0 16176  ax-bdim 16177  ax-bdor 16179  ax-bdn 16180  ax-bdal 16181  ax-bdex 16182  ax-bdeq 16183  ax-bdsep 16247  ax-bj-d0cl 16287

This theorem depends on definitions:  df-bi 117  df-dc 840  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-sn 3672  df-pr 3673  df-bdc 16204

This theorem is referenced by: (None)