Theorem inrab2 4211

Description: Intersection with a restricted class abstraction. (Contributed by NM, 19-Nov-2007.)

Assertion

Ref	Expression
inrab2	⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∩ 𝐵) = {𝑥 ∈ (𝐴 ∩ 𝐵) ∣ 𝜑}

Distinct variable group:   𝑥,𝐵

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

Proof of Theorem inrab2

Step	Hyp	Ref	Expression
1		df-rab 3080	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
2		abid1 2894	. . 3 ⊢ 𝐵 = {𝑥 ∣ 𝑥 ∈ 𝐵}
3	1, 2	ineq12i 4116	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∩ 𝐵) = ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∩ {𝑥 ∣ 𝑥 ∈ 𝐵})
4		df-rab 3080	. . 3 ⊢ {𝑥 ∈ (𝐴 ∩ 𝐵) ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝜑)}
5		inab 4204	. . . 4 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∩ {𝑥 ∣ 𝑥 ∈ 𝐵}) = {𝑥 ∣ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ 𝑥 ∈ 𝐵)}
6		elin 3875	. . . . . . 7 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
7	6	anbi1i 627	. . . . . 6 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ 𝜑))
8		an32 646	. . . . . 6 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ 𝑥 ∈ 𝐵))
9	7, 8	bitri 278	. . . . 5 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ 𝑥 ∈ 𝐵))
10	9	abbii 2824	. . . 4 ⊢ {𝑥 ∣ (𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝜑)} = {𝑥 ∣ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ 𝑥 ∈ 𝐵)}
11	5, 10	eqtr4i 2785	. . 3 ⊢ ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∩ {𝑥 ∣ 𝑥 ∈ 𝐵}) = {𝑥 ∣ (𝑥 ∈ (𝐴 ∩ 𝐵) ∧ 𝜑)}
12	4, 11	eqtr4i 2785	. 2 ⊢ {𝑥 ∈ (𝐴 ∩ 𝐵) ∣ 𝜑} = ({𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∩ {𝑥 ∣ 𝑥 ∈ 𝐵})
13	3, 12	eqtr4i 2785	1 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∩ 𝐵) = {𝑥 ∈ (𝐴 ∩ 𝐵) ∣ 𝜑}

Syntax hints:   ∧ wa 400   = wceq 1539   ∈ wcel 2112  {cab 2736  {crab 3075   ∩ cin 3858

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2114  ax-9 2122  ax-ext 2730

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1542  df-ex 1783  df-sb 2071  df-clab 2737  df-cleq 2751  df-clel 2831  df-rab 3080  df-v 3412  df-in 3866

This theorem is referenced by:  iooval2  12802  fzval2  12932  smuval2  15871  smueqlem  15879  dfphi2  16156  ordtrest  21892  ordtrest2lem  21893  rspectopn  31328  ordtrestNEW  31382  ordtrest2NEWlem  31383  itg2addnclem2  35379  dmatALTbas  45165