Theorem intunsn 4950

Description: Theorem joining a singleton to an intersection. (Contributed by NM, 29-Sep-2002.)

Hypothesis

Ref	Expression
intunsn.1	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
intunsn	⊢ ∩ (𝐴 ∪ {𝐵}) = (∩ 𝐴 ∩ 𝐵)

Proof of Theorem intunsn

Step	Hyp	Ref	Expression
1		intun 4943	. 2 ⊢ ∩ (𝐴 ∪ {𝐵}) = (∩ 𝐴 ∩ ∩ {𝐵})
2		intunsn.1	. . . 4 ⊢ 𝐵 ∈ V
3	2	intsn 4947	. . 3 ⊢ ∩ {𝐵} = 𝐵
4	3	ineq2i 4117	. 2 ⊢ (∩ 𝐴 ∩ ∩ {𝐵}) = (∩ 𝐴 ∩ 𝐵)
5	1, 4	eqtri 2786	1 ⊢ ∩ (𝐴 ∪ {𝐵}) = (∩ 𝐴 ∩ 𝐵)

This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∩ cin 4092   ∪ cun 4152  {csn 4588  ∩ 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

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-in 4094  df-un 4154  df-sn 4589  df-pr 4591  df-int 4911

This theorem is used by:  fiint  9349  incexclem  16037  heibor1lem  38946