Theorem preqr2 3873

Description: Reverse equality lemma for unordered pairs. If two unordered pairs have the same first element, the second elements are equal. (Contributed by NM, 5-Aug-1993.)

Hypotheses

Ref	Expression
preqr2.1	⊢ 𝐴 ∈ V
preqr2.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
preqr2	⊢ ({𝐶, 𝐴} = {𝐶, 𝐵} → 𝐴 = 𝐵)

Proof of Theorem preqr2

Step	Hyp	Ref	Expression
1		prcom 3767	. . 3 ⊢ {𝐶, 𝐴} = {𝐴, 𝐶}
2		prcom 3767	. . 3 ⊢ {𝐶, 𝐵} = {𝐵, 𝐶}
3	1, 2	eqeq12i 2246	. 2 ⊢ ({𝐶, 𝐴} = {𝐶, 𝐵} ↔ {𝐴, 𝐶} = {𝐵, 𝐶})
4		preqr2.1	. . 3 ⊢ 𝐴 ∈ V
5		preqr2.2	. . 3 ⊢ 𝐵 ∈ V
6	4, 5	preqr1 3872	. 2 ⊢ ({𝐴, 𝐶} = {𝐵, 𝐶} → 𝐴 = 𝐵)
7	3, 6	sylbi 121	1 ⊢ ({𝐶, 𝐴} = {𝐶, 𝐵} → 𝐴 = 𝐵)

Syntax hints:   → wi 4   = wceq 1398   ∈ wcel 2203  Vcvv 2813  {cpr 3690

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2815  df-un 3215  df-sn 3695  df-pr 3696

This theorem is referenced by:  preq12b  3874  opth  4353  opthreg  4678  usgredgreu  16211  uspgredg2vtxeu  16213