Theorem altopth2 36316

Description: Equality of the second members of equal alternate ordered pairs, which holds regardless of the first members' sethood. (Contributed by Scott Fenton, 22-Mar-2012.)

Assertion

Ref	Expression
altopth2	⊢ (𝐵 ∈ 𝑉 → (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ → 𝐵 = 𝐷))

Proof of Theorem altopth2

Step	Hyp	Ref	Expression
1		altopthsn 36311	. 2 ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ ({𝐴} = {𝐶} ∧ {𝐵} = {𝐷}))
2		sneqrg 4797	. . 3 ⊢ (𝐵 ∈ 𝑉 → ({𝐵} = {𝐷} → 𝐵 = 𝐷))
3	2	adantld 494	. 2 ⊢ (𝐵 ∈ 𝑉 → (({𝐴} = {𝐶} ∧ {𝐵} = {𝐷}) → 𝐵 = 𝐷))
4	1, 3	biimtrid 244	1 ⊢ (𝐵 ∈ 𝑉 → (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ → 𝐵 = 𝐷))

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1560   ∈ wcel 2142  {csn 4582  ⟪caltop 36306

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5246  ax-pr 5390

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1563  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3456  df-un 3909  df-ss 3921  df-sn 4583  df-pr 4585  df-altop 36308

This theorem is referenced by: (None)