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

Theorem iotacl 5106
Description: Membership law for descriptions.

This can useful for expanding an unbounded iota-based definition (see df-iota 5083).

(Contributed by Andrew Salmon, 1-Aug-2011.)

Assertion
Ref Expression
iotacl  |-  ( E! x ph  ->  ( iota x ph )  e. 
{ x  |  ph } )

Proof of Theorem iotacl
StepHypRef Expression
1 iota4 5101 . 2  |-  ( E! x ph  ->  [. ( iota x ph )  /  x ]. ph )
2 df-sbc 2905 . 2  |-  ( [. ( iota x ph )  /  x ]. ph  <->  ( iota x ph )  e.  {
x  |  ph }
)
31, 2sylib 121 1  |-  ( E! x ph  ->  ( iota x ph )  e. 
{ x  |  ph } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 1480   E!weu 1997   {cab 2123   [.wsbc 2904   iotacio 5081
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-rex 2420  df-v 2683  df-sbc 2905  df-un 3070  df-sn 3528  df-pr 3529  df-uni 3732  df-iota 5083
This theorem is referenced by:  riotacl2  5736  eroprf  6515
  Copyright terms: Public domain W3C validator