Theorem op1stb 5431

Description: Extract the first member of an ordered pair. Theorem 73 of [Suppes] p. 42. (See op2ndb 6200 to extract the second member, op1sta 6198 for an alternate version, and op1st 7976 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 4836	. . . . 5 ⊢ ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}}
4	3	inteqi 4914	. . . 4 ⊢ ∩ ⟨𝐴, 𝐵⟩ = ∩ {{𝐴}, {𝐴, 𝐵}}
5		snex 5391	. . . . . 6 ⊢ {𝐴} ∈ V
6		prex 5392	. . . . . 6 ⊢ {𝐴, 𝐵} ∈ V
7	5, 6	intpr 4946	. . . . 5 ⊢ ∩ {{𝐴}, {𝐴, 𝐵}} = ({𝐴} ∩ {𝐴, 𝐵})
8		snsspr1 4778	. . . . . 6 ⊢ {𝐴} ⊆ {𝐴, 𝐵}
9		dfss2 3932	. . . . . 6 ⊢ ({𝐴} ⊆ {𝐴, 𝐵} ↔ ({𝐴} ∩ {𝐴, 𝐵}) = {𝐴})
10	8, 9	mpbi 230	. . . . 5 ⊢ ({𝐴} ∩ {𝐴, 𝐵}) = {𝐴}
11	7, 10	eqtri 2752	. . . 4 ⊢ ∩ {{𝐴}, {𝐴, 𝐵}} = {𝐴}
12	4, 11	eqtri 2752	. . 3 ⊢ ∩ ⟨𝐴, 𝐵⟩ = {𝐴}
13	12	inteqi 4914	. 2 ⊢ ∩ ∩ ⟨𝐴, 𝐵⟩ = ∩ {𝐴}
14	1	intsn 4948	. 2 ⊢ ∩ {𝐴} = 𝐴
15	13, 14	eqtri 2752	1 ⊢ ∩ ∩ ⟨𝐴, 𝐵⟩ = 𝐴

Syntax hints:   = wceq 1540   ∈ wcel 2109  Vcvv 3447   ∩ cin 3913   ⊆ wss 3914  {csn 4589  {cpr 4591  ⟨cop 4595  ∩ cint 4910

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-int 4911

This theorem is referenced by:  elreldm  5899  op2ndb  6200  elxp5  7899  1stval2  7985  fundmen  9002  xpsnen  9025