Theorem intprg 3981

Description: The intersection of a pair is the intersection of its members. Closed form of intpr 3980. Theorem 71 of [Suppes] p. 42. (Contributed by FL, 27-Apr-2008.)

Assertion

Ref	Expression
intprg	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵))

Proof of Theorem intprg

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		preq1 3767	. . . 4 ⊢ (𝑥 = 𝐴 → {𝑥, 𝑦} = {𝐴, 𝑦})
2	1	inteqd 3953	. . 3 ⊢ (𝑥 = 𝐴 → ∩ {𝑥, 𝑦} = ∩ {𝐴, 𝑦})
3		ineq1 3414	. . 3 ⊢ (𝑥 = 𝐴 → (𝑥 ∩ 𝑦) = (𝐴 ∩ 𝑦))
4	2, 3	eqeq12d 2247	. 2 ⊢ (𝑥 = 𝐴 → (∩ {𝑥, 𝑦} = (𝑥 ∩ 𝑦) ↔ ∩ {𝐴, 𝑦} = (𝐴 ∩ 𝑦)))
5		preq2 3768	. . . 4 ⊢ (𝑦 = 𝐵 → {𝐴, 𝑦} = {𝐴, 𝐵})
6	5	inteqd 3953	. . 3 ⊢ (𝑦 = 𝐵 → ∩ {𝐴, 𝑦} = ∩ {𝐴, 𝐵})
7		ineq2 3415	. . 3 ⊢ (𝑦 = 𝐵 → (𝐴 ∩ 𝑦) = (𝐴 ∩ 𝐵))
8	6, 7	eqeq12d 2247	. 2 ⊢ (𝑦 = 𝐵 → (∩ {𝐴, 𝑦} = (𝐴 ∩ 𝑦) ↔ ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)))
9		vex 2815	. . 3 ⊢ 𝑥 ∈ V
10		vex 2815	. . 3 ⊢ 𝑦 ∈ V
11	9, 10	intpr 3980	. 2 ⊢ ∩ {𝑥, 𝑦} = (𝑥 ∩ 𝑦)
12	4, 8, 11	vtocl2g 2878	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398   ∈ wcel 2203   ∩ cin 3209  {cpr 3689  ∩ cint 3948

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-v 2814  df-un 3214  df-in 3216  df-sn 3694  df-pr 3695  df-int 3949

This theorem is referenced by:  intsng  3982  op1stbg  4599  subrngin  14347  subrgin  14378  lssincl  14520