Theorem moi2 3670

Description: Consequence of "at most one". (Contributed by NM, 29-Jun-2008.)

Hypothesis

Ref	Expression
moi2.1	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))

Assertion

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

Distinct variable groups:   𝑥,𝐴   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)

Proof of Theorem moi2

Step	Hyp	Ref	Expression
1		moi2.1	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
2	1	mob2 3669	. . . 4 ⊢ ((𝐴 ∈ 𝐵 ∧ ∃*𝑥𝜑 ∧ 𝜑) → (𝑥 = 𝐴 ↔ 𝜓))
3	2	3expa 1118	. . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ ∃*𝑥𝜑) ∧ 𝜑) → (𝑥 = 𝐴 ↔ 𝜓))
4	3	biimprd 248	. 2 ⊢ (((𝐴 ∈ 𝐵 ∧ ∃*𝑥𝜑) ∧ 𝜑) → (𝜓 → 𝑥 = 𝐴))
5	4	impr 454	1 ⊢ (((𝐴 ∈ 𝐵 ∧ ∃*𝑥𝜑) ∧ (𝜑 ∧ 𝜓)) → 𝑥 = 𝐴)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2111  ∃*wmo 2533

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-3an 1088  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-v 3438

This theorem is referenced by:  fsum  15627  fprod  15848  txcn  23541  haustsms2  24052