Theorem elrint 4934

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 3913	. 2 ⊢ (𝑋 ∈ (𝐴 ∩ ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ 𝑋 ∈ ∩ 𝐵))
2		elintg 4900	. . 3 ⊢ (𝑋 ∈ 𝐴 → (𝑋 ∈ ∩ 𝐵 ↔ ∀𝑦 ∈ 𝐵 𝑋 ∈ 𝑦))
3	2	pm5.32i 574	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑋 ∈ ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝑋 ∈ 𝑦))
4	1, 3	bitri 275	1 ⊢ (𝑋 ∈ (𝐴 ∩ ∩ 𝐵) ↔ (𝑋 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝑋 ∈ 𝑦))

Syntax hints:   ↔ wb 206   ∧ wa 395   ∈ wcel 2111  ∀wral 3047   ∩ cin 3896  ∩ cint 4892

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 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-v 3438  df-in 3904  df-int 4893

This theorem is referenced by:  elrint2  4935  ptcnplem  23531  tmdgsum2  24006  limciun  25817