Theorem op1stb 5439

Description: Extract the first member of an ordered pair. Theorem 73 of [Suppes] p. 42. (See op2ndb 6228 to extract the second member, op1sta 6226 for an alternate version, and op1st 8009 for the preferred version.) (Contributed by NM, 25-Nov-2003.)

Hypotheses

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

Assertion

Ref	Expression
op1stb	⊢ ∩ ∩ ⟨𝐴, 𝐵⟩ = 𝐴

Proof of Theorem op1stb

Step	Hyp	Ref	Expression
1		op1stb.1	. . . . . 6 ⊢ 𝐴 ∈ V
2		op1stb.2	. . . . . 6 ⊢ 𝐵 ∈ V
3	1, 2	dfop 4831	. . . . 5 ⊢ ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}}
4	3	inteqi 4910	. . . 4 ⊢ ∩ ⟨𝐴, 𝐵⟩ = ∩ {{𝐴}, {𝐴, 𝐵}}
5		snex 5396	. . . . . 6 ⊢ {𝐴} ∈ V
6		prex 5395	. . . . . 6 ⊢ {𝐴, 𝐵} ∈ V
7	5, 6	intpr 4941	. . . . 5 ⊢ ∩ {{𝐴}, {𝐴, 𝐵}} = ({𝐴} ∩ {𝐴, 𝐵})
8		snsspr1 4774	. . . . . 6 ⊢ {𝐴} ⊆ {𝐴, 𝐵}
9		dfss2 4094	. . . . . 6 ⊢ ({𝐴} ⊆ {𝐴, 𝐵} ↔ ({𝐴} ∩ {𝐴, 𝐵}) = {𝐴})
10	8, 9	mpbi 233	. . . . 5 ⊢ ({𝐴} ∩ {𝐴, 𝐵}) = {𝐴}
11	7, 10	eqtri 2783	. . . 4 ⊢ ∩ {{𝐴}, {𝐴, 𝐵}} = {𝐴}
12	4, 11	eqtri 2783	. . 3 ⊢ ∩ ⟨𝐴, 𝐵⟩ = {𝐴}
13	12	inteqi 4910	. 2 ⊢ ∩ ∩ ⟨𝐴, 𝐵⟩ = ∩ {𝐴}
14	1	intsn 4943	. 2 ⊢ ∩ {𝐴} = 𝐴
15	13, 14	eqtri 2783	1 ⊢ ∩ ∩ ⟨𝐴, 𝐵⟩ = 𝐴

This proof depends on syntax axioms:   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089  {csn 4583  {cpr 4585  ⟨cop 4589  ∩ cint 4906

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-int 4907

This theorem is used by:  elreldm  5916  op2ndb  6228  elxp5  7935  1stval2  8018  fundmen  9059  xpsnen  9080