Theorem alexdc 1598

Description: Theorem 19.6 of [Margaris] p. 89, given a decidability condition. The forward direction holds for all propositions, as seen at alexim 1624. (Contributed by Jim Kingdon, 2-Jun-2018.)

Assertion

Ref	Expression
alexdc	⊢ (∀𝑥DECID 𝜑 → (∀𝑥𝜑 ↔ ¬ ∃𝑥 ¬ 𝜑))

Proof of Theorem alexdc

Step	Hyp	Ref	Expression
1		nfa1 1521	. . 3 ⊢ Ⅎ𝑥∀𝑥DECID 𝜑
2		notnotbdc 857	. . . 4 ⊢ (DECID 𝜑 → (𝜑 ↔ ¬ ¬ 𝜑))
3	2	sps 1517	. . 3 ⊢ (∀𝑥DECID 𝜑 → (𝜑 ↔ ¬ ¬ 𝜑))
4	1, 3	albid 1594	. 2 ⊢ (∀𝑥DECID 𝜑 → (∀𝑥𝜑 ↔ ∀𝑥 ¬ ¬ 𝜑))
5		alnex 1475	. 2 ⊢ (∀𝑥 ¬ ¬ 𝜑 ↔ ¬ ∃𝑥 ¬ 𝜑)
6	4, 5	syl6bb 195	1 ⊢ (∀𝑥DECID 𝜑 → (∀𝑥𝜑 ↔ ¬ ∃𝑥 ¬ 𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 104  DECID wdc 819  ∀wal 1329  ∃wex 1468

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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-gen 1425  ax-ie2 1470  ax-4 1487  ax-ial 1514

This theorem depends on definitions:  df-bi 116  df-dc 820  df-tru 1334  df-fal 1337  df-nf 1437

This theorem is referenced by: (None)