Theorem dmprop 5646

Description: The domain of an unordered pair of ordered pairs. (Contributed by NM, 13-Sep-2011.)

Hypotheses

Ref	Expression
dmsnop.1	⊢ 𝐵 ∈ V
dmprop.1	⊢ 𝐷 ∈ V

Assertion

Ref	Expression
dmprop	⊢ dom {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = {𝐴, 𝐶}

Proof of Theorem dmprop

Step	Hyp	Ref	Expression
1		dmsnop.1	. 2 ⊢ 𝐵 ∈ V
2		dmprop.1	. 2 ⊢ 𝐷 ∈ V
3		dmpropg 5644	. 2 ⊢ ((𝐵 ∈ V ∧ 𝐷 ∈ V) → dom {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = {𝐴, 𝐶})
4	1, 2, 3	mp2an 708	1 ⊢ dom {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = {𝐴, 𝐶}

Syntax hints:   = wceq 1523   ∈ wcel 2030  Vcvv 3231  {cpr 4212  ⟨cop 4216  dom cdm 5143

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936

This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-br 4686  df-dm 5153

This theorem is referenced by:  dmtpop  5647  funtp  5983  fpr  6461  fnprb  6513  hashfun  13262  umgr2v2evd2  26479  ex-dm  27426