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

Theorem mopick 2075
Description: "At most one" picks a variable value, eliminating an existential quantifier. (Contributed by NM, 27-Jan-1997.)
Assertion
Ref Expression
mopick  |-  ( ( E* x ph  /\  E. x ( ph  /\  ps ) )  ->  ( ph  ->  ps ) )

Proof of Theorem mopick
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 ax-17 1506 . . . 4  |-  ( (
ph  /\  ps )  ->  A. y ( ph  /\ 
ps ) )
2 hbs1 1909 . . . . 5  |-  ( [ y  /  x ] ph  ->  A. x [ y  /  x ] ph )
3 hbs1 1909 . . . . 5  |-  ( [ y  /  x ] ps  ->  A. x [ y  /  x ] ps )
42, 3hban 1526 . . . 4  |-  ( ( [ y  /  x ] ph  /\  [ y  /  x ] ps )  ->  A. x ( [ y  /  x ] ph  /\  [ y  /  x ] ps ) )
5 sbequ12 1744 . . . . 5  |-  ( x  =  y  ->  ( ph 
<->  [ y  /  x ] ph ) )
6 sbequ12 1744 . . . . 5  |-  ( x  =  y  ->  ( ps 
<->  [ y  /  x ] ps ) )
75, 6anbi12d 464 . . . 4  |-  ( x  =  y  ->  (
( ph  /\  ps )  <->  ( [ y  /  x ] ph  /\  [ y  /  x ] ps ) ) )
81, 4, 7cbvexh 1728 . . 3  |-  ( E. x ( ph  /\  ps )  <->  E. y ( [ y  /  x ] ph  /\  [ y  /  x ] ps ) )
9 ax-17 1506 . . . . . . 7  |-  ( ph  ->  A. y ph )
109mo3h 2050 . . . . . 6  |-  ( E* x ph  <->  A. x A. y ( ( ph  /\ 
[ y  /  x ] ph )  ->  x  =  y ) )
11 ax-4 1487 . . . . . . 7  |-  ( A. y ( ( ph  /\ 
[ y  /  x ] ph )  ->  x  =  y )  -> 
( ( ph  /\  [ y  /  x ] ph )  ->  x  =  y ) )
1211sps 1517 . . . . . 6  |-  ( A. x A. y ( (
ph  /\  [ y  /  x ] ph )  ->  x  =  y )  ->  ( ( ph  /\ 
[ y  /  x ] ph )  ->  x  =  y ) )
1310, 12sylbi 120 . . . . 5  |-  ( E* x ph  ->  (
( ph  /\  [ y  /  x ] ph )  ->  x  =  y ) )
14 sbequ2 1742 . . . . . . . . 9  |-  ( x  =  y  ->  ( [ y  /  x ] ps  ->  ps )
)
1514imim2i 12 . . . . . . . 8  |-  ( ( ( ph  /\  [
y  /  x ] ph )  ->  x  =  y )  ->  (
( ph  /\  [ y  /  x ] ph )  ->  ( [ y  /  x ] ps  ->  ps ) ) )
1615expd 256 . . . . . . 7  |-  ( ( ( ph  /\  [
y  /  x ] ph )  ->  x  =  y )  ->  ( ph  ->  ( [ y  /  x ] ph  ->  ( [ y  /  x ] ps  ->  ps ) ) ) )
1716com4t 85 . . . . . 6  |-  ( [ y  /  x ] ph  ->  ( [ y  /  x ] ps  ->  ( ( ( ph  /\ 
[ y  /  x ] ph )  ->  x  =  y )  -> 
( ph  ->  ps )
) ) )
1817imp 123 . . . . 5  |-  ( ( [ y  /  x ] ph  /\  [ y  /  x ] ps )  ->  ( ( (
ph  /\  [ y  /  x ] ph )  ->  x  =  y )  ->  ( ph  ->  ps ) ) )
1913, 18syl5 32 . . . 4  |-  ( ( [ y  /  x ] ph  /\  [ y  /  x ] ps )  ->  ( E* x ph  ->  ( ph  ->  ps ) ) )
2019exlimiv 1577 . . 3  |-  ( E. y ( [ y  /  x ] ph  /\ 
[ y  /  x ] ps )  ->  ( E* x ph  ->  ( ph  ->  ps ) ) )
218, 20sylbi 120 . 2  |-  ( E. x ( ph  /\  ps )  ->  ( E* x ph  ->  ( ph  ->  ps ) ) )
2221impcom 124 1  |-  ( ( E* x ph  /\  E. x ( ph  /\  ps ) )  ->  ( ph  ->  ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103   A.wal 1329   E.wex 1468   [wsb 1735   E*wmo 1998
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
This theorem depends on definitions:  df-bi 116  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001
This theorem is referenced by:  eupick  2076  mopick2  2080  moexexdc  2081  euexex  2082  morex  2863  imadif  5198  funimaexglem  5201
  Copyright terms: Public domain W3C validator