Theorem intpr 4913

Description: The intersection of a pair is the intersection of its members. Theorem 71 of [Suppes] p. 42. (Contributed by NM, 14-Oct-1999.) Prove from intprg 4912. (Revised by BJ, 1-Sep-2024.)

Hypotheses

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

Assertion

Ref	Expression
intpr	⊢ ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)

Proof of Theorem intpr

Step	Hyp	Ref	Expression
1		intpr.1	. 2 ⊢ 𝐴 ∈ V
2		intpr.2	. 2 ⊢ 𝐵 ∈ V
3		intprg 4912	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵))
4	1, 2, 3	mp2an 689	1 ⊢ ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)

Syntax hints:   = wceq 1539   ∈ wcel 2106  Vcvv 3432   ∩ cin 3886  {cpr 4563  ∩ cint 4879

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-v 3434  df-un 3892  df-in 3894  df-sn 4562  df-pr 4564  df-int 4880

This theorem is referenced by:  intprgOLD  4915  uniintsn  4918  op1stb  5386  fiint  9091  shincli  29724  chincli  29822