Theorem moi 3683

Description: Equality implied by "at most one". (Contributed by NM, 18-Feb-2006.)

Hypotheses

Ref	Expression
moi.1	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
moi.2	⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒))

Assertion

Ref	Expression
moi	⊢ (((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ∧ ∃*𝑥𝜑 ∧ (𝜓 ∧ 𝜒)) → 𝐴 = 𝐵)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜒,𝑥   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝐶(𝑥)   𝐷(𝑥)

Proof of Theorem moi

Step	Hyp	Ref	Expression
1		moi.1	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
2		moi.2	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒))
3	1, 2	mob 3682	. . . . 5 ⊢ (((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ∧ ∃*𝑥𝜑 ∧ 𝜓) → (𝐴 = 𝐵 ↔ 𝜒))
4	3	biimprd 251	. . . 4 ⊢ (((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ∧ ∃*𝑥𝜑 ∧ 𝜓) → (𝜒 → 𝐴 = 𝐵))
5	4	3expia 1139	. . 3 ⊢ (((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ∧ ∃*𝑥𝜑) → (𝜓 → (𝜒 → 𝐴 = 𝐵)))
6	5	impd 416	. 2 ⊢ (((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ∧ ∃*𝑥𝜑) → ((𝜓 ∧ 𝜒) → 𝐴 = 𝐵))
7	6	3impia 1135	1 ⊢ (((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) ∧ ∃*𝑥𝜑 ∧ (𝜓 ∧ 𝜒)) → 𝐴 = 𝐵)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∃*wmo 2567

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-clab 2744  df-cleq 2757  df-clel 2840  df-v 3459

This theorem is used by:  enqeq  10934  f1otrspeq  19561  hausflim  24189  tglineineq  28967  tglineinteq  28970