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

Theorem exintr 1925
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 554 . 2 ((𝜑𝜓) → (𝜑 → (𝜑𝜓)))
21aleximi 1865 1 (∀𝑥(𝜑𝜓) → (∃𝑥𝜑 → ∃𝑥(𝜑𝜓)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  wal 1568  wex 1812
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813
This theorem is used by:  equs4v  2033  equs4  2451  eupickbi  2667  barbarilem  2698  r19.2z  4465  pwpw0  4784  bnj1023  35201  bnj1109  35207  pm10.55  45120
  Copyright terms: Public domain W3C validator