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

Theorem exintr 1911
Description: Introduce a conjunct in the scope of an existential quantifier. (Contributed by NM, 11-Aug-1993.) (Proof shortened by BJ, 16-Sep-2022.)
Assertion
Ref Expression
exintr (∀𝑥(𝜑𝜓) → (∃𝑥𝜑 → ∃𝑥(𝜑𝜓)))

Proof of Theorem exintr
StepHypRef Expression
1 ancl 552 . 2 ((𝜑𝜓) → (𝜑 → (𝜑𝜓)))
21aleximi 1851 1 (∀𝑥(𝜑𝜓) → (∃𝑥𝜑 → ∃𝑥(𝜑𝜓)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  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
This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1799
This theorem is referenced by:  equs4v  2019  equs4  2446  eupickbi  2662  barbarilem  2693  r19.2z  4452  pwpw0  4770  bnj1023  35040  bnj1109  35046  pm10.55  44909
  Copyright terms: Public domain W3C validator