Theorem r19.40 3298

Description: Restricted quantifier version of Theorem 19.40 of [Margaris] p. 90. (Contributed by NM, 2-Apr-2004.)

Assertion

Ref	Expression
r19.40	⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) → (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 ∈ 𝐴 𝜓))

Proof of Theorem r19.40

Step	Hyp	Ref	Expression
1		simpl 476	. . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝜑)
2	1	reximi 3219	. 2 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) → ∃𝑥 ∈ 𝐴 𝜑)
3		simpr 479	. . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝜓)
4	3	reximi 3219	. 2 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) → ∃𝑥 ∈ 𝐴 𝜓)
5	2, 4	jca 507	1 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) → (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 ∈ 𝐴 𝜓))

Syntax hints:   → wi 4   ∧ wa 386  ∃wrex 3118

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908

This theorem depends on definitions:  df-bi 199  df-an 387  df-ex 1879  df-ral 3122  df-rex 3123

This theorem is referenced by:  rexanuz  14469  txflf  22187  metequiv2  22692  mzpcompact2lem  38157