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

Theorem euor 1926
Description: Introduce a disjunct into a uniqueness quantifier. (Contributed by NM, 21-Oct-2005.)
Hypothesis
Ref Expression
euor.1  |-  ( ph  ->  A. x ph )
Assertion
Ref Expression
euor  |-  ( ( -.  ph  /\  E! x ps )  ->  E! x
( ph  \/  ps ) )

Proof of Theorem euor
StepHypRef Expression
1 euor.1 . . . 4  |-  ( ph  ->  A. x ph )
21hbn 1544 . . 3  |-  ( -. 
ph  ->  A. x  -.  ph )
3 biorf 663 . . 3  |-  ( -. 
ph  ->  ( ps  <->  ( ph  \/  ps ) ) )
42, 3eubidh 1906 . 2  |-  ( -. 
ph  ->  ( E! x ps 
<->  E! x ( ph  \/  ps ) ) )
54biimpa 280 1  |-  ( ( -.  ph  /\  E! x ps )  ->  E! x
( ph  \/  ps ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 97    \/ wo 629   A.wal 1241   E!weu 1900
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-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-4 1400  ax-17 1419  ax-ial 1427
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-fal 1249  df-eu 1903
This theorem is referenced by:  euorv  1927
  Copyright terms: Public domain W3C validator