Theorem moi2 3738

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 3737	. . . 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 1537   ∈ wcel 2108  ∃*wmo 2541

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-clab 2718  df-cleq 2732  df-clel 2819  df-v 3490

This theorem is referenced by:  fsum  15768  fprod  15989  txcn  23655  haustsms2  24166