Theorem op1sta 6226

Description: Extract the first member of an ordered pair. (See op2nda 6229 to extract the second member, op1stb 5440 for an alternate version, and op1st 8009 for the preferred version.) (Contributed by Raph Levien, 4-Dec-2003.)

Hypotheses

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

Assertion

Ref	Expression
op1sta	⊢ ∪ dom {⟨𝐴, 𝐵⟩} = 𝐴

Proof of Theorem op1sta

Step	Hyp	Ref	Expression
1		cnvsn.2	. . . 4 ⊢ 𝐵 ∈ V
2	1	dmsnop 6217	. . 3 ⊢ dom {⟨𝐴, 𝐵⟩} = {𝐴}
3	2	unieqi 4879	. 2 ⊢ ∪ dom {⟨𝐴, 𝐵⟩} = ∪ {𝐴}
4		cnvsn.1	. . 3 ⊢ 𝐴 ∈ V
5	4	unisn 4886	. 2 ⊢ ∪ {𝐴} = 𝐴
6	3, 5	eqtri 2784	1 ⊢ ∪ dom {⟨𝐴, 𝐵⟩} = 𝐴

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2145  Vcvv 3451  {csn 4584  ⟨cop 4590  ∪ cuni 4867  dom cdm 5651

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 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-dm 5661

This theorem is used by:  elxp4  7934  op1st  8009  fo1st  8021  f1stres  8025  xpassen  9090  xpdom2  9091