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

Theorem exintr 1924
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 1864 1 (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 → ∃𝑥(𝜑 ∧ 𝜓)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀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
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812
This theorem is used by:  equs4v  2032  equs4  2445  eupickbi  2661  barbarilem  2692  r19.2z  4454  pwpw0  4830  bnj1023  35457  bnj1109  35463  pm10.55  45446
  Copyright terms: Public domain W3C validator