Theorem elpreq 30779

Description: Equality wihin a pair. (Contributed by Thierry Arnoux, 23-Aug-2017.)

Hypotheses

Ref	Expression
elpreq.1	⊢ (𝜑 → 𝑋 ∈ {𝐴, 𝐵})
elpreq.2	⊢ (𝜑 → 𝑌 ∈ {𝐴, 𝐵})
elpreq.3	⊢ (𝜑 → (𝑋 = 𝐴 ↔ 𝑌 = 𝐴))

Assertion

Ref	Expression
elpreq	⊢ (𝜑 → 𝑋 = 𝑌)

Proof of Theorem elpreq

Step	Hyp	Ref	Expression
1		simpr 484	. . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝐴) → 𝑋 = 𝐴)
2		elpreq.3	. . . 4 ⊢ (𝜑 → (𝑋 = 𝐴 ↔ 𝑌 = 𝐴))
3	2	biimpa 476	. . 3 ⊢ ((𝜑 ∧ 𝑋 = 𝐴) → 𝑌 = 𝐴)
4	1, 3	eqtr4d 2781	. 2 ⊢ ((𝜑 ∧ 𝑋 = 𝐴) → 𝑋 = 𝑌)
5		elpreq.1	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ {𝐴, 𝐵})
6		elpri 4580	. . . . 5 ⊢ (𝑋 ∈ {𝐴, 𝐵} → (𝑋 = 𝐴 ∨ 𝑋 = 𝐵))
7	5, 6	syl 17	. . . 4 ⊢ (𝜑 → (𝑋 = 𝐴 ∨ 𝑋 = 𝐵))
8	7	orcanai 999	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 = 𝐴) → 𝑋 = 𝐵)
9		simpl 482	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 = 𝐴) → 𝜑)
10	2	notbid 317	. . . . 5 ⊢ (𝜑 → (¬ 𝑋 = 𝐴 ↔ ¬ 𝑌 = 𝐴))
11	10	biimpa 476	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 = 𝐴) → ¬ 𝑌 = 𝐴)
12		elpreq.2	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ {𝐴, 𝐵})
13		elpri 4580	. . . . 5 ⊢ (𝑌 ∈ {𝐴, 𝐵} → (𝑌 = 𝐴 ∨ 𝑌 = 𝐵))
14		pm2.53 847	. . . . 5 ⊢ ((𝑌 = 𝐴 ∨ 𝑌 = 𝐵) → (¬ 𝑌 = 𝐴 → 𝑌 = 𝐵))
15	12, 13, 14	3syl 18	. . . 4 ⊢ (𝜑 → (¬ 𝑌 = 𝐴 → 𝑌 = 𝐵))
16	9, 11, 15	sylc 65	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 = 𝐴) → 𝑌 = 𝐵)
17	8, 16	eqtr4d 2781	. 2 ⊢ ((𝜑 ∧ ¬ 𝑋 = 𝐴) → 𝑋 = 𝑌)
18	4, 17	pm2.61dan 809	1 ⊢ (𝜑 → 𝑋 = 𝑌)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 843   = wceq 1539   ∈ wcel 2108  {cpr 4560

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-v 3424  df-un 3888  df-sn 4559  df-pr 4561

This theorem is referenced by:  indpreima  31893