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

Theorem elrint 4989
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 3961 . 2 (𝑋 ∈ (𝐴 𝐵) ↔ (𝑋𝐴𝑋 𝐵))
2 elintg 4952 . . 3 (𝑋𝐴 → (𝑋 𝐵 ↔ ∀𝑦𝐵 𝑋𝑦))
32pm5.32i 574 . 2 ((𝑋𝐴𝑋 𝐵) ↔ (𝑋𝐴 ∧ ∀𝑦𝐵 𝑋𝑦))
41, 3bitri 275 1 (𝑋 ∈ (𝐴 𝐵) ↔ (𝑋𝐴 ∧ ∀𝑦𝐵 𝑋𝑦))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 395  wcel 2099  wral 3057  cin 3944   cint 4944
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2699
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1537  df-ex 1775  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-ral 3058  df-v 3472  df-in 3952  df-int 4945
This theorem is referenced by:  elrint2  4990  ptcnplem  23518  tmdgsum2  23993  limciun  25816
  Copyright terms: Public domain W3C validator
OSZAR »