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

Theorem mo3 2134
Description: Alternate definition of "at most one". Definition of [BellMachover] p. 460, except that definition has the side condition that  y not occur in  ph in place of our hypothesis. (Contributed by NM, 8-Mar-1995.)
Hypothesis
Ref Expression
mo3.1  |-  F/ y
ph
Assertion
Ref Expression
mo3  |-  ( E* x ph  <->  A. x A. y ( ( ph  /\ 
[ y  /  x ] ph )  ->  x  =  y ) )
Distinct variable group:    x, y
Allowed substitution hints:    ph( x, y)

Proof of Theorem mo3
StepHypRef Expression
1 mo3.1 . . 3  |-  F/ y
ph
21nfri 1568 . 2  |-  ( ph  ->  A. y ph )
32mo3h 2133 1  |-  ( E* x ph  <->  A. x A. y ( ( ph  /\ 
[ y  /  x ] ph )  ->  x  =  y ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1396   F/wnf 1509   [wsb 1810   E*wmo 2080
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-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
This theorem depends on definitions:  df-bi 117  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083
This theorem is referenced by:  sbmo  2139  rmo3f  3004  rmo3  3125  isarep2  5424  modom  7037
  Copyright terms: Public domain W3C validator