Theorem moi2 2860

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

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1331   ∈ wcel 1480  ∃*wmo 1998

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683

This theorem is referenced by:  fsum3  11149  txcn  12433