bexim<

Theorem.

Arguments:

(sv), (pr), (pr),

Hypotheses:

( bound in )

Assertions:

(()())

Proof:

Hyp	Ref	Line	Expr
	Hypo	1	( bound in )
	bexim	2	(()())
1	fv.eqal	3	()
3	bi.bldim<	4	(()())
2, 4	><bitr	5	(()())