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

Theorem iotacl 5119
Description: Membership law for descriptions.

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

(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 5114 . 2  |-  ( E! x ph  ->  [. ( iota x ph )  /  x ]. ph )
2 df-sbc 2914 . 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 1481   E!weu 2000   {cab 2126   [.wsbc 2913   iotacio 5094
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 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-rex 2423  df-v 2691  df-sbc 2914  df-un 3080  df-sn 3538  df-pr 3539  df-uni 3745  df-iota 5096
This theorem is referenced by:  riotacl2  5751  eroprf  6530
  Copyright terms: Public domain W3C validator