Theorem dfexdc 1494

Description: Defining E. x ph given decidability. It is common in classical logic to define E. x ph as -. A. x -. ph but in intuitionistic logic without a decidability condition, that is only an implication not an equivalence, as seen at exalim 1495. (Contributed by Jim Kingdon, 15-Mar-2018.)

Assertion

Ref	Expression
dfexdc	|- (DECID E. x ph -> ( E. x ph <-> -. A. x -. ph ) )

Proof of Theorem dfexdc

Step	Hyp	Ref	Expression
1		alnex 1492	. . 3 |- ( A. x -. ph <-> -. E. x ph )
2	1	a1i 9	. 2 |- (DECID E. x ph -> ( A. x -. ph <-> -. E. x ph ) )
3	2	con2biidc 874	1 |- (DECID E. x ph -> ( E. x ph <-> -. A. x -. ph ) )

Syntax hints:   -. wn 3   -> wi 4   <-> wb 104  DECID wdc 829   A.wal 1346   E.wex 1485

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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-gen 1442  ax-ie2 1487

This theorem depends on definitions:  df-bi 116  df-dc 830  df-tru 1351  df-fal 1354

This theorem is referenced by:  dfrex2dc  2461