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

Theorem axc7e 2349
Description: Abbreviated version of axc7 2348 using the existential quantifier. Corresponds to the dual of Axiom (B) of modal logic. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 8-Jul-2022.)
Assertion
Ref Expression
axc7e (∃𝑥𝑥𝜑𝜑)

Proof of Theorem axc7e
StepHypRef Expression
1 hbe1a 2177 . 2 (∃𝑥𝑥𝜑 → ∀𝑥𝜑)
2119.21bi 2223 1 (∃𝑥𝑥𝜑𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1557  wex 1798
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-10 2174  ax-12 2211
This theorem depends on definitions:  df-bi 209  df-ex 1799
This theorem is referenced by:  bj-19.12  37162  bj-axc10  37232
  Copyright terms: Public domain W3C validator