alexan<>

Theorem.

Arguments:

x (sv), y (sv), phi (pr), psi (pr),

Assertions:

((existsxforallyphiwedgeforallxexistsypsi)toexistsxexistsy(phiwedgepsi))

Proof:

Hyp Ref Line Expr
alexan<1((existsxforallyphiwedgeforallxexistsypsi)toexistsx(forallyphiwedgeexistsypsi))
alexan>2((forallyphiwedgeexistsypsi)toexistsy(phiwedgepsi))
2im.bldex3(existsx(forallyphiwedgeexistsypsi)toexistsxexistsy(phiwedgepsi))
1, 3syl4((existsxforallyphiwedgeforallxexistsypsi)toexistsxexistsy(phiwedgepsi))