Theorem elprn2 45555

Description: A member of an unordered pair that is not the "second", must be the "first". (Contributed by Glauco Siliprandi, 11-Dec-2019.)

Assertion

Ref	Expression
elprn2	⊢ ((𝐴 ∈ {𝐵, 𝐶} ∧ 𝐴 ≠ 𝐶) → 𝐴 = 𝐵)

Proof of Theorem elprn2

Step	Hyp	Ref	Expression
1		neneq 2952	. . 3 ⊢ (𝐴 ≠ 𝐶 → ¬ 𝐴 = 𝐶)
2	1	adantl 481	. 2 ⊢ ((𝐴 ∈ {𝐵, 𝐶} ∧ 𝐴 ≠ 𝐶) → ¬ 𝐴 = 𝐶)
3		elpri 4671	. . . 4 ⊢ (𝐴 ∈ {𝐵, 𝐶} → (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))
4	3	adantr 480	. . 3 ⊢ ((𝐴 ∈ {𝐵, 𝐶} ∧ 𝐴 ≠ 𝐶) → (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))
5		orcom 869	. . . 4 ⊢ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) ↔ (𝐴 = 𝐶 ∨ 𝐴 = 𝐵))
6		df-or 847	. . . 4 ⊢ ((𝐴 = 𝐶 ∨ 𝐴 = 𝐵) ↔ (¬ 𝐴 = 𝐶 → 𝐴 = 𝐵))
7	5, 6	bitri 275	. . 3 ⊢ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) ↔ (¬ 𝐴 = 𝐶 → 𝐴 = 𝐵))
8	4, 7	sylib 218	. 2 ⊢ ((𝐴 ∈ {𝐵, 𝐶} ∧ 𝐴 ≠ 𝐶) → (¬ 𝐴 = 𝐶 → 𝐴 = 𝐵))
9	2, 8	mpd 15	1 ⊢ ((𝐴 ∈ {𝐵, 𝐶} ∧ 𝐴 ≠ 𝐶) → 𝐴 = 𝐵)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 846   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  {cpr 4650

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-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-v 3490  df-un 3981  df-sn 4649  df-pr 4651

This theorem is referenced by: (None)