Theorem altopthd 36867

Description: Alternate ordered pair theorem with different sethood requirements. See altopth 36864 for more comments. (Contributed by Scott Fenton, 14-Apr-2012.)

Hypotheses

Ref	Expression
altopthd.1	⊢ 𝐶 ∈ V
altopthd.2	⊢ 𝐷 ∈ V

Assertion

Ref	Expression
altopthd	⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))

Proof of Theorem altopthd

Step	Hyp	Ref	Expression
1		eqcom 2770	. 2 ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ ⟪𝐶, 𝐷⟫ = ⟪𝐴, 𝐵⟫)
2		altopthd.1	. . 3 ⊢ 𝐶 ∈ V
3		altopthd.2	. . 3 ⊢ 𝐷 ∈ V
4	2, 3	altopth 36864	. 2 ⊢ (⟪𝐶, 𝐷⟫ = ⟪𝐴, 𝐵⟫ ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))
5		eqcom 2770	. . 3 ⊢ (𝐶 = 𝐴 ↔ 𝐴 = 𝐶)
6		eqcom 2770	. . 3 ⊢ (𝐷 = 𝐵 ↔ 𝐵 = 𝐷)
7	5, 6	anbi12i 640	. 2 ⊢ ((𝐶 = 𝐴 ∧ 𝐷 = 𝐵) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))
8	1, 4, 7	3bitri 300	1 ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  Vcvv 3454  ⟪caltop 36851

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5252  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-un 4154  df-sn 4589  df-pr 4591  df-altop 36853

This theorem is used by: (None)