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

Theorem inrab2 3395
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 2453 . . 3 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
2 abid2 2287 . . . 4 {𝑥𝑥𝐵} = 𝐵
32eqcomi 2169 . . 3 𝐵 = {𝑥𝑥𝐵}
41, 3ineq12i 3321 . 2 ({𝑥𝐴𝜑} ∩ 𝐵) = ({𝑥 ∣ (𝑥𝐴𝜑)} ∩ {𝑥𝑥𝐵})
5 df-rab 2453 . . 3 {𝑥 ∈ (𝐴𝐵) ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ (𝐴𝐵) ∧ 𝜑)}
6 inab 3390 . . . 4 ({𝑥 ∣ (𝑥𝐴𝜑)} ∩ {𝑥𝑥𝐵}) = {𝑥 ∣ ((𝑥𝐴𝜑) ∧ 𝑥𝐵)}
7 elin 3305 . . . . . . 7 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
87anbi1i 454 . . . . . 6 ((𝑥 ∈ (𝐴𝐵) ∧ 𝜑) ↔ ((𝑥𝐴𝑥𝐵) ∧ 𝜑))
9 an32 552 . . . . . 6 (((𝑥𝐴𝑥𝐵) ∧ 𝜑) ↔ ((𝑥𝐴𝜑) ∧ 𝑥𝐵))
108, 9bitri 183 . . . . 5 ((𝑥 ∈ (𝐴𝐵) ∧ 𝜑) ↔ ((𝑥𝐴𝜑) ∧ 𝑥𝐵))
1110abbii 2282 . . . 4 {𝑥 ∣ (𝑥 ∈ (𝐴𝐵) ∧ 𝜑)} = {𝑥 ∣ ((𝑥𝐴𝜑) ∧ 𝑥𝐵)}
126, 11eqtr4i 2189 . . 3 ({𝑥 ∣ (𝑥𝐴𝜑)} ∩ {𝑥𝑥𝐵}) = {𝑥 ∣ (𝑥 ∈ (𝐴𝐵) ∧ 𝜑)}
135, 12eqtr4i 2189 . 2 {𝑥 ∈ (𝐴𝐵) ∣ 𝜑} = ({𝑥 ∣ (𝑥𝐴𝜑)} ∩ {𝑥𝑥𝐵})
144, 13eqtr4i 2189 1 ({𝑥𝐴𝜑} ∩ 𝐵) = {𝑥 ∈ (𝐴𝐵) ∣ 𝜑}
Colors of variables: wff set class
Syntax hints:  wa 103   = wceq 1343  wcel 2136  {cab 2151  {crab 2448  cin 3115
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-rab 2453  df-v 2728  df-in 3122
This theorem is referenced by:  iooval2  9851  fzval2  9947  dfphi2  12152  znnen  12331
  Copyright terms: Public domain W3C validator