Theorem hbmo 1400

Description: Bound-variable hypothesis builder for "at most one."

Hypothesis

Ref	Expression
hbmo.1	|- (ph -> A.xph)

Assertion

Ref	Expression
hbmo	|- (E*yph -> A.xE*yph)

Proof of Theorem hbmo

Step	Hyp	Ref	Expression
1		hbmo.1	. . . 4 |- (ph -> A.xph)
2	1	hbex 1003	. . 3 |- (E.yph -> A.xE.yph)
3	1	hbeu 1382	. . 3 |- (E!yph -> A.xE!yph)
4	2, 3	hbim 1004	. 2 |- ((E.yph -> E!yph) -> A.x(E.yph -> E!yph))
5		df-mo 1376	. 2 |- (E*yph <-> (E.yph -> E!yph))
6	5	albii 996	. 2 |- (A.xE*yph <-> A.x(E.yph -> E!yph))
7	4, 5, 6	3imtr4 219	1 |- (E*yph -> A.xE*yph)

Syntax hints:   -> wi 3  A.wal 951  E.wex 977  E!weu 1373  E*wmo 1374

This theorem is referenced by:  moexex 1431  2moex 1433  2euex 1434  2exeu 1439  mosubopt 2793  dffunmof 3516

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-12 965  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136

This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 978  df-eu 1375  df-mo 1376

Copyright terms: Public domain