Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-stdpc5t | Structured version Visualization version GIF version |
Description: Alias of bj-nnf-alrim 34933 for labeling consistency (a standard predicate calculus axiom). Closed form of stdpc5 2205 proved from modalK (obsoleting stdpc5v 1945). (Contributed by BJ, 2-Dec-2023.) Use bj-nnf-alrim 34933 instead. (New usaged is discouraged.) |
Ref | Expression |
---|---|
bj-stdpc5t | ⊢ (Ⅎ'𝑥𝜑 → (∀𝑥(𝜑 → 𝜓) → (𝜑 → ∀𝑥𝜓))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bj-nnf-alrim 34933 | 1 ⊢ (Ⅎ'𝑥𝜑 → (∀𝑥(𝜑 → 𝜓) → (𝜑 → ∀𝑥𝜓))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1540 Ⅎ'wnnf 34901 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-4 1816 |
This theorem depends on definitions: df-bi 206 df-an 397 df-bj-nnf 34902 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |