Theorem opthg2 4282

Description: Ordered pair theorem. (Contributed by NM, 14-Oct-2005.) (Revised by Mario Carneiro, 26-Apr-2015.)

Assertion

Ref	Expression
opthg2	⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))

Proof of Theorem opthg2

Step	Hyp	Ref	Expression
1		opthg 4281	. 2 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
2		eqcom 2206	. 2 ⊢ (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ ⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩)
3		eqcom 2206	. . 3 ⊢ (𝐴 = 𝐶 ↔ 𝐶 = 𝐴)
4		eqcom 2206	. . 3 ⊢ (𝐵 = 𝐷 ↔ 𝐷 = 𝐵)
5	3, 4	anbi12i 460	. 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))
6	1, 2, 5	3bitr4g 223	1 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1372   ∈ wcel 2175  ⟨cop 3635

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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-v 2773  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641

This theorem is referenced by:  opth2  4283  fliftel  5861  axprecex  7992