Theorem preq2b 4805

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 4693	. . 3 ⊢ {𝐶, 𝐴} = {𝐴, 𝐶}
2		prcom 4693	. . 3 ⊢ {𝐶, 𝐵} = {𝐵, 𝐶}
3	1, 2	eqeq12i 2781	. 2 ⊢ ({𝐶, 𝐴} = {𝐶, 𝐵} ↔ {𝐴, 𝐶} = {𝐵, 𝐶})
4		preq1b.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
5		preq1b.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
6	4, 5	preq1b 4804	. 2 ⊢ (𝜑 → ({𝐴, 𝐶} = {𝐵, 𝐶} ↔ 𝐴 = 𝐵))
7	3, 6	bitrid 286	1 ⊢ (𝜑 → ({𝐶, 𝐴} = {𝐶, 𝐵} ↔ 𝐴 = 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  {cpr 4590

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-un 4154  df-sn 4589  df-pr 4591

This theorem is used by:  umgr2v2enb1  30137  clsk1indlem4  45236  usgrexmpl2nb0  49334  usgrexmpl2nb1  49335  usgrexmpl2nb2  49336  usgrexmpl2nb3  49337  usgrexmpl2nb4  49338  usgrexmpl2nb5  49339