Theorem elintrab 4913

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 4911	. . 3 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ ∀𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ∈ 𝑥))
3		impexp 450	. . . 4 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ∈ 𝑥) ↔ (𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥)))
4	3	albii 1819	. . 3 ⊢ (∀𝑥((𝑥 ∈ 𝐵 ∧ 𝜑) → 𝐴 ∈ 𝑥) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥)))
5	2, 4	bitri 275	. 2 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)} ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥)))
6		df-rab 3397	. . . 4 ⊢ {𝑥 ∈ 𝐵 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}
7	6	inteqi 4903	. . 3 ⊢ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} = ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)}
8	7	eleq2i 2820	. 2 ⊢ (𝐴 ∈ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ 𝐴 ∈ ∩ {𝑥 ∣ (𝑥 ∈ 𝐵 ∧ 𝜑)})
9		df-ral 3045	. 2 ⊢ (∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ∈ 𝑥) ↔ ∀𝑥(𝑥 ∈ 𝐵 → (𝜑 → 𝐴 ∈ 𝑥)))
10	5, 8, 9	3bitr4i 303	1 ⊢ (𝐴 ∈ ∩ {𝑥 ∈ 𝐵 ∣ 𝜑} ↔ ∀𝑥 ∈ 𝐵 (𝜑 → 𝐴 ∈ 𝑥))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1538   ∈ wcel 2109  {cab 2707  ∀wral 3044  {crab 3396  Vcvv 3438  ∩ cint 4899

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3397  df-int 4900

This theorem is referenced by:  elintrabg  4914  intmin  4921  naddelim  8611  rankunb  9765  isf34lem4  10290  ist1-3  23252  filufint  23823  elspani  31505  fldgensdrg  33266  evls1fldgencl  33644  ldsysgenld  34129  ldgenpisyslem1  34132  kur14lem9  35189  pclclN  39873  elpclN  39874  naddwordnexlem4  43377  lcosslsp  48427