Theorem rabxmdc 3478

Description: Law of excluded middle given decidability, in terms of restricted class abstractions. (Contributed by Jim Kingdon, 2-Aug-2018.)

Assertion

Ref	Expression
rabxmdc	|- ( A. xDECID ph -> A = ( { x e. A | ph } u. { x e. A | -. ph } ) )

Distinct variable group:   x, A

Allowed substitution hint:   ph( x)

Proof of Theorem rabxmdc

Step	Hyp	Ref	Expression
1		exmiddc 837	. . . . . 6 |- (DECID ph -> ( ph \/ -. ph ) )
2	1	a1d 22	. . . . 5 |- (DECID ph -> ( x e. A -> ( ph \/ -. ph ) ) )
3	2	alimi 1466	. . . 4 |- ( A. xDECID ph -> A. x ( x e. A -> ( ph \/ -. ph ) ) )
4		df-ral 2477	. . . 4 |- ( A. x e. A ( ph \/ -. ph ) <-> A. x ( x e. A -> ( ph \/ -. ph ) ) )
5	3, 4	sylibr 134	. . 3 |- ( A. xDECID ph -> A. x e. A ( ph \/ -. ph ) )
6		rabid2 2671	. . 3 |- ( A = { x e. A | ( ph \/ -. ph ) } <-> A. x e. A ( ph \/ -. ph ) )
7	5, 6	sylibr 134	. 2 |- ( A. xDECID ph -> A = { x e. A | ( ph \/ -. ph ) } )
8		unrab 3430	. 2 |- ( { x e. A | ph } u. { x e. A | -. ph } ) = { x e. A | ( ph \/ -. ph ) }
9	7, 8	eqtr4di 2244	1 |- ( A. xDECID ph -> A = ( { x e. A | ph } u. { x e. A | -. ph } ) )

Syntax hints:   -. wn 3   -> wi 4   \/ wo 709  DECID wdc 835   A.wal 1362   = wceq 1364   e. wcel 2164   A.wral 2472   {crab 2476   u. cun 3151

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-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-ext 2175

This theorem depends on definitions:  df-bi 117  df-dc 836  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rab 2481  df-v 2762  df-un 3157

This theorem is referenced by: (None)