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

Theorem abid2f 2345
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 2321 . . . . 5  |-  F/_ x { x  |  x  e.  A }
31, 2cleqf 2344 . . . 4  |-  ( A  =  { x  |  x  e.  A }  <->  A. x ( x  e.  A  <->  x  e.  { x  |  x  e.  A } ) )
4 abid 2165 . . . . . 6  |-  ( x  e.  { x  |  x  e.  A }  <->  x  e.  A )
54bibi2i 227 . . . . 5  |-  ( ( x  e.  A  <->  x  e.  { x  |  x  e.  A } )  <->  ( x  e.  A  <->  x  e.  A
) )
65albii 1470 . . . 4  |-  ( A. x ( x  e.  A  <->  x  e.  { x  |  x  e.  A } )  <->  A. x
( x  e.  A  <->  x  e.  A ) )
73, 6bitri 184 . . 3  |-  ( A  =  { x  |  x  e.  A }  <->  A. x ( x  e.  A  <->  x  e.  A
) )
8 biid 171 . . 3  |-  ( x  e.  A  <->  x  e.  A )
97, 8mpgbir 1453 . 2  |-  A  =  { x  |  x  e.  A }
109eqcomi 2181 1  |-  { x  |  x  e.  A }  =  A
Colors of variables: wff set class
Syntax hints:    <-> wb 105   A.wal 1351    = wceq 1353    e. wcel 2148   {cab 2163   F/_wnfc 2306
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator