Theorem altopth 36656

Description: The alternate ordered pair theorem. If two alternate ordered pairs are equal, their first elements are equal and their second elements are equal. Note that 𝐶 and 𝐷 are not required to be a set due to a peculiarity of our specific ordered pair definition, as opposed to the regular ordered pairs used here, which (as in opth 5444), requires 𝐷 to be a set. (Contributed by Scott Fenton, 23-Mar-2012.)

Hypotheses

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

Assertion

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

Proof of Theorem altopth

Step	Hyp	Ref	Expression
1		altopth.1	. 2 ⊢ 𝐴 ∈ V
2		altopth.2	. 2 ⊢ 𝐵 ∈ V
3		altopthg 36654	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)))
4	1, 2, 3	mp2an 705	1 ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450  ⟪caltop 36643

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-un 3903  df-ss 3915  df-sn 4584  df-pr 4586  df-altop 36645

This theorem is used by:  altopthd  36659  altopelaltxp  36663