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

Theorem moexexv 1437
Description: "At most one" double quantification.
Assertion
Ref Expression
moexexv |- ((E*xph /\ A.xE*yps) -> E*yE.x(ph /\ ps))
Distinct variable group:   ph,y

Proof of Theorem moexexv
StepHypRef Expression
1 ax-17 969 . 2 |- (ph -> A.yph)
21moexex 1436 1 |- ((E*xph /\ A.xE*yps) -> E*yE.x(ph /\ ps))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223  A.wal 952  E.wex 978  E*wmo 1379
This theorem is referenced by:  mosub 1918  funco 3542  spwval2 8595
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381
Copyright terms: Public domain