Theorem intpr 4910

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 4909. (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 4909	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵))
4	1, 2, 3	mp2an 688	1 ⊢ ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)

Syntax hints:   = wceq 1539   ∈ wcel 2108  Vcvv 3422   ∩ cin 3882  {cpr 4560  ∩ cint 4876

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-v 3424  df-un 3888  df-in 3890  df-sn 4559  df-pr 4561  df-int 4877

This theorem is referenced by:  intprgOLD  4912  uniintsn  4915  op1stb  5380  fiint  9021  shincli  29625  chincli  29723