Theorem rmoan 3700

Description: Restricted "at most one" still holds when a conjunct is added. (Contributed by NM, 16-Jun-2017.)

Assertion

Ref	Expression
rmoan	⊢ (∃*𝑥 ∈ 𝐴 𝜑 → ∃*𝑥 ∈ 𝐴 (𝜓 ∧ 𝜑))

Proof of Theorem rmoan

Step	Hyp	Ref	Expression
1		moan 2578	. . 3 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → ∃*𝑥(𝜓 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)))
2		an12 655	. . . 4 ⊢ ((𝜓 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ (𝜓 ∧ 𝜑)))
3	2	mobii 2574	. . 3 ⊢ (∃*𝑥(𝜓 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝜓 ∧ 𝜑)))
4	1, 3	sylib 220	. 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝜓 ∧ 𝜑)))
5		df-rmo 3366	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
6		df-rmo 3366	. 2 ⊢ (∃*𝑥 ∈ 𝐴 (𝜓 ∧ 𝜑) ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝜓 ∧ 𝜑)))
7	4, 5, 6	3imtr4i 294	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 → ∃*𝑥 ∈ 𝐴 (𝜓 ∧ 𝜑))

Syntax hints:   → wi 4   ∧ wa 399   ∈ wcel 2141  ∃*wmo 2563  ∃*wrmo 3365

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027

This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1799  df-mo 2565  df-rmo 3366

This theorem is referenced by:  reuxfrd  3709  reuxfrdf  32648