ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nf4dc GIF version

Theorem nf4dc 1605
Description: Variable 𝑥 is effectively not free in 𝜑 iff 𝜑 is always true or always false, given a decidability condition. The reverse direction, nf4r 1606, holds for all propositions. (Contributed by Jim Kingdon, 21-Jul-2018.)
Assertion
Ref Expression
nf4dc (DECID𝑥𝜑 → (Ⅎ𝑥𝜑 ↔ (∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑)))

Proof of Theorem nf4dc
StepHypRef Expression
1 nf2 1603 . . 3 (Ⅎ𝑥𝜑 ↔ (∃𝑥𝜑 → ∀𝑥𝜑))
2 imordc 834 . . 3 (DECID𝑥𝜑 → ((∃𝑥𝜑 → ∀𝑥𝜑) ↔ (¬ ∃𝑥𝜑 ∨ ∀𝑥𝜑)))
31, 2syl5bb 190 . 2 (DECID𝑥𝜑 → (Ⅎ𝑥𝜑 ↔ (¬ ∃𝑥𝜑 ∨ ∀𝑥𝜑)))
4 orcom 682 . . 3 ((¬ ∃𝑥𝜑 ∨ ∀𝑥𝜑) ↔ (∀𝑥𝜑 ∨ ¬ ∃𝑥𝜑))
5 alnex 1433 . . . 4 (∀𝑥 ¬ 𝜑 ↔ ¬ ∃𝑥𝜑)
65orbi2i 714 . . 3 ((∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑) ↔ (∀𝑥𝜑 ∨ ¬ ∃𝑥𝜑))
74, 6bitr4i 185 . 2 ((¬ ∃𝑥𝜑 ∨ ∀𝑥𝜑) ↔ (∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑))
83, 7syl6bb 194 1 (DECID𝑥𝜑 → (Ⅎ𝑥𝜑 ↔ (∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wb 103  wo 664  DECID wdc 780  wal 1287  wnf 1394  wex 1426
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-gen 1383  ax-ie2 1428  ax-4 1445  ax-ial 1472
This theorem depends on definitions:  df-bi 115  df-dc 781  df-tru 1292  df-fal 1295  df-nf 1395
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator