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

Theorem axc7e 2348
Description: Abbreviated version of axc7 2347 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 2180 . 2 (∃𝑥∀𝑥𝜑 → ∀𝑥𝜑)
2119.21bi 2225 1 (∃𝑥∀𝑥𝜑 → 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∀wal 1567  ∃wex 1811
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-12 2212
This proof depends on definitions:  df-bi 210  df-ex 1812
This theorem is used by:  bj-19.12  37717  bj-axc10  37787
  Copyright terms: Public domain W3C validator