Theorem iinxsng 3730

Description: A singleton index picks out an instance of an indexed intersection's argument. (Contributed by NM, 15-Jan-2012.) (Proof shortened by Mario Carneiro, 17-Nov-2016.)

Hypothesis

Ref	Expression
iinxsng.1	⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)

Assertion

Ref	Expression
iinxsng	⊢ (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}𝐵 = 𝐶)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐶

Allowed substitution hints:   𝐵(𝑥)   𝑉(𝑥)

Proof of Theorem iinxsng

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-iin 3660	. 2 ⊢ ∩ 𝑥 ∈ {𝐴}𝐵 = {𝑦 ∣ ∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵}
2		iinxsng.1	. . . . 5 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶)
3	2	eleq2d 2107	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
4	3	ralsng 3411	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
5	4	abbi1dv 2157	. 2 ⊢ (𝐴 ∈ 𝑉 → {𝑦 ∣ ∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵} = 𝐶)
6	1, 5	syl5eq 2084	1 ⊢ (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}𝐵 = 𝐶)

Syntax hints:   → wi 4   = wceq 1243   ∈ wcel 1393  {cab 2026  ∀wral 2306  {csn 3375  ∩ ciin 3658

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-v 2559  df-sbc 2765  df-sn 3381  df-iin 3660

This theorem is referenced by: (None)