Metamath Proof Explorer


Theorem bj-cbveximt

Description: A lemma in closed form used to prove bj-cbvex in a weak axiomatization. (Contributed by BJ, 12-Mar-2023) Do not use 19.35 since only the direction of the biconditional used here holds in intuitionistic logic. (Proof modification is discouraged.)

Ref Expression
Assertion bj-cbveximt xyχxyχφψxφyφxyψyψxφyψ

Proof

Step Hyp Ref Expression
1 bj-exalim yχφψyχyφyψ
2 1 alimi xyχφψxyχyφyψ
3 bj-alexim xyχyφyψxyχxyφxyψ
4 2 3 syl xyχφψxyχxyφxyψ
5 exim xφyφxφxyφ
6 imim2 xyφxyψxφxyφxφxyψ
7 imim1 xφxyψxyψyψxφyψ
8 5 6 7 syl56 xyφxyψxφyφxyψyψxφyψ
9 4 8 syl6com xyχxyχφψxφyφxyψyψxφyψ