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

Theorem moexexv 1479
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 1007 . 2 |- (ph -> A.yph)
21moexex 1478 1 |- ((E*xph /\ A.xE*yps) -> E*yE.x(ph /\ ps))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 221  A.wal 990  E.wex 1016  E*wmo 1420
This theorem is referenced by:  mosub 1968  funco 3655  spwval2 8915
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 998  ax-gen 999  ax-8 1000  ax-10 1002  ax-11 1003  ax-12 1004  ax-17 1007  ax-4 1009  ax-5o 1011  ax-6o 1014  ax-9o 1159  ax-10o 1177  ax-16 1247  ax-11o 1255
This theorem depends on definitions:  df-bi 145  df-or 222  df-an 223  df-ex 1017  df-sb 1209  df-eu 1421  df-mo 1422
Copyright terms: Public domain