Theorem preq12d 3808

Description: Equality deduction for unordered pairs. (Contributed by NM, 19-Oct-2012.)

Hypotheses

Ref	Expression
preq1d.1	⊢ (φ → A = B)
preq12d.2	⊢ (φ → C = D)

Assertion

Ref	Expression
preq12d	⊢ (φ → {A, C} = {B, D})

Proof of Theorem preq12d

Step	Hyp	Ref	Expression
1		preq1d.1	. 2 ⊢ (φ → A = B)
2		preq12d.2	. 2 ⊢ (φ → C = D)
3		preq12 3802	. 2 ⊢ ((A = B ∧ C = D) → {A, C} = {B, D})
4	1, 2, 3	syl2anc 642	1 ⊢ (φ → {A, C} = {B, D})

Syntax hints:   → wi 4   = wceq 1642  {cpr 3739

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

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  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-v 2862  df-nin 3212  df-compl 3213  df-un 3215  df-sn 3742  df-pr 3743

This theorem is referenced by:  opkeq1  4060