ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  inrab2 GIF version

Theorem inrab2 3237
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
StepHypRef Expression
1 df-rab 2357 . . 3 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
2 abid2 2199 . . . 4 {𝑥𝑥𝐵} = 𝐵
32eqcomi 2085 . . 3 𝐵 = {𝑥𝑥𝐵}
41, 3ineq12i 3165 . 2 ({𝑥𝐴𝜑} ∩ 𝐵) = ({𝑥 ∣ (𝑥𝐴𝜑)} ∩ {𝑥𝑥𝐵})
5 df-rab 2357 . . 3 {𝑥 ∈ (𝐴𝐵) ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ (𝐴𝐵) ∧ 𝜑)}
6 inab 3232 . . . 4 ({𝑥 ∣ (𝑥𝐴𝜑)} ∩ {𝑥𝑥𝐵}) = {𝑥 ∣ ((𝑥𝐴𝜑) ∧ 𝑥𝐵)}
7 elin 3155 . . . . . . 7 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
87anbi1i 445 . . . . . 6 ((𝑥 ∈ (𝐴𝐵) ∧ 𝜑) ↔ ((𝑥𝐴𝑥𝐵) ∧ 𝜑))
9 an32 526 . . . . . 6 (((𝑥𝐴𝑥𝐵) ∧ 𝜑) ↔ ((𝑥𝐴𝜑) ∧ 𝑥𝐵))
108, 9bitri 182 . . . . 5 ((𝑥 ∈ (𝐴𝐵) ∧ 𝜑) ↔ ((𝑥𝐴𝜑) ∧ 𝑥𝐵))
1110abbii 2194 . . . 4 {𝑥 ∣ (𝑥 ∈ (𝐴𝐵) ∧ 𝜑)} = {𝑥 ∣ ((𝑥𝐴𝜑) ∧ 𝑥𝐵)}
126, 11eqtr4i 2104 . . 3 ({𝑥 ∣ (𝑥𝐴𝜑)} ∩ {𝑥𝑥𝐵}) = {𝑥 ∣ (𝑥 ∈ (𝐴𝐵) ∧ 𝜑)}
135, 12eqtr4i 2104 . 2 {𝑥 ∈ (𝐴𝐵) ∣ 𝜑} = ({𝑥 ∣ (𝑥𝐴𝜑)} ∩ {𝑥𝑥𝐵})
144, 13eqtr4i 2104 1 ({𝑥𝐴𝜑} ∩ 𝐵) = {𝑥 ∈ (𝐴𝐵) ∣ 𝜑}
Colors of variables: wff set class
Syntax hints:  wa 102   = wceq 1284  wcel 1433  {cab 2067  {crab 2352  cin 2972
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-rab 2357  df-v 2603  df-in 2979
This theorem is referenced by:  iooval2  8938  fzval2  9032
  Copyright terms: Public domain W3C validator