Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-eximcom Structured version   Visualization version   GIF version

Theorem bj-eximcom 37101
Description: A commuted form of exim 1857 which is sometimes posited as an axiom in instuitionistic modal logic. Forward implication of 19.35 1900. Its converse is not intuitionistic. (Contributed by BJ, 9-Dec-2023.)
Assertion
Ref Expression
bj-eximcom (∃𝑥(𝜑𝜓) → (∀𝑥𝜑 → ∃𝑥𝜓))

Proof of Theorem bj-eximcom
StepHypRef Expression
1 pm2.27 43 . . 3 (𝜑 → ((𝜑𝜓) → 𝜓))
21aleximi 1855 . 2 (∀𝑥𝜑 → (∃𝑥(𝜑𝜓) → ∃𝑥𝜓))
32com12 33 1 (∃𝑥(𝜑𝜓) → (∀𝑥𝜑 → ∃𝑥𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1561  wex 1802
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832
This theorem depends on definitions:  df-bi 210  df-ex 1803
This theorem is referenced by:  bj-nfimt  37107  bj-spimnfe  37108  bj-spimenfa  37109  bj-cbvalimdlem  37113  bj-cbveximdlem  37114  bj-wnf2  37207  bj-snsetex  37460  bj-axseprep  37571
  Copyright terms: Public domain W3C validator