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

Theorem mobid 1983
Description: Formula-building rule for "at most one" quantifier (deduction form). (Contributed by NM, 8-Mar-1995.)
Hypotheses
Ref Expression
mobid.1  |-  F/ x ph
mobid.2  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
mobid  |-  ( ph  ->  ( E* x ps  <->  E* x ch ) )

Proof of Theorem mobid
StepHypRef Expression
1 mobid.1 . . . 4  |-  F/ x ph
2 mobid.2 . . . 4  |-  ( ph  ->  ( ps  <->  ch )
)
31, 2exbid 1552 . . 3  |-  ( ph  ->  ( E. x ps  <->  E. x ch ) )
41, 2eubid 1955 . . 3  |-  ( ph  ->  ( E! x ps  <->  E! x ch ) )
53, 4imbi12d 232 . 2  |-  ( ph  ->  ( ( E. x ps  ->  E! x ps )  <->  ( E. x ch  ->  E! x ch ) ) )
6 df-mo 1952 . 2  |-  ( E* x ps  <->  ( E. x ps  ->  E! x ps ) )
7 df-mo 1952 . 2  |-  ( E* x ch  <->  ( E. x ch  ->  E! x ch ) )
85, 6, 73bitr4g 221 1  |-  ( ph  ->  ( E* x ps  <->  E* x ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 103   F/wnf 1394   E.wex 1426   E!weu 1948   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-5 1381  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-4 1445  ax-17 1464  ax-ial 1472
This theorem depends on definitions:  df-bi 115  df-nf 1395  df-eu 1951  df-mo 1952
This theorem is referenced by:  mobidv  1984  rmobida  2553  rmoeq1f  2561
  Copyright terms: Public domain W3C validator