Theorem op1stb 5444

Description: Extract the first member of an ordered pair. Theorem 73 of [Suppes] p. 42. (See op2ndb 6240 to extract the second member, op1sta 6238 for an alternate version, and op1st 8030 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 4842	. . . . 5 ⊢ ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}}
4	3	inteqi 4914	. . . 4 ⊢ ∩ ⟨𝐴, 𝐵⟩ = ∩ {{𝐴}, {𝐴, 𝐵}}
5		snex 5401	. . . . . 6 ⊢ {𝐴} ∈ V
6		prex 5400	. . . . . 6 ⊢ {𝐴, 𝐵} ∈ V
7	5, 6	intpr 4945	. . . . 5 ⊢ ∩ {{𝐴}, {𝐴, 𝐵}} = ({𝐴} ∩ {𝐴, 𝐵})
8		snsspr1 4773	. . . . . 6 ⊢ {𝐴} ⊆ {𝐴, 𝐵}
9		dfss2 4097	. . . . . 6 ⊢ ({𝐴} ⊆ {𝐴, 𝐵} ↔ ({𝐴} ∩ {𝐴, 𝐵}) = {𝐴})
10	8, 9	mpbi 233	. . . . 5 ⊢ ({𝐴} ∩ {𝐴, 𝐵}) = {𝐴}
11	7, 10	eqtri 2786	. . . 4 ⊢ ∩ {{𝐴}, {𝐴, 𝐵}} = {𝐴}
12	4, 11	eqtri 2786	. . 3 ⊢ ∩ ⟨𝐴, 𝐵⟩ = {𝐴}
13	12	inteqi 4914	. 2 ⊢ ∩ ∩ ⟨𝐴, 𝐵⟩ = ∩ {𝐴}
14	1	intsn 4947	. 2 ⊢ ∩ {𝐴} = 𝐴
15	13, 14	eqtri 2786	1 ⊢ ∩ ∩ ⟨𝐴, 𝐵⟩ = 𝐴

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  {csn 4588  {cpr 4590  ⟨cop 4838  ∩ cint 4910

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-int 4911

This theorem is used by:  elreldm  5923  op2ndb  6240  elxp5  7956  1stval2  8039  fundmen  9084  xpsnen  9105