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

Theorem iinxprg 5053
Description: Indexed intersection with an unordered pair index. (Contributed by NM, 25-Jan-2012.)
Hypotheses
Ref Expression
iinxprg.1 (𝑥 = 𝐴 → 𝐶 = 𝐷)
iinxprg.2 (𝑥 = 𝐵 → 𝐶 = 𝐸)
Assertion
Ref Expression
iinxprg ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ 𝑥 ∈ {𝐴, 𝐵}𝐶 = (𝐷 ∩ 𝐸))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝐸
Allowed substitution hints:   𝐶(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem iinxprg
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 iinxprg.1 . . . . 5 (𝑥 = 𝐴 → 𝐶 = 𝐷)
21eleq2d 2853 . . . 4 (𝑥 = 𝐴 → (𝑦 ∈ 𝐶 ↔ 𝑦 ∈ 𝐷))
3 iinxprg.2 . . . . 5 (𝑥 = 𝐵 → 𝐶 = 𝐸)
43eleq2d 2853 . . . 4 (𝑥 = 𝐵 → (𝑦 ∈ 𝐶 ↔ 𝑦 ∈ 𝐸))
52, 4ralprg 4657 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥 ∈ {𝐴, 𝐵}𝑦 ∈ 𝐶 ↔ (𝑦 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸)))
65abbidv 2832 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → {𝑦 ∣ ∀𝑥 ∈ {𝐴, 𝐵}𝑦 ∈ 𝐶} = {𝑦 ∣ (𝑦 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸)})
7 df-iin 4958 . 2 ∩ 𝑥 ∈ {𝐴, 𝐵}𝐶 = {𝑦 ∣ ∀𝑥 ∈ {𝐴, 𝐵}𝑦 ∈ 𝐶}
8 df-in 4093 . 2 (𝐷 ∩ 𝐸) = {𝑦 ∣ (𝑦 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸)}
96, 7, 83eqtr4g 2826 1 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ 𝑥 ∈ {𝐴, 𝐵}𝐶 = (𝐷 ∩ 𝐸))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  {cab 2744  ∀wral 3083   ∩ cin 4091  {cpr 4589  ∩ ciin 4956
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1575  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ral 3084  df-rex 3094  df-v 3455  df-in 4093  df-un 4153  df-sn 4588  df-pr 4590  df-iin 4958
This theorem is used by:  pmapmeet  41098  diameetN  42381  dihmeetlem2N  42624  dihmeetcN  42627  dihmeet  42668  iinfprg  50594  infsubc2  50596
  Copyright terms: Public domain W3C validator