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

Theorem bj-nnf-exlim 37737
Description: Proof of the closed form of exlimi 2253 from modalK (compare exlimiv 1962). See also bj-sylget2 37579. (Contributed by BJ, 2-Dec-2023.)
Assertion
Ref Expression
bj-nnf-exlim (Ⅎ'𝑥𝜓 → (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 → 𝜓)))

Proof of Theorem bj-nnf-exlim
StepHypRef Expression
1 exim 1866 . 2 (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 → ∃𝑥𝜓))
2 bj-nnfe 37708 . 2 (Ⅎ'𝑥𝜓 → (∃𝑥𝜓 → 𝜓))
31, 2syl9r 79 1 (Ⅎ'𝑥𝜓 → (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 → 𝜓)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4  ∀wal 1567  ∃wex 1811  Ⅎ'wnnf 37703
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-bj-nnf 37704
This theorem is used by:  bj-19.23t  37739
  Copyright terms: Public domain W3C validator