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

Theorem eximal 1706
Description: A utility theorem. An interesting case is when the same formula is substituted for both 𝜑 and 𝜓, since then both implications express a type of non-freeness. See also alimex 1757. (Contributed by BJ, 12-May-2019.)
Assertion
Ref Expression
eximal ((∃𝑥𝜑𝜓) ↔ (¬ 𝜓 → ∀𝑥 ¬ 𝜑))

Proof of Theorem eximal
StepHypRef Expression
1 df-ex 1704 . . 3 (∃𝑥𝜑 ↔ ¬ ∀𝑥 ¬ 𝜑)
21imbi1i 339 . 2 ((∃𝑥𝜑𝜓) ↔ (¬ ∀𝑥 ¬ 𝜑𝜓))
3 con1b 348 . 2 ((¬ ∀𝑥 ¬ 𝜑𝜓) ↔ (¬ 𝜓 → ∀𝑥 ¬ 𝜑))
42, 3bitri 264 1 ((∃𝑥𝜑𝜓) ↔ (¬ 𝜓 → ∀𝑥 ¬ 𝜑))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wal 1480  wex 1703
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 197  df-ex 1704
This theorem is referenced by:  ax5e  1840  19.23t  2078  19.23tOLD  2217  xfree2  29288  bj-exalims  32597
  Copyright terms: Public domain W3C validator