Theorem opcom 4391

Description: An ordered pair commutes iff its members are equal. (Contributed by NM, 28-May-2009.)

Hypotheses

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

Assertion

Ref	Expression
opcom	⊢ (⟨𝐴, 𝐵⟩ = ⟨𝐵, 𝐴⟩ ↔ 𝐴 = 𝐵)

Proof of Theorem opcom

Step	Hyp	Ref	Expression
1		opcom.1	. . 3 ⊢ 𝐴 ∈ V
2		opcom.2	. . 3 ⊢ 𝐵 ∈ V
3	1, 2	opth 4377	. 2 ⊢ (⟨𝐴, 𝐵⟩ = ⟨𝐵, 𝐴⟩ ↔ (𝐴 = 𝐵 ∧ 𝐵 = 𝐴))
4		eqcom 2240	. . 3 ⊢ (𝐵 = 𝐴 ↔ 𝐴 = 𝐵)
5	4	anbi2i 461	. 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = 𝐴) ↔ (𝐴 = 𝐵 ∧ 𝐴 = 𝐵))
6		anidm 400	. 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐴 = 𝐵) ↔ 𝐴 = 𝐵)
7	3, 5, 6	3bitri 206	1 ⊢ (⟨𝐴, 𝐵⟩ = ⟨𝐵, 𝐴⟩ ↔ 𝐴 = 𝐵)

This proof depends on syntax axioms:   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  Vcvv 2821  ⟨cop 3712

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718

This theorem is used by: (None)