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

Theorem mo3 2002
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 1457 . 2  |-  ( ph  ->  A. y ph )
32mo3h 2001 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 102    <-> wb 103   A.wal 1287   F/wnf 1394   [wsb 1692   E*wmo 1949
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473
This theorem depends on definitions:  df-bi 115  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952
This theorem is referenced by:  sbmo  2007  rmo3f  2810  rmo3  2928  isarep2  5087
  Copyright terms: Public domain W3C validator