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

Theorem mo2icl 2858
Description: Theorem for inferring "at most one." (Contributed by NM, 17-Oct-1996.)
Assertion
Ref Expression
mo2icl  |-  ( A. x ( ph  ->  x  =  A )  ->  E* x ph )
Distinct variable group:    x, A
Allowed substitution hint:    ph( x)

Proof of Theorem mo2icl
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 nfa1 1521 . . . . 5  |-  F/ x A. x ( ph  ->  x  =  A )
2 vex 2684 . . . . . . . 8  |-  x  e. 
_V
3 eleq1 2200 . . . . . . . 8  |-  ( x  =  A  ->  (
x  e.  _V  <->  A  e.  _V ) )
42, 3mpbii 147 . . . . . . 7  |-  ( x  =  A  ->  A  e.  _V )
54imim2i 12 . . . . . 6  |-  ( (
ph  ->  x  =  A )  ->  ( ph  ->  A  e.  _V )
)
65sps 1517 . . . . 5  |-  ( A. x ( ph  ->  x  =  A )  -> 
( ph  ->  A  e. 
_V ) )
71, 6eximd 1591 . . . 4  |-  ( A. x ( ph  ->  x  =  A )  -> 
( E. x ph  ->  E. x  A  e. 
_V ) )
8 19.9v 1843 . . . 4  |-  ( E. x  A  e.  _V  <->  A  e.  _V )
97, 8syl6ib 160 . . 3  |-  ( A. x ( ph  ->  x  =  A )  -> 
( E. x ph  ->  A  e.  _V )
)
10 eqeq2 2147 . . . . . . . 8  |-  ( y  =  A  ->  (
x  =  y  <->  x  =  A ) )
1110imbi2d 229 . . . . . . 7  |-  ( y  =  A  ->  (
( ph  ->  x  =  y )  <->  ( ph  ->  x  =  A ) ) )
1211albidv 1796 . . . . . 6  |-  ( y  =  A  ->  ( A. x ( ph  ->  x  =  y )  <->  A. x
( ph  ->  x  =  A ) ) )
1312imbi1d 230 . . . . 5  |-  ( y  =  A  ->  (
( A. x (
ph  ->  x  =  y )  ->  E* x ph )  <->  ( A. x
( ph  ->  x  =  A )  ->  E* x ph ) ) )
14 nfv 1508 . . . . . . 7  |-  F/ y
ph
1514mo2r 2049 . . . . . 6  |-  ( E. y A. x (
ph  ->  x  =  y )  ->  E* x ph )
161519.23bi 1571 . . . . 5  |-  ( A. x ( ph  ->  x  =  y )  ->  E* x ph )
1713, 16vtoclg 2741 . . . 4  |-  ( A  e.  _V  ->  ( A. x ( ph  ->  x  =  A )  ->  E* x ph ) )
1817com12 30 . . 3  |-  ( A. x ( ph  ->  x  =  A )  -> 
( A  e.  _V  ->  E* x ph )
)
199, 18syld 45 . 2  |-  ( A. x ( ph  ->  x  =  A )  -> 
( E. x ph  ->  E* x ph )
)
20 moabs 2046 . 2  |-  ( E* x ph  <->  ( E. x ph  ->  E* x ph ) )
2119, 20sylibr 133 1  |-  ( A. x ( ph  ->  x  =  A )  ->  E* x ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1329    = wceq 1331   E.wex 1468    e. wcel 1480   E*wmo 1998   _Vcvv 2681
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683
This theorem is referenced by:  invdisj  3918
  Copyright terms: Public domain W3C validator