Metamath Proof Explorer


Theorem bj-stdpc5t

Description: Alias of bj-nnf-alrim for labeling consistency (a standard predicate calculus axiom). Closed form of stdpc5 proved from modalK (obsoleting stdpc5v ). (Contributed by BJ, 2-Dec-2023) Use bj-nnf-alrim instead. (New usaged is discouraged.)

Ref Expression
Assertion bj-stdpc5t
|- ( F// x ph -> ( A. x ( ph -> ps ) -> ( ph -> A. x ps ) ) )

Proof

Step Hyp Ref Expression
1 bj-nnf-alrim
 |-  ( F// x ph -> ( A. x ( ph -> ps ) -> ( ph -> A. x ps ) ) )