HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem euor 1400
Description: Introduce a disjunct into a uniqueness quantifier.
Hypothesis
Ref Expression
euor.1 |- (ph -> A.xph)
Assertion
Ref Expression
euor |- ((-. ph /\ E!xps) -> E!x(ph \/ ps))

Proof of Theorem euor
StepHypRef Expression
1 euor.1 . . . 4 |- (ph -> A.xph)
21hbn 1006 . . 3 |- (-. ph -> A.x -. ph)
3 biorf 737 . . 3 |- (-. ph -> (ps <-> (ph \/ ps)))
42, 3eubid 1387 . 2 |- (-. ph -> (E!xps <-> E!x(ph \/ ps)))
54biimpa 418 1 |- ((-. ph /\ E!xps) -> E!x(ph \/ ps))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   \/ wo 222   /\ wa 223  A.wal 956  E!weu 1382
This theorem is referenced by:  euorv 1401  euor2 1440
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 965  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-eu 1384
Copyright terms: Public domain