Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-stdpc5t Structured version   Visualization version   GIF version

Theorem bj-stdpc5t 34173
Description: Alias of bj-nnf-alrim 34160 for labeling consistency (a standard predicate calculus axiom). Closed form of stdpc5 2209 proved from modalK (obsoleting stdpc5v 1939). (Contributed by BJ, 2-Dec-2023.) Use bj-nnf-alrim 34160 instead. (New usaged is discouraged.)
Assertion
Ref Expression
bj-stdpc5t (Ⅎ'𝑥𝜑 → (∀𝑥(𝜑𝜓) → (𝜑 → ∀𝑥𝜓)))

Proof of Theorem bj-stdpc5t
StepHypRef Expression
1 bj-nnf-alrim 34160 1 (Ⅎ'𝑥𝜑 → (∀𝑥(𝜑𝜓) → (𝜑 → ∀𝑥𝜓)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1536  Ⅎ'wnnf 34131
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-4 1811
This theorem depends on definitions:  df-bi 210  df-an 400  df-bj-nnf 34132
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator