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

Theorem rabid 2502
Description: An "identity" law of concretion for restricted abstraction. Special case of Definition 2.1 of [Quine] p. 16. (Contributed by NM, 9-Oct-2003.)
Assertion
Ref Expression
rabid (𝑥 ∈ {𝑥𝐴𝜑} ↔ (𝑥𝐴𝜑))

Proof of Theorem rabid
StepHypRef Expression
1 df-rab 2332 . 2 {𝑥𝐴𝜑} = {𝑥 ∣ (𝑥𝐴𝜑)}
21abeq2i 2164 1 (𝑥 ∈ {𝑥𝐴𝜑} ↔ (𝑥𝐴𝜑))
Colors of variables: wff set class
Syntax hints:  wa 101  wb 102  wcel 1409  {crab 2327
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-5 1352  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-ext 2038
This theorem depends on definitions:  df-bi 114  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-rab 2332
This theorem is referenced by:  rabeq2i  2571  rabn0m  3273  repizf2lem  3942  rabxfrd  4229  onintrab2im  4272  tfis  4334
  Copyright terms: Public domain W3C validator