Theorem elrint 4954

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

Step	Hyp	Ref	Expression
1		elin 3921	. 2 ⊢ (𝑋 ∈ (𝐴 ∩ ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ 𝑋 ∈ ∩ 𝐵))
2		elintg 4920	. . 3 ⊢ (𝑋 ∈ 𝐴 → (𝑋 ∈ ∩ 𝐵 ↔ ∀𝑦 ∈ 𝐵 𝑋 ∈ 𝑦))
3	2	pm5.32i 584	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑋 ∈ ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝑋 ∈ 𝑦))
4	1, 3	bitri 278	1 ⊢ (𝑋 ∈ (𝐴 ∩ ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝑋 ∈ 𝑦))

Syntax hints:   ↔ wb 209   ∧ wa 400   ∈ wcel 2143  ∀wral 3079   ∩ cin 3904  ∩ cint 4912

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-v 3457  df-in 3912  df-int 4913

This theorem is referenced by:  elrint2  4955  ptcnplem  23778  tmdgsum2  24253  limciun  26053