Theorem intsng 3670

Description: Intersection of a singleton. (Contributed by Stefan O'Rear, 22-Feb-2015.)

Assertion

Ref	Expression
intsng	⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴} = 𝐴)

Proof of Theorem intsng

Step	Hyp	Ref	Expression
1		dfsn2 3412	. . 3 ⊢ {𝐴} = {𝐴, 𝐴}
2	1	inteqi 3640	. 2 ⊢ ∩ {𝐴} = ∩ {𝐴, 𝐴}
3		intprg 3669	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → ∩ {𝐴, 𝐴} = (𝐴 ∩ 𝐴))
4	3	anidms 389	. . 3 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴, 𝐴} = (𝐴 ∩ 𝐴))
5		inidm 3175	. . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴
6	4, 5	syl6eq 2129	. 2 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴, 𝐴} = 𝐴)
7	2, 6	syl5eq 2125	1 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴} = 𝐴)

Syntax hints:   → wi 4   = wceq 1284   ∈ wcel 1433   ∩ cin 2972  {csn 3398  {cpr 3399  ∩ cint 3636

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-v 2603  df-un 2977  df-in 2979  df-sn 3404  df-pr 3405  df-int 3637

This theorem is referenced by:  intsn  3671  op1stbg  4228  riinint  4611