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

Theorem dfral2 3113
Description: Relationship between restricted universal and existential quantifiers. (Contributed by NM, 21-Jan-1997.) Allow shortening of rexnal 3114. (Revised by Wolf Lammen, 9-Dec-2019.)
Assertion
Ref Expression
dfral2 (∀𝑥𝐴 𝜑 ↔ ¬ ∃𝑥𝐴 ¬ 𝜑)

Proof of Theorem dfral2
StepHypRef Expression
1 notnotb 318 . . 3 (𝜑 ↔ ¬ ¬ 𝜑)
21ralbii 3108 . 2 (∀𝑥𝐴 𝜑 ↔ ∀𝑥𝐴 ¬ ¬ 𝜑)
3 ralnex 3088 . 2 (∀𝑥𝐴 ¬ ¬ 𝜑 ↔ ¬ ∃𝑥𝐴 ¬ 𝜑)
42, 3bitri 278 1 (∀𝑥𝐴 𝜑 ↔ ¬ ∃𝑥𝐴 ¬ 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wb 209  wral 3076  wrex 3086
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-ral 3077  df-rex 3087
This theorem is used by:  rexnal  3114  rab0  4335  boxcutc  8948  infssuni  9313  ac6n  10487  indstr  12965  trfil3  24114  nosepon  27901  noinfbnd1lem4  27962  cuteq1  28082  tglowdim2ln  28999  nmobndseqi  31260  stri  32738  hstri  32746  reprinfz1  35130  bnj1204  35521  onvf1odlem4  35703  fvineqsneq  38166  poimirlem1  38370  n0elqs  39080
  Copyright terms: Public domain W3C validator