Theorem morex 3658

Description: Derive membership from uniqueness. (Contributed by Jeff Madsen, 2-Sep-2009.)

Hypotheses

Ref	Expression
morex.1	⊢ 𝐵 ∈ V
morex.2	⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓))

Assertion

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

Distinct variable groups:   𝑥,𝐵   𝑥,𝐴   𝜓,𝑥

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem morex

Step	Hyp	Ref	Expression
1		df-rex 3112	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2		exancom 1862	. . . 4 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴))
3	1, 2	bitri 278	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴))
4		nfmo1 2616	. . . . . 6 ⊢ Ⅎ𝑥∃*𝑥𝜑
5		nfe1 2151	. . . . . 6 ⊢ Ⅎ𝑥∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴)
6	4, 5	nfan 1900	. . . . 5 ⊢ Ⅎ𝑥(∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴))
7		mopick 2687	. . . . 5 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴)) → (𝜑 → 𝑥 ∈ 𝐴))
8	6, 7	alrimi 2211	. . . 4 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴)) → ∀𝑥(𝜑 → 𝑥 ∈ 𝐴))
9		morex.1	. . . . 5 ⊢ 𝐵 ∈ V
10		morex.2	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓))
11		eleq1 2877	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
12	10, 11	imbi12d 348	. . . . 5 ⊢ (𝑥 = 𝐵 → ((𝜑 → 𝑥 ∈ 𝐴) ↔ (𝜓 → 𝐵 ∈ 𝐴)))
13	9, 12	spcv 3554	. . . 4 ⊢ (∀𝑥(𝜑 → 𝑥 ∈ 𝐴) → (𝜓 → 𝐵 ∈ 𝐴))
14	8, 13	syl 17	. . 3 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴)) → (𝜓 → 𝐵 ∈ 𝐴))
15	3, 14	sylan2b 596	. 2 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥 ∈ 𝐴 𝜑) → (𝜓 → 𝐵 ∈ 𝐴))
16	15	ancoms 462	1 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃*𝑥𝜑) → (𝜓 → 𝐵 ∈ 𝐴))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399  ∀wal 1536   = wceq 1538  ∃wex 1781   ∈ wcel 2111  ∃*wmo 2596  ∃wrex 3107  Vcvv 3441

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-clab 2777  df-cleq 2791  df-clel 2870  df-rex 3112  df-v 3443

This theorem is referenced by: (None)