Theorem exintr 1611

Description: Introduce a conjunct in the scope of an existential quantifier. (Contributed by NM, 11-Aug-1993.)

Assertion

Ref	Expression
exintr	⊢ (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 → ∃𝑥(𝜑 ∧ 𝜓)))

Proof of Theorem exintr

Step	Hyp	Ref	Expression
1		exintrbi 1610	. 2 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 ↔ ∃𝑥(𝜑 ∧ 𝜓)))
2	1	biimpd 143	1 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 → ∃𝑥(𝜑 ∧ 𝜓)))

Syntax hints:   → wi 4   ∧ wa 103  ∀wal 1330  ∃wex 1469

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1424  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-4 1487  ax-ial 1511

This theorem depends on definitions:  df-bi 116

This theorem is referenced by:  ceqsex  2747  r19.2m  3476  r19.2mOLD  3477