MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iinxsng Structured version   Visualization version   GIF version

Theorem iinxsng 5051
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.
StepHypRef Expression
1 df-iin 4957 . 2 ∩ 𝑥 ∈ {𝐴}𝐵 = {𝑦 ∣ ∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵}
2 iinxsng.1 . . . . 5 (𝑥 = 𝐴 → 𝐵 = 𝐶)
32eleq2d 2850 . . . 4 (𝑥 = 𝐴 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
43ralsng 4636 . . 3 (𝐴 ∈ 𝑉 → (∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
54eqabcdv 2898 . 2 (𝐴 ∈ 𝑉 → {𝑦 ∣ ∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵} = 𝐶)
61, 5eqtrid 2810 1 (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}𝐵 = 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {cab 2741  ∀wral 3080  {csn 4588  ∩ ciin 4955
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-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-v 3456  df-sn 4589  df-iin 4957
This theorem is used by:  polatN  41180
  Copyright terms: Public domain W3C validator