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

Theorem 2moex 1433
Description: Double quantification with "at most one."
Assertion
Ref Expression
2moex |- (E*xE.yph -> A.yE*xph)

Proof of Theorem 2moex
StepHypRef Expression
1 hbe1 1012 . . 3 |- (E.yph -> A.yE.yph)
21hbmo 1400 . 2 |- (E*xE.yph -> A.yE*xE.yph)
3 19.8a 1025 . . 3 |- (ph -> E.yph)
43immoi 1411 . 2 |- (E*xE.yph -> E*xph)
52, 419.21ai 995 1 |- (E*xE.yph -> A.yE*xph)
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 951  E.wex 977  E*wmo 1374
This theorem is referenced by:  2euex 1434  2eu2 1443  2eu5 1446
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376
Copyright terms: Public domain