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

Theorem elrint 4919
Description: Membership in a restricted intersection. (Contributed by Stefan O'Rear, 3-Apr-2015.)
Assertion
Ref Expression
elrint (𝑋 ∈ (𝐴 𝐵) ↔ (𝑋𝐴 ∧ ∀𝑦𝐵 𝑋𝑦))
Distinct variable groups:   𝑦,𝐵   𝑦,𝑋
Allowed substitution hint:   𝐴(𝑦)

Proof of Theorem elrint
StepHypRef Expression
1 elin 4171 . 2 (𝑋 ∈ (𝐴 𝐵) ↔ (𝑋𝐴𝑋 𝐵))
2 elintg 4886 . . 3 (𝑋𝐴 → (𝑋 𝐵 ↔ ∀𝑦𝐵 𝑋𝑦))
32pm5.32i 577 . 2 ((𝑋𝐴𝑋 𝐵) ↔ (𝑋𝐴 ∧ ∀𝑦𝐵 𝑋𝑦))
41, 3bitri 277 1 (𝑋 ∈ (𝐴 𝐵) ↔ (𝑋𝐴 ∧ ∀𝑦𝐵 𝑋𝑦))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398  wcel 2114  wral 3140  cin 3937   cint 4878
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-v 3498  df-in 3945  df-int 4879
This theorem is referenced by:  elrint2  4920  ptcnplem  22231  tmdgsum2  22706  limciun  24494
  Copyright terms: Public domain W3C validator