Theorem elintrab 4920

Description: Membership in the intersection of a class abstraction. (Contributed by NM, 17-Oct-1999.)

Hypothesis

Ref	Expression
elintab.ex	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
elintrab	⊢ (𝐴 ∈ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ ∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ∈ 𝑥))

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)

Proof of Theorem elintrab

Step	Hyp	Ref	Expression
1		elintab.ex	. . . 4 ⊢ 𝐴 ∈ V
2	1	elintab 4919	. . 3 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ ∀𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ∈ 𝑥))
3		impexp 456	. . . 4 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ∈ 𝑥) ↔ (𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥)))
4	3	albii 1852	. . 3 ⊢ (∀𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ∈ 𝑥) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥)))
5	2, 4	bitri 278	. 2 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥)))
6		df-rab 3413	. . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}
7	6	inteqi 4911	. . 3 ⊢ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} = ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}
8	7	eleq2i 2852	. 2 ⊢ (𝐴 ∈ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ 𝐴 ∈ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)})
9		df-ral 3077	. 2 ⊢ (∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ∈ 𝑥) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥)))
10	5, 8, 9	3bitr4i 306	1 ⊢ (𝐴 ∈ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ ∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ∈ 𝑥))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   ∈ wcel 2145  {cab 2738  ∀wral 3076  {crab 3412  Vcvv 3450  ∩ cint 4907

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-int 4908

This theorem is used by:  elintrabg  4921  intmin  4928  naddelim  8675  rankunb  9832  isf34lem4  10379  ist1-3  23574  filufint  24146  elspani  32024  fldgensdrg  33755  evls1fldgencl  34180  ldsysgenld  34671  ldgenpisyslem1  34674  kur14lem9  35793  pclclN  40764  elpclN  40765  naddwordnexlem4  44242  lcosslsp  49368