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

Theorem iotanul 5333
Description: Theorem 8.22 in [Quine] p. 57. This theorem is the result if there isn't exactly one  x that satisfies  ph. (Contributed by Andrew Salmon, 11-Jul-2011.)
Assertion
Ref Expression
iotanul  |-  ( -.  E! x ph  ->  ( iota x ph )  =  (/) )

Proof of Theorem iotanul
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 df-eu 2085 . . 3  |-  ( E! x ph  <->  E. z A. x ( ph  <->  x  =  z ) )
2 dfiota2 5318 . . . 4  |-  ( iota
x ph )  =  U. { z  |  A. x ( ph  <->  x  =  z ) }
3 alnex 1548 . . . . . . 7  |-  ( A. z  -.  A. x (
ph 
<->  x  =  z )  <->  -.  E. z A. x
( ph  <->  x  =  z
) )
4 ax-in2 620 . . . . . . . . . 10  |-  ( -. 
A. x ( ph  <->  x  =  z )  -> 
( A. x (
ph 
<->  x  =  z )  ->  -.  z  =  z ) )
54alimi 1504 . . . . . . . . 9  |-  ( A. z  -.  A. x (
ph 
<->  x  =  z )  ->  A. z ( A. x ( ph  <->  x  =  z )  ->  -.  z  =  z )
)
6 ss2ab 3310 . . . . . . . . 9  |-  ( { z  |  A. x
( ph  <->  x  =  z
) }  C_  { z  |  -.  z  =  z }  <->  A. z
( A. x (
ph 
<->  x  =  z )  ->  -.  z  =  z ) )
75, 6sylibr 134 . . . . . . . 8  |-  ( A. z  -.  A. x (
ph 
<->  x  =  z )  ->  { z  | 
A. x ( ph  <->  x  =  z ) } 
C_  { z  |  -.  z  =  z } )
8 dfnul2 3514 . . . . . . . 8  |-  (/)  =  {
z  |  -.  z  =  z }
97, 8sseqtrrdi 3291 . . . . . . 7  |-  ( A. z  -.  A. x (
ph 
<->  x  =  z )  ->  { z  | 
A. x ( ph  <->  x  =  z ) } 
C_  (/) )
103, 9sylbir 135 . . . . . 6  |-  ( -. 
E. z A. x
( ph  <->  x  =  z
)  ->  { z  |  A. x ( ph  <->  x  =  z ) } 
C_  (/) )
1110unissd 3943 . . . . 5  |-  ( -. 
E. z A. x
( ph  <->  x  =  z
)  ->  U. { z  |  A. x (
ph 
<->  x  =  z ) }  C_  U. (/) )
12 uni0 3946 . . . . 5  |-  U. (/)  =  (/)
1311, 12sseqtrdi 3290 . . . 4  |-  ( -. 
E. z A. x
( ph  <->  x  =  z
)  ->  U. { z  |  A. x (
ph 
<->  x  =  z ) }  C_  (/) )
142, 13eqsstrid 3288 . . 3  |-  ( -. 
E. z A. x
( ph  <->  x  =  z
)  ->  ( iota x ph )  C_  (/) )
151, 14sylnbi 685 . 2  |-  ( -.  E! x ph  ->  ( iota x ph )  C_  (/) )
16 ss0 3553 . 2  |-  ( ( iota x ph )  C_  (/)  ->  ( iota x ph )  =  (/) )
1715, 16syl 14 1  |-  ( -.  E! x ph  ->  ( iota x ph )  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 105   A.wal 1396    = wceq 1398   E.wex 1541   E!weu 2082   {cab 2220    C_ wss 3214   (/)c0 3512   U.cuni 3919   iotacio 5315
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-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-dif 3216  df-in 3220  df-ss 3227  df-nul 3513  df-sn 3700  df-uni 3920  df-iota 5317
This theorem is referenced by:  tz6.12-2  5666  0fv  5713  riotaund  6048  0g0  13639
  Copyright terms: Public domain W3C validator