Theorem preq2b 4850

Description: Biconditional equality lemma for unordered pairs, deduction form. Two unordered pairs have the same first element iff the second elements are equal. (Contributed by AV, 18-Dec-2020.)

Hypotheses

Ref	Expression
preq1b.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
preq1b.b	⊢ (𝜑 → 𝐵 ∈ 𝑊)

Assertion

Ref	Expression
preq2b	⊢ (𝜑 → ({𝐶, 𝐴} = {𝐶, 𝐵} ↔ 𝐴 = 𝐵))

Proof of Theorem preq2b

Step	Hyp	Ref	Expression
1		prcom 4738	. . 3 ⊢ {𝐶, 𝐴} = {𝐴, 𝐶}
2		prcom 4738	. . 3 ⊢ {𝐶, 𝐵} = {𝐵, 𝐶}
3	1, 2	eqeq12i 2743	. 2 ⊢ ({𝐶, 𝐴} = {𝐶, 𝐵} ↔ {𝐴, 𝐶} = {𝐵, 𝐶})
4		preq1b.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
5		preq1b.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
6	4, 5	preq1b 4849	. 2 ⊢ (𝜑 → ({𝐴, 𝐶} = {𝐵, 𝐶} ↔ 𝐴 = 𝐵))
7	3, 6	bitrid 282	1 ⊢ (𝜑 → ({𝐶, 𝐴} = {𝐶, 𝐵} ↔ 𝐴 = 𝐵))

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1533   ∈ wcel 2098  {cpr 4632

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-tru 1536  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-v 3463  df-un 3949  df-sn 4631  df-pr 4633

This theorem is referenced by:  umgr2v2enb1  29412  clsk1indlem4  43616