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

Theorem iotaval 5164
Description: Theorem 8.19 in [Quine] p. 57. This theorem is the fundamental property of iota. (Contributed by Andrew Salmon, 11-Jul-2011.)
Assertion
Ref Expression
iotaval  |-  ( A. x ( ph  <->  x  =  y )  ->  ( iota x ph )  =  y )
Distinct variable group:    x, y
Allowed substitution hints:    ph( x, y)

Proof of Theorem iotaval
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 dfiota2 5154 . 2  |-  ( iota
x ph )  =  U. { z  |  A. x ( ph  <->  x  =  z ) }
2 vex 2729 . . . . . . 7  |-  y  e. 
_V
3 sbeqalb 3007 . . . . . . . 8  |-  ( y  e.  _V  ->  (
( A. x (
ph 
<->  x  =  y )  /\  A. x (
ph 
<->  x  =  z ) )  ->  y  =  z ) )
4 equcomi 1692 . . . . . . . 8  |-  ( y  =  z  ->  z  =  y )
53, 4syl6 33 . . . . . . 7  |-  ( y  e.  _V  ->  (
( A. x (
ph 
<->  x  =  y )  /\  A. x (
ph 
<->  x  =  z ) )  ->  z  =  y ) )
62, 5ax-mp 5 . . . . . 6  |-  ( ( A. x ( ph  <->  x  =  y )  /\  A. x ( ph  <->  x  =  z ) )  -> 
z  =  y )
76ex 114 . . . . 5  |-  ( A. x ( ph  <->  x  =  y )  ->  ( A. x ( ph  <->  x  =  z )  ->  z  =  y ) )
8 equequ2 1701 . . . . . . . . . 10  |-  ( y  =  z  ->  (
x  =  y  <->  x  =  z ) )
98equcoms 1696 . . . . . . . . 9  |-  ( z  =  y  ->  (
x  =  y  <->  x  =  z ) )
109bibi2d 231 . . . . . . . 8  |-  ( z  =  y  ->  (
( ph  <->  x  =  y
)  <->  ( ph  <->  x  =  z ) ) )
1110biimpd 143 . . . . . . 7  |-  ( z  =  y  ->  (
( ph  <->  x  =  y
)  ->  ( ph  <->  x  =  z ) ) )
1211alimdv 1867 . . . . . 6  |-  ( z  =  y  ->  ( A. x ( ph  <->  x  =  y )  ->  A. x
( ph  <->  x  =  z
) ) )
1312com12 30 . . . . 5  |-  ( A. x ( ph  <->  x  =  y )  ->  (
z  =  y  ->  A. x ( ph  <->  x  =  z ) ) )
147, 13impbid 128 . . . 4  |-  ( A. x ( ph  <->  x  =  y )  ->  ( A. x ( ph  <->  x  =  z )  <->  z  =  y ) )
1514alrimiv 1862 . . 3  |-  ( A. x ( ph  <->  x  =  y )  ->  A. z
( A. x (
ph 
<->  x  =  z )  <-> 
z  =  y ) )
16 uniabio 5163 . . 3  |-  ( A. z ( A. x
( ph  <->  x  =  z
)  <->  z  =  y )  ->  U. { z  |  A. x (
ph 
<->  x  =  z ) }  =  y )
1715, 16syl 14 . 2  |-  ( A. x ( ph  <->  x  =  y )  ->  U. {
z  |  A. x
( ph  <->  x  =  z
) }  =  y )
181, 17syl5eq 2211 1  |-  ( A. x ( ph  <->  x  =  y )  ->  ( iota x ph )  =  y )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104   A.wal 1341    = wceq 1343    e. wcel 2136   {cab 2151   _Vcvv 2726   U.cuni 3789   iotacio 5151
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  df-rex 2450  df-v 2728  df-sbc 2952  df-un 3120  df-sn 3582  df-pr 3583  df-uni 3790  df-iota 5153
This theorem is referenced by:  iotauni  5165  iota1  5167  euiotaex  5169  iota4  5171  iota5  5173
  Copyright terms: Public domain W3C validator