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

Theorem iotanul 5230
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 2045 . . 3  |-  ( E! x ph  <->  E. z A. x ( ph  <->  x  =  z ) )
2 dfiota2 5216 . . . 4  |-  ( iota
x ph )  =  U. { z  |  A. x ( ph  <->  x  =  z ) }
3 alnex 1510 . . . . . . 7  |-  ( A. z  -.  A. x (
ph 
<->  x  =  z )  <->  -.  E. z A. x
( ph  <->  x  =  z
) )
4 ax-in2 616 . . . . . . . . . 10  |-  ( -. 
A. x ( ph  <->  x  =  z )  -> 
( A. x (
ph 
<->  x  =  z )  ->  -.  z  =  z ) )
54alimi 1466 . . . . . . . . 9  |-  ( A. z  -.  A. x (
ph 
<->  x  =  z )  ->  A. z ( A. x ( ph  <->  x  =  z )  ->  -.  z  =  z )
)
6 ss2ab 3247 . . . . . . . . 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 3448 . . . . . . . 8  |-  (/)  =  {
z  |  -.  z  =  z }
97, 8sseqtrrdi 3228 . . . . . . 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 3859 . . . . 5  |-  ( -. 
E. z A. x
( ph  <->  x  =  z
)  ->  U. { z  |  A. x (
ph 
<->  x  =  z ) }  C_  U. (/) )
12 uni0 3862 . . . . 5  |-  U. (/)  =  (/)
1311, 12sseqtrdi 3227 . . . 4  |-  ( -. 
E. z A. x
( ph  <->  x  =  z
)  ->  U. { z  |  A. x (
ph 
<->  x  =  z ) }  C_  (/) )
142, 13eqsstrid 3225 . . 3  |-  ( -. 
E. z A. x
( ph  <->  x  =  z
)  ->  ( iota x ph )  C_  (/) )
151, 14sylnbi 679 . 2  |-  ( -.  E! x ph  ->  ( iota x ph )  C_  (/) )
16 ss0 3487 . 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 1362    = wceq 1364   E.wex 1503   E!weu 2042   {cab 2179    C_ wss 3153   (/)c0 3446   U.cuni 3835   iotacio 5213
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3155  df-in 3159  df-ss 3166  df-nul 3447  df-sn 3624  df-uni 3836  df-iota 5215
This theorem is referenced by:  tz6.12-2  5545  0fv  5590  riotaund  5908  0g0  12959
  Copyright terms: Public domain W3C validator