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

Theorem iotanul 5191
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 2029 . . 3  |-  ( E! x ph  <->  E. z A. x ( ph  <->  x  =  z ) )
2 dfiota2 5177 . . . 4  |-  ( iota
x ph )  =  U. { z  |  A. x ( ph  <->  x  =  z ) }
3 alnex 1499 . . . . . . 7  |-  ( A. z  -.  A. x (
ph 
<->  x  =  z )  <->  -.  E. z A. x
( ph  <->  x  =  z
) )
4 ax-in2 615 . . . . . . . . . 10  |-  ( -. 
A. x ( ph  <->  x  =  z )  -> 
( A. x (
ph 
<->  x  =  z )  ->  -.  z  =  z ) )
54alimi 1455 . . . . . . . . 9  |-  ( A. z  -.  A. x (
ph 
<->  x  =  z )  ->  A. z ( A. x ( ph  <->  x  =  z )  ->  -.  z  =  z )
)
6 ss2ab 3223 . . . . . . . . 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 3424 . . . . . . . 8  |-  (/)  =  {
z  |  -.  z  =  z }
97, 8sseqtrrdi 3204 . . . . . . 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 3833 . . . . 5  |-  ( -. 
E. z A. x
( ph  <->  x  =  z
)  ->  U. { z  |  A. x (
ph 
<->  x  =  z ) }  C_  U. (/) )
12 uni0 3836 . . . . 5  |-  U. (/)  =  (/)
1311, 12sseqtrdi 3203 . . . 4  |-  ( -. 
E. z A. x
( ph  <->  x  =  z
)  ->  U. { z  |  A. x (
ph 
<->  x  =  z ) }  C_  (/) )
142, 13eqsstrid 3201 . . 3  |-  ( -. 
E. z A. x
( ph  <->  x  =  z
)  ->  ( iota x ph )  C_  (/) )
151, 14sylnbi 678 . 2  |-  ( -.  E! x ph  ->  ( iota x ph )  C_  (/) )
16 ss0 3463 . 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 1351    = wceq 1353   E.wex 1492   E!weu 2026   {cab 2163    C_ wss 3129   (/)c0 3422   U.cuni 3809   iotacio 5174
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-dif 3131  df-in 3135  df-ss 3142  df-nul 3423  df-sn 3598  df-uni 3810  df-iota 5176
This theorem is referenced by:  tz6.12-2  5504  0fv  5548  riotaund  5861  0g0  12726
  Copyright terms: Public domain W3C validator