MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  raln Structured version   Visualization version   GIF version

Theorem raln 2974
Description: Restricted universally quantified negation expressed as a universally quantified negation. (Contributed by BJ, 16-Jul-2021.)
Assertion
Ref Expression
raln (∀𝑥𝐴 ¬ 𝜑 ↔ ∀𝑥 ¬ (𝑥𝐴𝜑))

Proof of Theorem raln
StepHypRef Expression
1 df-ral 2901 . 2 (∀𝑥𝐴 ¬ 𝜑 ↔ ∀𝑥(𝑥𝐴 → ¬ 𝜑))
2 imnang 1758 . 2 (∀𝑥(𝑥𝐴 → ¬ 𝜑) ↔ ∀𝑥 ¬ (𝑥𝐴𝜑))
31, 2bitri 263 1 (∀𝑥𝐴 ¬ 𝜑 ↔ ∀𝑥 ¬ (𝑥𝐴𝜑))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 195  wa 383  wal 1473  wcel 1977  wral 2896
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728
This theorem depends on definitions:  df-bi 196  df-an 385  df-ral 2901
This theorem is referenced by:  ralnex  2975  rabeq0  3911
  Copyright terms: Public domain W3C validator