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

Theorem eliund 4961
Description: Membership in indexed union. (Contributed by Glauco Siliprandi, 15-Feb-2025.)
Hypothesis
Ref Expression
eliund.1 (𝜑 → ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝐶)
Assertion
Ref Expression
eliund (𝜑 → 𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝐶)
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem eliund
StepHypRef Expression
1 eliund.1 . 2 (𝜑 → ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝐶)
2 eliun 4958 . 2 (𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝐶)
31, 2sylibr 237 1 (𝜑 → 𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∈ wcel 2147  ∃wrex 3090  ∪ ciun 4954
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-rex 3091  df-v 3456  df-iun 4956
This theorem is used by:  ac6c4  10589  bdayiun  28334  gsumwrd2dccatlem  33714  hoicvr  47773  imaid  50485
  Copyright terms: Public domain W3C validator