Theorem morex 3673

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 3057	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2		exancom 1862	. . . 4 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴))
3	1, 2	bitri 275	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴))
4		nfmo1 2552	. . . . . 6 ⊢ Ⅎ𝑥∃*𝑥𝜑
5		nfe1 2153	. . . . . 6 ⊢ Ⅎ𝑥∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴)
6	4, 5	nfan 1900	. . . . 5 ⊢ Ⅎ𝑥(∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴))
7		mopick 2620	. . . . 5 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴)) → (𝜑 → 𝑥 ∈ 𝐴))
8	6, 7	alrimi 2216	. . . 4 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴)) → ∀𝑥(𝜑 → 𝑥 ∈ 𝐴))
9		morex.1	. . . . 5 ⊢ 𝐵 ∈ V
10		morex.2	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓))
11		eleq1 2819	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
12	10, 11	imbi12d 344	. . . . 5 ⊢ (𝑥 = 𝐵 → ((𝜑 → 𝑥 ∈ 𝐴) ↔ (𝜓 → 𝐵 ∈ 𝐴)))
13	9, 12	spcv 3555	. . . 4 ⊢ (∀𝑥(𝜑 → 𝑥 ∈ 𝐴) → (𝜓 → 𝐵 ∈ 𝐴))
14	8, 13	syl 17	. . 3 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝑥 ∈ 𝐴)) → (𝜓 → 𝐵 ∈ 𝐴))
15	3, 14	sylan2b 594	. 2 ⊢ ((∃*𝑥𝜑 ∧ ∃𝑥 ∈ 𝐴 𝜑) → (𝜓 → 𝐵 ∈ 𝐴))
16	15	ancoms 458	1 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∧ ∃*𝑥𝜑) → (𝜓 → 𝐵 ∈ 𝐴))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1539   = wceq 1541  ∃wex 1780   ∈ wcel 2111  ∃*wmo 2533  ∃wrex 3056  Vcvv 3436

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-clab 2710  df-cleq 2723  df-clel 2806  df-rex 3057  df-v 3438

This theorem is referenced by: (None)