Theorem altopthc 33434

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

Hypotheses

Ref	Expression
altopthc.1	⊢ 𝐵 ∈ V
altopthc.2	⊢ 𝐶 ∈ V

Assertion

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

Proof of Theorem altopthc

Step	Hyp	Ref	Expression
1		eqcom 2830	. 2 ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ ⟪𝐶, 𝐷⟫ = ⟪𝐴, 𝐵⟫)
2		altopthc.2	. . 3 ⊢ 𝐶 ∈ V
3		altopthc.1	. . 3 ⊢ 𝐵 ∈ V
4	2, 3	altopthb 33433	. 2 ⊢ (⟪𝐶, 𝐷⟫ = ⟪𝐴, 𝐵⟫ ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵))
5		eqcom 2830	. . 3 ⊢ (𝐶 = 𝐴 ↔ 𝐴 = 𝐶)
6		eqcom 2830	. . 3 ⊢ (𝐷 = 𝐵 ↔ 𝐵 = 𝐷)
7	5, 6	anbi12i 628	. 2 ⊢ ((𝐶 = 𝐴 ∧ 𝐷 = 𝐵) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))
8	1, 4, 7	3bitri 299	1 ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))

Syntax hints:   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114  Vcvv 3496  ⟪caltop 33419

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-sn 4570  df-pr 4572  df-altop 33421

This theorem is referenced by: (None)