Theorem nelpr1 4614

Description: If a class is not an element of an unordered pair, it is not the first listed element. (Contributed by Glauco Siliprandi, 3-Mar-2021.)

Hypotheses

Ref	Expression
nelpr1.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
nelpr1.n	⊢ (𝜑 → ¬ 𝐴 ∈ {𝐵, 𝐶})

Assertion

Ref	Expression
nelpr1	⊢ (𝜑 → 𝐴 ≠ 𝐵)

Proof of Theorem nelpr1

Step	Hyp	Ref	Expression
1		nelpr1.n	. . 3 ⊢ (𝜑 → ¬ 𝐴 ∈ {𝐵, 𝐶})
2		animorrl 996	. . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))
3		nelpr1.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
4		elprg 4606	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶)))
5	3, 4	syl 18	. . . . 5 ⊢ (𝜑 → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶)))
6	5	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶)))
7	2, 6	mpbird 260	. . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ∈ {𝐵, 𝐶})
8	1, 7	mtand 828	. 2 ⊢ (𝜑 → ¬ 𝐴 = 𝐵)
9	8	neqned 2962	1 ⊢ (𝜑 → 𝐴 ≠ 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  {cpr 4585

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 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-v 3452  df-un 3903  df-sn 4584  df-pr 4586

This theorem is used by:  cyc3genpmlem  33645  ovnsubadd2lem  47577