Theorem opthg2 5481

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 5479	. 2 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
2		eqcom 2735	. 2 ⊢ (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ ⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩)
3		eqcom 2735	. . 3 ⊢ (𝐴 = 𝐶 ↔ 𝐶 = 𝐴)
4		eqcom 2735	. . 3 ⊢ (𝐵 = 𝐷 ↔ 𝐷 = 𝐵)
5	3, 4	anbi12i 627	. 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))
6	1, 2, 5	3bitr4g 314	1 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1534   ∈ wcel 2099  ⟨cop 4635

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pr 5429

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-rab 3430  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636

This theorem is referenced by:  opth2  5482  brsnop  5524  fliftel  7317  symg2bas  19347  projf1o  44570