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

Theorem abid2f 2334
Description: A simplification of class abstraction. Theorem 5.2 of [Quine] p. 35. (Contributed by NM, 5-Sep-2011.) (Revised by Mario Carneiro, 7-Oct-2016.)
Hypothesis
Ref Expression
abid2f.1  |-  F/_ x A
Assertion
Ref Expression
abid2f  |-  { x  |  x  e.  A }  =  A

Proof of Theorem abid2f
StepHypRef Expression
1 abid2f.1 . . . . 5  |-  F/_ x A
2 nfab1 2310 . . . . 5  |-  F/_ x { x  |  x  e.  A }
31, 2cleqf 2333 . . . 4  |-  ( A  =  { x  |  x  e.  A }  <->  A. x ( x  e.  A  <->  x  e.  { x  |  x  e.  A } ) )
4 abid 2153 . . . . . 6  |-  ( x  e.  { x  |  x  e.  A }  <->  x  e.  A )
54bibi2i 226 . . . . 5  |-  ( ( x  e.  A  <->  x  e.  { x  |  x  e.  A } )  <->  ( x  e.  A  <->  x  e.  A
) )
65albii 1458 . . . 4  |-  ( A. x ( x  e.  A  <->  x  e.  { x  |  x  e.  A } )  <->  A. x
( x  e.  A  <->  x  e.  A ) )
73, 6bitri 183 . . 3  |-  ( A  =  { x  |  x  e.  A }  <->  A. x ( x  e.  A  <->  x  e.  A
) )
8 biid 170 . . 3  |-  ( x  e.  A  <->  x  e.  A )
97, 8mpgbir 1441 . 2  |-  A  =  { x  |  x  e.  A }
109eqcomi 2169 1  |-  { x  |  x  e.  A }  =  A
Colors of variables: wff set class
Syntax hints:    <-> wb 104   A.wal 1341    = wceq 1343    e. wcel 2136   {cab 2151   F/_wnfc 2295
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
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator