Theorem elintg 3957

Description: Membership in class intersection, with the sethood requirement expressed as an antecedent. (Contributed by NM, 20-Nov-2003.)

Assertion

Ref	Expression
elintg	⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ ∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝐴 ∈ 𝑥))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem elintg

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2295	. 2 ⊢ (𝑦 = 𝐴 → (𝑦 ∈ ∩ 𝐵 ↔ 𝐴 ∈ ∩ 𝐵))
2		eleq1 2295	. . 3 ⊢ (𝑦 = 𝐴 → (𝑦 ∈ 𝑥 ↔ 𝐴 ∈ 𝑥))
3	2	ralbidv 2542	. 2 ⊢ (𝑦 = 𝐴 → (∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥 ↔ ∀𝑥 ∈ 𝐵 𝐴 ∈ 𝑥))
4		vex 2816	. . 3 ⊢ 𝑦 ∈ V
5	4	elint2 3956	. 2 ⊢ (𝑦 ∈ ∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝑥)
6	1, 3, 5	vtoclbg 2876	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ ∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝐴 ∈ 𝑥))

Syntax hints:   → wi 4   ↔ wb 105   = wceq 1398   ∈ wcel 2203  ∀wral 2520  ∩ cint 3949

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-v 2815  df-int 3950

This theorem is referenced by:  elinti  3958  elrint  3989  peano2  4717  pitonn  8163  peano1nnnn  8167  peano2nnnn  8168  1nn  9248  peano2nn  9249  subgintm  13915  subrngintm  14357  subrgintm  14388  lssintclm  14532