Theorem nnral 2487

Description: The double negation of a universal quantification implies the universal quantification of the double negation. Restricted quantifier version of nnal 1663. (Contributed by Jim Kingdon, 1-Aug-2024.)

Assertion

Ref	Expression
nnral	⊢ (¬ ¬ ∀𝑥 ∈ 𝐴 𝜑 → ∀𝑥 ∈ 𝐴 ¬ ¬ 𝜑)

Proof of Theorem nnral

Step	Hyp	Ref	Expression
1		rexnalim 2486	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝜑 → ¬ ∀𝑥 ∈ 𝐴 𝜑)
2	1	con3i 633	. 2 ⊢ (¬ ¬ ∀𝑥 ∈ 𝐴 𝜑 → ¬ ∃𝑥 ∈ 𝐴 ¬ 𝜑)
3		ralnex 2485	. 2 ⊢ (∀𝑥 ∈ 𝐴 ¬ ¬ 𝜑 ↔ ¬ ∃𝑥 ∈ 𝐴 ¬ 𝜑)
4	2, 3	sylibr 134	1 ⊢ (¬ ¬ ∀𝑥 ∈ 𝐴 𝜑 → ∀𝑥 ∈ 𝐴 ¬ ¬ 𝜑)

Syntax hints:  ¬ wn 3   → wi 4  ∀wral 2475  ∃wrex 2476

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-in1 615  ax-in2 616  ax-5 1461  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-4 1524  ax-17 1540  ax-ial 1548

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-fal 1370  df-nf 1475  df-ral 2480  df-rex 2481

This theorem is referenced by:  onntri13  7307  onntri24  7311