Theorem r19.45v 3353

Description: Restricted quantifier version of one direction of 19.45 2235. The other direction holds when 𝐴 is nonempty, see r19.45zv 4448. (Contributed by NM, 2-Apr-2004.)

Assertion

Ref	Expression
r19.45v	⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) → (𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓))

Distinct variable group:   𝜑,𝑥

Allowed substitution hints:   𝜓(𝑥)   𝐴(𝑥)

Proof of Theorem r19.45v

Step	Hyp	Ref	Expression
1		r19.43 3351	. 2 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓))
2		id 22	. . . 4 ⊢ (𝜑 → 𝜑)
3	2	rexlimivw 3282	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 → 𝜑)
4	3	orim1i 906	. 2 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓) → (𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓))
5	1, 4	sylbi 219	1 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) → (𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓))

Syntax hints:   → wi 4   ∨ wo 843  ∃wrex 3139

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-ex 1777  df-ral 3143  df-rex 3144

This theorem is referenced by: (None)