Theorem moi2 3709

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 3708	. . . 4 ⊢ ((𝐴 ∈ 𝐵 ∧ ∃*𝑥𝜑 ∧ 𝜑) → (𝑥 = 𝐴 ↔ 𝜓))
3	2	3expa 1114	. . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ ∃*𝑥𝜑) ∧ 𝜑) → (𝑥 = 𝐴 ↔ 𝜓))
4	3	biimprd 250	. 2 ⊢ (((𝐴 ∈ 𝐵 ∧ ∃*𝑥𝜑) ∧ 𝜑) → (𝜓 → 𝑥 = 𝐴))
5	4	impr 457	1 ⊢ (((𝐴 ∈ 𝐵 ∧ ∃*𝑥𝜑) ∧ (𝜑 ∧ 𝜓)) → 𝑥 = 𝐴)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114  ∃*wmo 2620

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-clab 2802  df-cleq 2816  df-clel 2895  df-v 3498

This theorem is referenced by:  fsum  15079  fprod  15297  txcn  22236  haustsms2  22747