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

Theorem exanali 1892
Description: A transformation of quantifiers and logical connectives. (Contributed by NM, 25-Mar-1996.) (Proof shortened by Wolf Lammen, 4-Sep-2014.)
Assertion
Ref Expression
exanali (∃𝑥(𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑥(𝜑 → 𝜓))

Proof of Theorem exanali
StepHypRef Expression
1 annim 409 . . 3 ((𝜑 ∧ ¬ 𝜓) ↔ ¬ (𝜑 → 𝜓))
21exbii 1881 . 2 (∃𝑥(𝜑 ∧ ¬ 𝜓) ↔ ∃𝑥 ¬ (𝜑 → 𝜓))
3 exnal 1860 . 2 (∃𝑥 ¬ (𝜑 → 𝜓) ↔ ¬ ∀𝑥(𝜑 → 𝜓))
42, 3bitri 278 1 (∃𝑥(𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑥(𝜑 → 𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812
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
This theorem is used by:  gencbval  3512  dfss6  3903  nss  3977  nssss  5430  brprcneu  6906  brprcneuALT  6907  marypha1lem  9462  reclem2pr  11172  mirimanofffr  36670  dftr6  36731  brsset  36866  dfon3  36869  dffun10  36891  elfuns  36892  ecinn0  39551  ax12indn  40266  expandrexn  45597  vk15.4j  45832  vk15.4jVD  46217
  Copyright terms: Public domain W3C validator