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

Theorem mobid 1932
Description: Formula-building rule for "at most one" quantifier (deduction rule). (Contributed by NM, 8-Mar-1995.)
Hypotheses
Ref Expression
mobid.1  F/
mobid.2
Assertion
Ref Expression
mobid

Proof of Theorem mobid
StepHypRef Expression
1 mobid.1 . . . 4  F/
2 mobid.2 . . . 4
31, 2exbid 1504 . . 3
41, 2eubid 1904 . . 3
53, 4imbi12d 223 . 2
6 df-mo 1901 . 2
7 df-mo 1901 . 2
85, 6, 73bitr4g 212 1
Colors of variables: wff set class
Syntax hints:   wi 4   wb 98   F/wnf 1346  wex 1378  weu 1897  wmo 1898
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1333  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-4 1397  ax-17 1416  ax-ial 1424
This theorem depends on definitions:  df-bi 110  df-nf 1347  df-eu 1900  df-mo 1901
This theorem is referenced by:  mobidv  1933  rmobida  2490  rmoeq1f  2498
  Copyright terms: Public domain W3C validator