Theorem nf4r 1601

Description: If 𝜑 is always true or always false, then variable 𝑥 is effectively not free in 𝜑. The converse holds given a decidability condition, as seen at nf4dc 1600. (Contributed by Jim Kingdon, 21-Jul-2018.)

Assertion

Ref	Expression
nf4r	⊢ ((∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑) → Ⅎ𝑥𝜑)

Proof of Theorem nf4r

Step	Hyp	Ref	Expression
1		orcom 679	. . 3 ⊢ ((¬ ∃𝑥𝜑 ∨ ∀𝑥𝜑) ↔ (∀𝑥𝜑 ∨ ¬ ∃𝑥𝜑))
2		alnex 1428	. . . 4 ⊢ (∀𝑥 ¬ 𝜑 ↔ ¬ ∃𝑥𝜑)
3	2	orbi2i 711	. . 3 ⊢ ((∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑) ↔ (∀𝑥𝜑 ∨ ¬ ∃𝑥𝜑))
4	1, 3	bitr4i 185	. 2 ⊢ ((¬ ∃𝑥𝜑 ∨ ∀𝑥𝜑) ↔ (∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑))
5		imorr 830	. . 3 ⊢ ((¬ ∃𝑥𝜑 ∨ ∀𝑥𝜑) → (∃𝑥𝜑 → ∀𝑥𝜑))
6		nf2 1598	. . 3 ⊢ (Ⅎ𝑥𝜑 ↔ (∃𝑥𝜑 → ∀𝑥𝜑))
7	5, 6	sylibr 132	. 2 ⊢ ((¬ ∃𝑥𝜑 ∨ ∀𝑥𝜑) → Ⅎ𝑥𝜑)
8	4, 7	sylbir 133	1 ⊢ ((∀𝑥𝜑 ∨ ∀𝑥 ¬ 𝜑) → Ⅎ𝑥𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 661  ∀wal 1282  Ⅎwnf 1389  ∃wex 1421

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 576  ax-in2 577  ax-io 662  ax-5 1376  ax-gen 1378  ax-ie2 1423  ax-4 1440  ax-ial 1467

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-fal 1290  df-nf 1390

This theorem is referenced by: (None)