Theorem opeq12d 4587

Description: Equality deduction for ordered pairs. (The proof was shortened by Andrew Salmon, 29-Jun-2011.) (Contributed by SF, 16-Dec-2006.) (Revised by SF, 29-Jun-2011.)

Hypotheses

Ref	Expression
opeq1d.1	⊢ (φ → A = B)
opeq12d.2	⊢ (φ → C = D)

Assertion

Ref	Expression
opeq12d	⊢ (φ → ⟨A, C⟩ = ⟨B, D⟩)

Proof of Theorem opeq12d

Step	Hyp	Ref	Expression
1		opeq1d.1	. . 3 ⊢ (φ → A = B)
2	1	opeq1d 4585	. 2 ⊢ (φ → ⟨A, C⟩ = ⟨B, C⟩)
3		opeq12d.2	. . 3 ⊢ (φ → C = D)
4	3	opeq2d 4586	. 2 ⊢ (φ → ⟨B, C⟩ = ⟨B, D⟩)
5	2, 4	eqtrd 2385	1 ⊢ (φ → ⟨A, C⟩ = ⟨B, D⟩)

Syntax hints:   → wi 4   = wceq 1642  ⟨cop 4562

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-v 2862  df-sbc 3048  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-addc 4379  df-nnc 4380  df-phi 4566  df-op 4567

This theorem is referenced by:  nfopd  4606  1st2nd2  5517  xpassen  6058