Variant 1: 1st-Order Syntactical Proof Assistant (newchecker.ML)

Bare-bones 1st-order NBG/MK statements about classes enriched with kernel AST sorts (Fm, Stmt, Ctx, Theory, Prf, Class, Set). Generated directly from newchecker.ML.

Formula Display:
Proof Trees:

1. Propositional Logic (1.01–1.14)

Classical propositional calculus axiom schemas (A01–A13) and Modus Ponens.

Num Entity Database Record (Vertical Field Table)
1.01
Title A01 #AxmPropWeakening #label-a01
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA1_prf
Scheme of Types 0(⟦[𝛂@Fm.Expression]βŸ§β†’(⟦[𝛃@Fm.Expression]βŸ§β†’βŸ¦[𝛂@Fm.Expression]⟧))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropWeakening) → · (1.01) · #AxmPropWeakening
1.02
Title A02 #AxmPropFrege #label-a02
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\gamma}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\gamma}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA2_prf
Scheme of Types 0((⟦[𝛂@Fm.Expression]βŸ§β†’(⟦[𝛃@Fm.Expression]βŸ§β†’βŸ¦[𝛄@Fm.Expression]⟧))β†’((⟦[𝛂@Fm.Expression]βŸ§β†’βŸ¦[𝛃@Fm.Expression]⟧)β†’(⟦[𝛂@Fm.Expression]βŸ§β†’βŸ¦[𝛄@Fm.Expression]⟧)))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\gamma}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropFrege) → · (1.02) · #AxmPropFrege
1.03
Title A03 #AxmPropConjLeft #label-a03
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/and-conn.html}{\land} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA3_prf
Scheme of Types 0((⟦[𝛂@Fm.Expression]⟧∧⟦[𝛃@Fm.Expression]⟧)β†’βŸ¦[𝛂@Fm.Expression]⟧)
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropConjLeft) → · (1.03) · #AxmPropConjLeft
1.04
Title A04 #AxmPropConjRight #label-a04
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/and-conn.html}{\land} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA4_prf
Scheme of Types 0((⟦[𝛂@Fm.Expression]⟧∧⟦[𝛃@Fm.Expression]⟧)β†’βŸ¦[𝛃@Fm.Expression]⟧)
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropConjRight) → · (1.04) · #AxmPropConjRight
1.05
Title A05 #AxmPropConjIntro #label-a05
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/and-conn.html}{\land} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA5_prf
Scheme of Types 0(⟦[𝛂@Fm.Expression]βŸ§β†’(⟦[𝛃@Fm.Expression]βŸ§β†’(⟦[𝛂@Fm.Expression]⟧∧⟦[𝛃@Fm.Expression]⟧)))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropConjIntro) → · (1.05) · #AxmPropConjIntro
1.06
Title A06 #AxmPropDisjLeft #label-a06
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/or-conn.html}{\lor} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA6_prf
Scheme of Types 0(⟦[𝛂@Fm.Expression]βŸ§β†’(⟦[𝛂@Fm.Expression]⟧∨⟦[𝛃@Fm.Expression]⟧))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropDisjLeft) → · (1.06) · #AxmPropDisjLeft
1.07
Title A07 #AxmPropDisjRight #label-a07
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/or-conn.html}{\lor} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA7_prf
Scheme of Types 0(⟦[𝛃@Fm.Expression]βŸ§β†’(⟦[𝛂@Fm.Expression]⟧∨⟦[𝛃@Fm.Expression]⟧))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropDisjRight) → · (1.07) · #AxmPropDisjRight
1.08
Title A08 #AxmPropDisjElim #label-a08
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\gamma}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\gamma}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/or-conn.html}{\lor} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\gamma}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA8_prf
Scheme of Types 0((⟦[𝛂@Fm.Expression]βŸ§β†’βŸ¦[𝛄@Fm.Expression]⟧)β†’((⟦[𝛃@Fm.Expression]βŸ§β†’βŸ¦[𝛄@Fm.Expression]⟧)β†’((⟦[𝛂@Fm.Expression]⟧∨⟦[𝛃@Fm.Expression]⟧)β†’βŸ¦[𝛄@Fm.Expression]⟧)))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\gamma}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropDisjElim) → · (1.08) · #AxmPropDisjElim
1.09
Title A09 #AxmPropNegElim #label-a09
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/neg-conn.html}{\neg} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/bot-const.html}{\bot} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA9_prf
Scheme of Types 0((¬⟦[𝛂@Fm.Expression]⟧)β†’(⟦[𝛂@Fm.Expression]βŸ§β†’βŠ₯))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Kernel Note Negation Elimination (Contradiction to Bottom): (Β¬βŸ¦π›‚βŸ§) β†’ (βŸ¦π›‚βŸ§ β†’ βŠ₯).
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropNegElim) → · (1.09) · #AxmPropNegElim
1.10
Title A10 #AxmPropNegIntro #label-a10
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/neg-conn.html}{\neg} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/neg-conn.html}{\neg} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA10_prf
Scheme of Types 0((⟦[𝛂@Fm.Expression]βŸ§β†’βŸ¦[𝛃@Fm.Expression]⟧)β†’((⟦[𝛂@Fm.Expression]βŸ§β†’Β¬βŸ¦[𝛃@Fm.Expression]⟧)β†’Β¬βŸ¦[𝛂@Fm.Expression]⟧))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Kernel Note Negation Introduction (Reductio Ad Absurdum): (βŸ¦π›‚βŸ§ β†’ βŸ¦π›ƒβŸ§) β†’ ((βŸ¦π›‚βŸ§ β†’ Β¬βŸ¦π›ƒβŸ§) β†’ Β¬βŸ¦π›‚βŸ§).
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropNegIntro) → · (1.10) · #AxmPropNegIntro
1.11
Title A11 #AxmPropExFalso #label-a11
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/bot-const.html}{\bot} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA11_prf
Scheme of Types 0(βŠ₯β†’βŸ¦[𝛂@Fm.Expression]⟧)
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropExFalso) → · (1.11) · #AxmPropExFalso
1.12
Title A12 #AxmPropExcludedMiddle #label-a12
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/or-conn.html}{\lor} \href{symbols/neg-conn.html}{\neg} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA12_prf
Scheme of Types 0(⟦[𝛂@Fm.Expression]⟧∨¬⟦[𝛂@Fm.Expression]⟧)
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropExcludedMiddle) → · (1.12) · #AxmPropExcludedMiddle
1.13
Title A13 #AxmPropVerum #label-a13
Classification Axiom
Formula
0\(\href{symbols/top-const.html}{\top} \)
SML Kernel AST PA13_prf
Scheme of Types 0⊀
Kernel Note Verum / Truth Introduction Axiom (⊒ ⊀).
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmPropVerum) → · (1.13) · #AxmPropVerum
1.14
Title Modus Ponens #RulModusPonens #label-modus-ponens
Classification Inference Rule
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PMP_prf
Scheme of Types 0(⟦[𝛂@Fm.Expression]⟧, (⟦[𝛂@Fm.Expression]βŸ§β†’βŸ¦[𝛃@Fm.Expression]⟧) ⊒ ⟦[𝛃@Fm.Expression]⟧)
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Side Condition
1\(\href{symbols/top-const.html}{\top} \)
Verification Primitive / Derived Rule (Kernel) · Standalone Entry (RulModusPonens) → · (1.14) · #RulModusPonens

2. Predicate Logic (2.01–2.06)

First-order quantifier instantiation, abstraction rules, and non-empty discourse domain over Classes.

Num Entity Database Record (Vertical Field Table)
2.01
Title Discourse domain is non-empty #AxmDiscourseNonEmpty #label-discourse-domain-is-non-empty
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/top-const.html}{\top} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PA0_prf
Scheme of Types 0(βˆƒ([K@Variable]:[Class@Type])⊀)
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmDiscourseNonEmpty) → · (2.01) · #AxmDiscourseNonEmpty
2.02
Title Forall Instantiation #RulForallInstantiation #label-forall-instantiation
Classification Inference Rule
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{x} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/typing-colon.html}{:} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{X} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/image-op.html}{[} \href{symbols/variables.html}{t} \href{symbols/subst-slash.html}{/} \href{symbols/variables.html}{x} \href{symbols/image-op.html}{]} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PForaL_prf
Scheme of Types 0((βˆ€([⦃[x@Variable.Expression]⦄@Variable]:[⟦[X@Type.Expression.Expression]⟧@Type])⟦[𝛗@Fm.Expression]⟧)β†’βŸ¦[𝛗@Fm.Expression][[t@LCEWIP]/[x@Variable.Expression]]⟧)
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{t} \href{symbols/typing-colon.html}{:} \href{symbols/variables.html}{X} \href{symbols/dot-delim.html}{.} \href{symbols/expression-sort.html}{\mathsf{Expression}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/type-sort.html}{\mathsf{Type}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/name-sort.html}{\mathsf{Name}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Side Condition
1\(\href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/dot-delim.html}{.} \href{symbols/ffi-pred.html}{\mathrm{FFI}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{t} \href{symbols/typing-colon.html}{:} \href{symbols/variables.html}{X} \href{symbols/dot-delim.html}{.} \href{symbols/expression-sort.html}{\mathsf{Expression}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{x} \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \)
Verification Primitive / Derived Rule (Kernel) · Standalone Entry (RulForallInstantiation) → · (2.02) · #RulForallInstantiation
2.03
Title Exists Instantiation #RulExistsInstantiation #label-exists-instantiation
Classification Inference Rule
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/image-op.html}{[} \href{symbols/variables.html}{t} \href{symbols/subst-slash.html}{/} \href{symbols/variables.html}{x} \href{symbols/image-op.html}{]} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{x} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/typing-colon.html}{:} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{X} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PExisR_prf
Scheme of Types 0(⟦[𝛗@Fm.Expression][[t@LCEWIP]/[x@Variable.Expression]]βŸ§β†’βˆƒ([⦃[x@Variable.Expression]⦄@Variable]:[⟦[X@Type.Expression.Expression]⟧@Type])⟦[𝛗@Fm.Expression]⟧)
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{t} \href{symbols/typing-colon.html}{:} \href{symbols/variables.html}{X} \href{symbols/dot-delim.html}{.} \href{symbols/expression-sort.html}{\mathsf{Expression}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/type-sort.html}{\mathsf{Type}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/name-sort.html}{\mathsf{Name}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Side Condition
1\(\href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/dot-delim.html}{.} \href{symbols/ffi-pred.html}{\mathrm{FFI}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{t} \href{symbols/typing-colon.html}{:} \href{symbols/variables.html}{X} \href{symbols/dot-delim.html}{.} \href{symbols/expression-sort.html}{\mathsf{Expression}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{x} \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \)
Verification Primitive / Derived Rule (Kernel) · Standalone Entry (RulExistsInstantiation) → · (2.03) · #RulExistsInstantiation
2.04
Title Forall Abstraction #RulForallAbstraction #label-forall-abstraction
Classification Inference Rule
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{x} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/typing-colon.html}{:} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{X} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PForaR_prf
Scheme of Types 0((⟦[𝛃@Fm.Expression]βŸ§β†’βŸ¦[𝛂@Fm.Expression]⟧) ⊒ (⟦[𝛃@Fm.Expression]βŸ§β†’βˆ€([⦃[x@Variable.Expression]⦄@Variable]:[⟦[X@Type.Expression.Expression]⟧@Type])⟦[𝛂@Fm.Expression]⟧))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/type-sort.html}{\mathsf{Type}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/name-sort.html}{\mathsf{Name}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Side Condition
1\(\href{symbols/nfv-pred.html}{\mathrm{NFV}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{x} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
Verification Primitive / Derived Rule (Kernel) · Standalone Entry (RulForallAbstraction) → · (2.04) · #RulForallAbstraction
2.05
Title Exists Abstraction #RulExistsAbstraction #label-exists-abstraction
Classification Inference Rule
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{x} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/typing-colon.html}{:} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{X} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PExisL_prf
Scheme of Types 0((⟦[𝛂@Fm.Expression]βŸ§β†’βŸ¦[𝛃@Fm.Expression]⟧) ⊒ ((βˆƒ([⦃[x@Variable.Expression]⦄@Variable]:[⟦[X@Type.Expression.Expression]⟧@Type])⟦[𝛂@Fm.Expression]⟧)β†’βŸ¦[𝛃@Fm.Expression]⟧))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/type-sort.html}{\mathsf{Type}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/name-sort.html}{\mathsf{Name}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Side Condition
1\(\href{symbols/nfv-pred.html}{\mathrm{NFV}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{x} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\beta}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
Verification Primitive / Derived Rule (Kernel) · Standalone Entry (RulExistsAbstraction) → · (2.05) · #RulExistsAbstraction
2.06
Title Generalisation (admissible rule) #RulGeneralisation #label-generalisation-admissible-rule
Classification Inference Rule
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{x} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/typing-colon.html}{:} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{X} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PForaR_prf
Scheme of Types 0(⟦[𝛂@Fm.Expression]⟧ ⊒ (βˆ€([⦃[x@Variable.Expression]⦄@Variable]:[⟦[X@Type.Expression.Expression]⟧@Type])⟦[𝛂@Fm.Expression]⟧))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/name-sort.html}{\mathsf{Name}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/type-sort.html}{\mathsf{Type}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\alpha}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Side Condition
1\(\href{symbols/top-const.html}{\top} \)
Verification Primitive / Derived Rule (Kernel) · Standalone Entry (RulGeneralisation) → · (2.06) · #RulGeneralisation

3. Set/Class-Theoretic Foundations (3.01–3.78)

Morse-Kelley / Von Neumann-Bernays-GΓΆdel class comprehension, sethood, ordinals, Dunaev pairs, cardinals, universes, and reflection.

Num Entity Database Record (Vertical Field Table)
3.01
Title Class comprehension #RulClassComprehension #label-class-comprehension
Classification Inference Rule
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{x} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/in-pred.html}{\in} \href{symbols/class-comprehension.html}{\{} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{x} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{x} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PComprAx_prf
Scheme of Types 0(([⦃[x@Variable.Expression]⦄@Class.Expression]∈{[⦃[x@Variable.Expression]⦄@Class.Expression]|⟦[𝛗@Fm.Expression]⟧})⟷(([⦃[x@Variable.Expression]⦄@Class.Expression] set)∧⟦[𝛗@Fm.Expression]⟧))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/name-sort.html}{\mathsf{Name}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Side Condition
1\(\href{symbols/top-const.html}{\top} \)
Verification Primitive / Derived Rule (Kernel) · Standalone Entry (RulClassComprehension) → · (3.01) · #RulClassComprehension
3.02
Title β€œIs a set” predicate #DefIsSet #label-is-a-set-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{Y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{Y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PSetDef_prf
Scheme of Types 0(βˆ€([X@Variable]:[Class@Type])(([X@Class.Expression] set)⟷(βˆƒ([Y@Variable]:[Class@Type])([X@Class.Expression]∈[Y@Class.Expression]))))
Verification Definitional (Kernel AST) · Standalone Entry (DefIsSet) → · (3.02) · #DefIsSet
3.03
Title β€œIs a proper class” predicate #DefIsProperClass #label-is-a-proper-class-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/proper-pred.html}{\mathsf{proper}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/neg-conn.html}{\neg} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpProper
Scheme of Types 0(βˆ€([K@Variable]:[Class@Type])(([K@Class.Expression] proper)⟷(Β¬([K@Class.Expression] set))))
Verification Definitional (Kernel AST) · Standalone Entry (DefIsProperClass) → · (3.03) · #DefIsProperClass
3.04
Title Empty set #DefEmptySet #label-empty-set
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{x} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/bot-const.html}{\bot} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpEmptySet
Scheme of Types 0(βˆ…={[x@Class.Expression]|βŠ₯})
Verification Definitional (Kernel AST) · Standalone Entry (DefEmptySet) → · (3.04) · #DefEmptySet
3.05
Title Universal class #DefUniversalClass #label-universal-class
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{x} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/top-const.html}{\top} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PKernelDef_prf
Scheme of Types 0(V={[x@Class.Expression]|⊀})
Verification Definitional (Kernel AST) · Standalone Entry (DefUniversalClass) → · (3.05) · #DefUniversalClass
3.06
Title Subclass relation #DefSubclass #label-subclass-relation
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{Y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{Y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{Y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PSubDef_prf
Scheme of Types 0(βˆ€([X@Variable]:[Class@Type])βˆ€([Y@Variable]:[Class@Type])(([X@Class.Expression]βŠ†[Y@Class.Expression])⟷(βˆ€([a@Variable]:[Class@Type])(([a@Class.Expression]∈[X@Class.Expression])β†’([a@Class.Expression]∈[Y@Class.Expression])))))
Verification Definitional (Kernel AST) · Standalone Entry (DefSubclass) → · (3.06) · #DefSubclass
3.07
Title Example: β€œThe empty class is a subclass of any class” statement #ThmEmptySetIsSubclass #label-example-the-empty-class-is-a-subclass-of-any-class-statement
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PSubDef_prf
Scheme of Types 0(βˆ€([X@Variable]:[Class@Type])(βˆ…βŠ†[X@Class.Expression]))
Verification Verified (Kernel) · Standalone Entry (ThmEmptySetIsSubclass) → · (3.07) · #ThmEmptySetIsSubclass
3.08
Title β€œMembership respects equality from the left” #AxmLeftInSound #label-membership-respects-equality-from-the-left
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{Y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{Y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{z} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{z} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{z} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{Y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PLeftInSoundAx_prf
Scheme of Types 0(βˆ€([X@Variable]:[Class@Type])βˆ€([Y@Variable]:[Class@Type])(([X@Class.Expression]=[Y@Class.Expression])β†’βˆ€([z@Variable]:[Class@Type])(([z@Class.Expression]∈[X@Class.Expression])⟷([z@Class.Expression]∈[Y@Class.Expression]))))
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmLeftInSound) → · (3.08) · #AxmLeftInSound
3.09
Title β€œMembership respects equality from the right” #AxmRightInSound #label-membership-respects-equality-from-the-right
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{Y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{Y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{W} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{W} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{Y} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{W} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PRightInSoundAx_prf
Scheme of Types 0(βˆ€([X@Variable]:[Class@Type])βˆ€([Y@Variable]:[Class@Type])(([X@Class.Expression]=[Y@Class.Expression])β†’βˆ€([W@Variable]:[Class@Type])(([X@Class.Expression]∈[W@Class.Expression])⟷([Y@Class.Expression]∈[W@Class.Expression]))))
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmRightInSound) → · (3.09) · #AxmRightInSound
3.10
Title β€œExtensionality” #AxmExtensionality #label-extensionality
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{Y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{z} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{z} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{z} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{Y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{Y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PEqDef_prf
Scheme of Types 0(βˆ€([X@Variable]:[Class@Type])βˆ€([Y@Variable]:[Class@Type])((βˆ€([z@Variable]:[Class@Type])(([z@Class.Expression]∈[X@Class.Expression])⟷([z@Class.Expression]∈[Y@Class.Expression])))β†’([X@Class.Expression]=[Y@Class.Expression])))
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmExtensionality) → · (3.10) · #AxmExtensionality
3.11
Title β€œIntensionality”(admissible) #AxmIntensionality #label-intensionality-admissible
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{Y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{Y} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{W} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{W} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{Y} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{W} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{Y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PEqDef_prf
Scheme of Types 0(βˆ€([X@Variable]:[Class@Type])βˆ€([Y@Variable]:[Class@Type])((([X@Class.Expression] set)∧([Y@Class.Expression] set))β†’((βˆ€([W@Variable]:[Class@Type])(([X@Class.Expression]∈[W@Class.Expression])⟷([Y@Class.Expression]∈[W@Class.Expression])))β†’([X@Class.Expression]=[Y@Class.Expression]))))
Verification Verified (Kernel) · Standalone Entry (AxmIntensionality) → · (3.11) · #AxmIntensionality
3.12
Title β€œHeredity”(a subclass of a set is also a set) #AxmHeredity #label-heredity-a-subclass-of-a-set-is-also-a-set
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PHeredityAx_prf
Scheme of Types 0(βˆ€([A@Variable]:[Class@Type])βˆ€([B@Variable]:[Class@Type])((([A@Class.Expression]βŠ†[B@Class.Expression])∧([B@Class.Expression] set))β†’([A@Class.Expression] set)))
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmHeredity) → · (3.12) · #AxmHeredity
3.13
Title β€œExponent”(powerclass of a set is also a set) #AxmExponent #label-exponent-powerclass-of-a-set-is-also-a-set
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/power-op.html}{\mathcal{P}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PPowSetAx_prf
Scheme of Types 0(βˆ€([X@Variable]:[Class@Type])(([X@Class.Expression] set)β†’(𝒫([X@Class.Expression]) set)))
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmExponent) → · (3.13) · #AxmExponent
3.14
Title β€œRegularity”(only universal class is equal to its powerclass) #AxmRegularity #label-regularity-only-universal-class-is-equal-to-its-powerclass
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/power-op.html}{\mathcal{P}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PEpsIndAx_prf
Scheme of Types 0(βˆ€([X@Variable]:[Class@Type])((𝒫([X@Class.Expression])βŠ†[X@Class.Expression])β†’(VβŠ†[X@Class.Expression])))
Kernel Note Kernel Form (Cumulative 𝒫-Induction): βˆ€(X:Class)((𝒫(X) βŠ† X) β†’ (V βŠ† X)). Classically equivalent (via X = V \ A) to the textbook ∈-minimal-element Regularity / Foundation formulation βˆ€(A:Class)((A β‰  βˆ…) β†’ βˆƒ(x:Class)((x ∈ A) ∧ ((x ∩ A) = βˆ…))).
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmRegularity) → · (3.14) · #AxmRegularity
3.15
Title Transitivity predicate #DefTransitiveClass #label-transitivity-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/trans-pred.html}{\mathrm{Tr}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PKernelDef_prf
Scheme of Types 0(βˆ€([A@Variable]:[Class@Type])(Tr([A@Class.Expression])⟷(βˆ€([B@Variable]:[Class@Type])(([B@Class.Expression]∈[A@Class.Expression])β†’([B@Class.Expression]βŠ†[A@Class.Expression])))))
Verification Definitional (Kernel AST) · Standalone Entry (DefTransitiveClass) → · (3.15) · #DefTransitiveClass
3.16
Title Ordinality predicate #DefOrdinalClass #label-ordinality-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/ord-pred.html}{\mathrm{Ord}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/trans-pred.html}{\mathrm{Tr}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/trans-pred.html}{\mathrm{Tr}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpOrd
Scheme of Types 0(βˆ€([A@Variable]:[Class@Type])(Ord([A@Class.Expression])⟷(Tr([A@Class.Expression])βˆ§βˆ€([B@Variable]:[Class@Type])(([B@Class.Expression]∈[A@Class.Expression])β†’Tr([B@Class.Expression])))))
Verification Definitional (Kernel AST) · Standalone Entry (DefOrdinalClass) → · (3.16) · #DefOrdinalClass
3.17
Title Class of all ordinal sets(ordinal numbers) #DefClassOfOrdinals #label-class-of-all-ordinal-sets-ordinal-numbers
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/on-const.html}{\mathbf{On}} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{w} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/ord-pred.html}{\mathrm{Ord}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{w} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpOn
Scheme of Types 0(On={[w@Class.Expression]|Ord([w@Class.Expression])})
Verification Definitional (Kernel AST) · Standalone Entry (DefClassOfOrdinals) → · (3.17) · #DefClassOfOrdinals
3.18
Title The class of all ordinals is an ordinal class #ThmOrdinalsIsOrdinal #label-the-class-of-all-ordinals-is-an-ordinal-class
Classification Theorem
Formula
0\(\href{symbols/ord-pred.html}{\mathrm{Ord}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/on-const.html}{\mathbf{On}} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpOrd
Scheme of Types 0Ord(On)
Verification Verified (Kernel) · Standalone Entry (ThmOrdinalsIsOrdinal) → · (3.18) · #ThmOrdinalsIsOrdinal
3.19
Title Union of the elements of a class #DefUnaryUnion #label-union-of-the-elements-of-a-class
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/bigunion-op.html}{\bigcup} \href{symbols/variables.html}{K} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{x} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{K} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpUnion
Scheme of Types 0(βˆ€([K@Variable]:[Class@Type])(⋃[K@Class.Expression]={[x@Class.Expression]|βˆƒ([y@Variable]:[Class@Type])(([y@Class.Expression]∈[K@Class.Expression])∧([x@Class.Expression]∈[y@Class.Expression]))}))
Verification Definitional (Kernel AST) · Standalone Entry (DefUnaryUnion) → · (3.19) · #DefUnaryUnion
3.20
Title Intersection of the elements of a class #DefUnaryIntersection #label-intersection-of-the-elements-of-a-class
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/biginter-op.html}{\bigcap} \href{symbols/variables.html}{K} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{x} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{K} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpInter
Scheme of Types 0(βˆ€([K@Variable]:[Class@Type])(β‹‚[K@Class.Expression]={[x@Class.Expression]|βˆ€([y@Variable]:[Class@Type])(([y@Class.Expression]∈[K@Class.Expression])β†’([x@Class.Expression]∈[y@Class.Expression]))}))
Verification Definitional (Kernel AST) · Standalone Entry (DefUnaryIntersection) → · (3.20) · #DefUnaryIntersection
3.21
Title Domain (includes arguments with proper class values) #DefBigDomain #label-domain-includes-arguments-with-proper-class-values
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{x} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{b} \href{symbols/delimiters-brackets.html}{)} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpDom
Scheme of Types 0(βˆ€([F@Variable]:[Class@Type])(Dom([F@Class.Expression])={[x@Class.Expression]|βˆƒ([b@Variable]:[Class@Type])(([x@Class.Expression],[b@Class.Expression])∈[F@Class.Expression])}))
Verification Definitional (Kernel AST) · Standalone Entry (DefBigDomain) → · (3.21) · #DefBigDomain
3.22
Title IF-THEN-ELSE-FI (Class conditional with NFV side condition and context turnstile) #DefClassConditional #label-if-then-else-fi-class-conditional-with-nfv-side-condition-and-context-turnstile
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/typing-colon.html}{:} \href{symbols/ctx-sort.html}{\mathsf{Ctx}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{v} \href{symbols/typing-colon.html}{:} \href{symbols/variable-sort.html}{\mathsf{Variable}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\psi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/neg-conn.html}{\neg} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/dot-delim.html}{.} \href{symbols/ifv-pred.html}{\mathrm{IFV}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{v} \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\boldsymbol{\psi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-wau.html}{\mathcal{W}} \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/antiquotation.html}{[\![ } \href{symbols/class-if-then-else.html}{\mathbf{IF}} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\psi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/class-if-then-else.html}{\mathbf{THEN}} \href{symbols/variables.html}{A} \href{symbols/class-if-then-else.html}{\mathbf{ELSE}} \href{symbols/variables.html}{B} \href{symbols/class-if-then-else.html}{\mathbf{FI}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{v} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\psi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{v} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/or-conn.html}{\lor} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/neg-conn.html}{\neg} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\psi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{v} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpIf
Scheme of Types 0(βˆ€([Ξ“@Variable]:[Ctx@Type])βˆ€([v@Variable]:[Variable@Type])βˆ€([𝛙@Variable]:[Fm@Type])βˆ€([A@Variable]:[Class@Type])βˆ€([B@Variable]:[Class@Type])((Β¬Fm.IFV([v@Variable.Expression],[𝛙@Fm.Expression]))β†’(𝘞,[Ξ“@Ctx.Expression]βŠ’β€ΉβŸ¦IF ⟦[𝛙@Fm.Expression]⟧ THEN [A@Class.Expression] ELSE [B@Class.Expression] FI⟧={[⦃[v@Variable.Expression]⦄@Class.Expression]|(⟦[𝛙@Fm.Expression]⟧∧([⦃[v@Variable.Expression]⦄@Class.Expression]∈[A@Class.Expression]))∨((¬⟦[𝛙@Fm.Expression]⟧)∧([⦃[v@Variable.Expression]⦄@Class.Expression]∈[B@Class.Expression]))}β€Ί)))
Verification Definitional (Kernel AST) · Standalone Entry (DefClassConditional) → · (3.22) · #DefClassConditional
3.23
Title simple_if (polymorphic non-dependent conditional over Type) #DefSimpleConditional #label-simple-if-polymorphic-non-dependent-conditional-over-type
Classification Definition
Formula
0\(\href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{T_e} \href{symbols/typing-colon.html}{:} \href{symbols/type-sort.html}{\mathsf{Type}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/simple-if.html}{\mathsf{simple\_if}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/typing-colon.html}{:} \href{symbols/bool-sort.html}{\mathsf{Bool}} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{t_1} \href{symbols/typing-colon.html}{:} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{t_2} \href{symbols/typing-colon.html}{:} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/simple-if.html}{\mathsf{simple\_if}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/comma-delim.html}{,} \href{symbols/top-const.html}{\top} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{t_1} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{t_2} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{t_1} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/simple-if.html}{\mathsf{simple\_if}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/comma-delim.html}{,} \href{symbols/bot-const.html}{\bot} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{t_1} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{t_2} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{t_2} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST EIf
Scheme of Types 0βˆ€(Tβ‚‘:Type), ((simple_if(⟦Tβ‚‘βŸ§):Boolβ†’(⟦Tβ‚‘βŸ§β†’(⟦Tβ‚‘βŸ§β†’βŸ¦Tβ‚‘βŸ§)))βˆ§βˆ€(t₁:⟦Tβ‚‘βŸ§)βˆ€(tβ‚‚:⟦Tβ‚‘βŸ§)((simple_if(⟦Tβ‚‘βŸ§,⊀,t₁,tβ‚‚)=t₁)∧(simple_if(⟦Tβ‚‘βŸ§,βŠ₯,t₁,tβ‚‚)=tβ‚‚)))
Verification Definitional (Kernel AST) · Standalone Entry (DefSimpleConditional) → · (3.23) · #DefSimpleConditional
3.24
Title ifα΅ˆβ‚‘β‚š (dependent conditional over (Bool β†’ Type)) #DefDependentConditional #label-if-dependent-conditional-over-bool-type
Classification Definition
Formula
0\(\href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{T_e} \href{symbols/typing-colon.html}{:} \href{symbols/bool-sort.html}{\mathsf{Bool}} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/type-sort.html}{\mathsf{Type}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/conditionals-if-dep.html}{\mathsf{if}_{\mathsf{dep}}} \href{symbols/typing-colon.html}{:} \href{symbols/pi-binder.html}{\Pi} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/typing-colon.html}{:} \href{symbols/bool-sort.html}{\mathsf{Bool}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/delimiters-brackets.html}{(} \href{symbols/top-const.html}{\top} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/delimiters-brackets.html}{(} \href{symbols/bot-const.html}{\bot} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/typing-colon.html}{:} \href{symbols/bool-sort.html}{\mathsf{Bool}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{t_1} \href{symbols/typing-colon.html}{:} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/delimiters-brackets.html}{(} \href{symbols/top-const.html}{\top} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{t_2} \href{symbols/typing-colon.html}{:} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/delimiters-brackets.html}{(} \href{symbols/bot-const.html}{\bot} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/conditionals-if-dep.html}{\mathsf{if}_{\mathsf{dep}}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{t_1} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{t_2} \href{symbols/delimiters-brackets.html}{)} \href{symbols/typing-colon.html}{:} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{T_e} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/conditionals-if-dep.html}{\mathsf{if}_{\mathsf{dep}}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/top-const.html}{\top} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{t_1} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{t_2} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{t_1} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/conditionals-if-dep.html}{\mathsf{if}_{\mathsf{dep}}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/bot-const.html}{\bot} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{t_1} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{t_2} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{t_2} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST EIfDep
Scheme of Types 0βˆ€(Tβ‚‘:Boolβ†’Type), ((ifα΅ˆβ‚‘β‚š:Ξ (b:Bool),(⟦Tβ‚‘(⊀)βŸ§β†’(⟦Tβ‚‘(βŠ₯)βŸ§β†’βŸ¦Tβ‚‘(b)⟧)))βˆ§βˆ€(b:Bool)βˆ€(t₁:⟦Tβ‚‘(⊀)⟧)βˆ€(tβ‚‚:⟦Tβ‚‘(βŠ₯)⟧)((ifα΅ˆβ‚‘β‚š(b,t₁,tβ‚‚):⟦Tβ‚‘(b)⟧)∧((ifα΅ˆβ‚‘β‚š(⊀,t₁,tβ‚‚)=t₁)∧(ifα΅ˆβ‚‘β‚š(βŠ₯,t₁,tβ‚‚)=tβ‚‚))))
Verification Definitional (Kernel AST) · Standalone Entry (DefDependentConditional) → · (3.24) · #DefDependentConditional
3.25
Title Evaluation of a [function|class-function|family] #DefValueAtArg #label-evaluation-of-a-function-class-function-family
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/antiquotation.html}{[\![ } \href{symbols/class-if-then-else.html}{\mathbf{IF}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{s} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{s} \href{symbols/delimiters-brackets.html}{)} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-if-then-else.html}{\mathbf{THEN}} \href{symbols/bigunion-op.html}{\bigcup} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{s} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{s} \href{symbols/delimiters-brackets.html}{)} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{F} \href{symbols/class-comprehension.html}{\}} \href{symbols/class-if-then-else.html}{\mathbf{ELSE}} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/class-if-then-else.html}{\mathbf{FI}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpValOf
Scheme of Types 0(βˆ€([F@Variable]:[Class@Type])βˆ€([a@Variable]:[Class@Type])([F@Class.Expression]([a@Class.Expression])=⟦IF (βˆƒ([s@Variable]:[Class@Type])(([a@Class.Expression],[s@Class.Expression])∈[F@Class.Expression])) THEN ⋃{[s@Class.Expression]|([a@Class.Expression],[s@Class.Expression])∈[F@Class.Expression]} ELSE V FI⟧))
Verification Definitional (Kernel AST) · Standalone Entry (DefValueAtArg) → · (3.25) · #DefValueAtArg
3.26
Title Image class #DefRelationalImage #label-image-class
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/image-op.html}{[} \href{symbols/variables.html}{A} \href{symbols/image-op.html}{]} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{b} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{b} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpImage
Scheme of Types 0(βˆ€([f@Variable]:[Class@Type])βˆ€([A@Variable]:[Class@Type])([f@Class.Expression][[A@Class.Expression]]={[b@Class.Expression]|βˆƒ([a@Variable]:[Class@Type])(([a@Class.Expression]∈[A@Class.Expression])∧([f@Class.Expression]([a@Class.Expression])=[b@Class.Expression]))}))
Verification Definitional (Kernel AST) · Standalone Entry (DefRelationalImage) → · (3.26) · #DefRelationalImage
3.27
Title β€œHas exactly one element” predicate #DefIsSingleton #label-has-exactly-one-element-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{s} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{s} \href{symbols/singleton-pred.html}{\mathsf{singleton}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/exists-uniq-binder.html}{\exists!} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{s} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpSingleton
Scheme of Types 0(βˆ€([s@Variable]:[Class@Type])(([s@Class.Expression] singleton)⟷(βˆƒ!([x@Variable]:[Class@Type])([x@Class.Expression]∈[s@Class.Expression]))))
Verification Definitional (Kernel AST) · Standalone Entry (DefIsSingleton) → · (3.27) · #DefIsSingleton
3.28
Title β€œIs set-valued” predicate #DefIsSetValued #label-is-set-valued-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/set-valued-pred.html}{\mathsf{set\text{-}valued}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/delimiters-brackets.html}{)} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpSetValued
Scheme of Types 0(βˆ€([F@Variable]:[Class@Type])(([F@Class.Expression] set-valued)⟷(βˆ€([x@Variable]:[Class@Type])(([x@Class.Expression]∈Dom([F@Class.Expression]))β†’([F@Class.Expression]([x@Class.Expression]) set)))))
Verification Definitional (Kernel AST) · Standalone Entry (DefIsSetValued) → · (3.28) · #DefIsSetValued
3.29
Title β€œHas concentrated set values” predicate #DefHasConcentratedValues #label-has-concentrated-set-values-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/concentrated-pred.html}{\mathsf{concentrated}} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/values-pred.html}{\mathsf{values}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/delimiters-brackets.html}{)} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/exists-uniq-binder.html}{\exists!} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpConcentrated
Scheme of Types 0(βˆ€([F@Variable]:[Class@Type])(([F@Class.Expression] concentrated set values)⟷(βˆ€([x@Variable]:[Class@Type])(([x@Class.Expression]∈Dom([F@Class.Expression]))β†’(([F@Class.Expression]([x@Class.Expression]) set)β†’βˆƒ!([y@Variable]:[Class@Type])(([x@Class.Expression],[y@Class.Expression])∈[F@Class.Expression]))))))
Verification Definitional (Kernel AST) · Standalone Entry (DefHasConcentratedValues) → · (3.29) · #DefHasConcentratedValues
3.30
Title β€œHas flat proper values” predicate #DefFlatValues #label-has-flat-proper-values-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/flat-pred.html}{\mathsf{flat}} \href{symbols/proper-pred.html}{\mathsf{proper}} \href{symbols/values-pred.html}{\mathsf{values}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/delimiters-brackets.html}{)} \href{symbols/proper-pred.html}{\mathsf{proper}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{b} \href{symbols/delimiters-brackets.html}{)} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/singleton-pred.html}{\mathsf{singleton}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpFlat
Scheme of Types 0(βˆ€([F@Variable]:[Class@Type])(([F@Class.Expression] flat proper values)⟷(βˆ€([x@Variable]:[Class@Type])(([x@Class.Expression]∈Dom([F@Class.Expression]))β†’(([F@Class.Expression]([x@Class.Expression]) proper)β†’βˆ€([b@Variable]:[Class@Type])((([x@Class.Expression],[b@Class.Expression])∈[F@Class.Expression])β†’([b@Class.Expression] singleton)))))))
Verification Definitional (Kernel AST) · Standalone Entry (DefFlatValues) → · (3.30) · #DefFlatValues
3.31
Title β€œIs a family” predicate #DefFamily #label-is-a-family-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/family-pred.html}{\mathsf{family}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/concentrated-pred.html}{\mathsf{concentrated}} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/values-pred.html}{\mathsf{values}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/flat-pred.html}{\mathsf{flat}} \href{symbols/proper-pred.html}{\mathsf{proper}} \href{symbols/values-pred.html}{\mathsf{values}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpFamily
Scheme of Types 0(βˆ€([F@Variable]:[Class@Type])(([F@Class.Expression] family)⟷(([F@Class.Expression] concentrated set values)∧([F@Class.Expression] flat proper values))))
Verification Definitional (Kernel AST) · Standalone Entry (DefFamily) → · (3.31) · #DefFamily
3.32
Title β€œIs a class-function” predicate #DefClassFunction #label-is-a-class-function-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/class-func-pred.html}{\mathsf{class\text{-}function}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/family-pred.html}{\mathsf{family}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/set-valued-pred.html}{\mathsf{set\text{-}valued}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpClassFunc
Scheme of Types 0(βˆ€([F@Variable]:[Class@Type])(([F@Class.Expression] class-function)⟷(([F@Class.Expression] family)∧([F@Class.Expression] set-valued))))
Verification Definitional (Kernel AST) · Standalone Entry (DefClassFunction) → · (3.32) · #DefClassFunction
3.33
Title β€œIs injective” predicate #DefInjectiveFunction #label-is-injective-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/injective-pred.html}{\mathsf{injective}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/family-pred.html}{\mathsf{family}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/set-valued-pred.html}{\mathsf{set\text{-}valued}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/in-pred.html}{\in} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpInjective
Scheme of Types 0(βˆ€([F@Variable]:[Class@Type])(([F@Class.Expression] injective)⟷((([F@Class.Expression] family)∧([F@Class.Expression] set-valued))βˆ§βˆ€([x@Variable]:[Class@Type])βˆ€([y@Variable]:[Class@Type])(((([x@Class.Expression]∈Dom([F@Class.Expression]))∧([y@Class.Expression]∈Dom([F@Class.Expression])))∧([F@Class.Expression]([x@Class.Expression])=[F@Class.Expression]([y@Class.Expression])))β†’([x@Class.Expression]=[y@Class.Expression])))))
Verification Definitional (Kernel AST) · Standalone Entry (DefInjectiveFunction) → · (3.33) · #DefInjectiveFunction
3.34
Title β€œIs a function” predicate #DefSetFunction #label-is-a-function-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/func-pred.html}{\mathsf{function}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/class-func-pred.html}{\mathsf{class\text{-}function}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpFunc
Scheme of Types 0(βˆ€([f@Variable]:[Class@Type])(([f@Class.Expression] function)⟷(([f@Class.Expression] class-function)∧([f@Class.Expression] set))))
Verification Definitional (Kernel AST) · Standalone Entry (DefSetFunction) → · (3.34) · #DefSetFunction
3.35
Title β€œSemi-singleton” predicate #DefSemiSingleton #label-semi-singleton-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{s} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{s} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{s} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpSemiSingleton
Scheme of Types 0(βˆ€([s@Variable]:[Class@Type])βˆ€([x@Variable]:[Class@Type])βˆ€([y@Variable]:[Class@Type])((([x@Class.Expression]∈[s@Class.Expression])∧([y@Class.Expression]∈[s@Class.Expression]))β†’([x@Class.Expression]=[y@Class.Expression])))
Verification Definitional (Kernel AST) · Standalone Entry (DefSemiSingleton) → · (3.35) · #DefSemiSingleton
3.36
Title β€œSemi-singleton subset” relation (s sss A) #DefSemiSingletonSubclass #label-semi-singleton-subset-relation-s-sss-a
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{s} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{s} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{s} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{s} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpSss
Scheme of Types 0(βˆ€([s@Variable]:[Class@Type])βˆ€([A@Variable]:[Class@Type])(([s@Class.Expression]βŠ†[A@Class.Expression])βˆ§βˆ€([x@Variable]:[Class@Type])βˆ€([y@Variable]:[Class@Type])((([x@Class.Expression]∈[s@Class.Expression])∧([y@Class.Expression]∈[s@Class.Expression]))β†’([x@Class.Expression]=[y@Class.Expression]))))
Verification Definitional (Kernel AST) · Standalone Entry (DefSemiSingletonSubclass) → · (3.36) · #DefSemiSingletonSubclass
3.37
Title Evaluation of β€œFamily Value” via semi-singleton subsets #ThmFamilyEvaluation #label-evaluation-of-family-value-via-semi-singleton-subsets
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/family-pred.html}{\mathsf{family}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{F} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/bigunion-op.html}{\bigcup} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{s} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{s} \href{symbols/delimiters-brackets.html}{)} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{F} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpValOf
Scheme of Types 0(βˆ€([F@Variable]:[Class@Type])βˆ€([x@Variable]:[Class@Type])(([F@Class.Expression] family)β†’([F@Class.Expression]([x@Class.Expression])=⋃{[s@Class.Expression]|([x@Class.Expression],[s@Class.Expression])∈[F@Class.Expression]})))
Verification Verified (Kernel) · Standalone Entry (ThmFamilyEvaluation) → · (3.37) · #ThmFamilyEvaluation
3.38
Title β€œDependent Sum (Sigma-Type)” model over a family #DefSigmaModel #label-dependent-sum-sigma-type-model-over-a-family
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/family-pred.html}{\mathsf{family}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/in-pred.html}{\in} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{s} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{s} \href{symbols/eq-pred.html}{=} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{b} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/in-pred.html}{\in} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpSigma
Scheme of Types 0(βˆ€([B@Variable]:[Class@Type])βˆ€([x@Variable]:[Class@Type])βˆ€([y@Variable]:[Class@Type])(([B@Class.Expression] family)β†’((([x@Class.Expression]∈Dom([B@Class.Expression]))∧([y@Class.Expression]∈[B@Class.Expression]([x@Class.Expression])))⟷(([x@Class.Expression],[y@Class.Expression])∈{[s@Class.Expression]|βˆƒ([a@Variable]:[Class@Type])βˆƒ([b@Variable]:[Class@Type])(([s@Class.Expression]=([a@Class.Expression],[b@Class.Expression]))∧(([a@Class.Expression]∈Dom([B@Class.Expression]))∧([b@Class.Expression]∈[B@Class.Expression]([a@Class.Expression]))))}))))
Kernel Note Explicit typed term interpretation / valuation (ΞΌ_A : A.Expression β†’ Class.Expression) of the dependent sum Ξ£(x:Dom(F)) over a family F in the fixed background model.
Verification Definitional (Kernel AST) · Standalone Entry (DefSigmaModel) → · (3.38) · #DefSigmaModel
3.39
Title β€œDependent Product (Pi-Type)” predicate and section model #DefPiPredicateModel #label-dependent-product-pi-type-predicate-and-section-model
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/family-pred.html}{\mathsf{family}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/family-pred.html}{\mathsf{family}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/delimiters-brackets.html}{)} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpPi
Scheme of Types 0(βˆ€([B@Variable]:[Class@Type])βˆ€([f@Variable]:[Class@Type])((([B@Class.Expression] family)∧(([f@Class.Expression] family)∧(Dom([f@Class.Expression])=Dom([B@Class.Expression]))))β†’βˆ€([x@Variable]:[Class@Type])(([x@Class.Expression]∈Dom([B@Class.Expression]))β†’([f@Class.Expression]([x@Class.Expression])∈[B@Class.Expression]([x@Class.Expression])))))
Kernel Note Explicit typed term interpretation / valuation (ΞΌ_A : A.Expression β†’ Class.Expression) of dependent product sections Ξ (x:Dom(F)) over a family F in the fixed background model.
Verification Verified (Kernel) · Standalone Entry (DefPiPredicateModel) → · (3.39) · #DefPiPredicateModel
3.40
Title β€œIs not strictly larger than” binary relation #DefCardLessEq #label-is-not-strictly-larger-than-binary-relation
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} β‰Ό\href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/class-func-pred.html}{\mathsf{class\text{-}function}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/dom-op.html}{\mathrm{Dom}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/image-op.html}{[} \href{symbols/variables.html}{A} \href{symbols/image-op.html}{]} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{f} \href{symbols/injective-pred.html}{\mathsf{injective}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpLessEq
Scheme of Types 0(βˆ€([A@Variable]:[Class@Type])βˆ€([B@Variable]:[Class@Type])(([A@Class.Expression]β‰Ό[B@Class.Expression])⟷(βˆƒ([f@Variable]:[Class@Type])(((([f@Class.Expression] class-function)∧([A@Class.Expression]βŠ†Dom([f@Class.Expression])))∧([f@Class.Expression][[A@Class.Expression]]βŠ†[B@Class.Expression]))∧([f@Class.Expression] injective)))))
Verification Definitional (Kernel AST) · Standalone Entry (DefCardLessEq) → · (3.40) · #DefCardLessEq
3.41
Title Class cardinality #DefCardinality #label-class-cardinality
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/card-op.html}{ \mid } \href{symbols/variables.html}{K} \href{symbols/card-op.html}{ \mid } \href{symbols/eq-pred.html}{=} \href{symbols/delimiters-brackets.html}{(} \href{symbols/on-const.html}{\mathbf{On}} \href{symbols/bininter-op.html}{\cap} \href{symbols/biginter-op.html}{\bigcap} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{a} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/in-pred.html}{\in} \href{symbols/on-const.html}{\mathbf{On}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} β‰Ό\href{symbols/variables.html}{a} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpCard
Scheme of Types 0(βˆ€([K@Variable]:[Class@Type])(|[K@Class.Expression]|=(Onβˆ©β‹‚{[a@Class.Expression]|([a@Class.Expression]∈On)∧([K@Class.Expression]β‰Ό[a@Class.Expression])})))
Verification Definitional (Kernel AST) · Standalone Entry (DefCardinality) → · (3.41) · #DefCardinality
3.42
Title β€œIs strictly smaller than” binary relation #DefCardLess #label-is-strictly-smaller-than-binary-relation
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/card-lt-pred.html}{\prec} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/neg-conn.html}{\neg} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} β‰Ό\href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpLess
Scheme of Types 0(βˆ€([A@Variable]:[Class@Type])βˆ€([B@Variable]:[Class@Type])(([A@Class.Expression]β‰Ί[B@Class.Expression])⟷(Β¬([B@Class.Expression]β‰Ό[A@Class.Expression]))))
Verification Definitional (Kernel AST) · Standalone Entry (DefCardLess) → · (3.42) · #DefCardLess
3.43
Title Size limitation axiom related statement #AxmSizeLimitation #label-size-limitation-axiom-related-statement
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/in-pred.html}{\in} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/card-op.html}{ \mid } \href{symbols/variables.html}{X} \href{symbols/card-op.html}{ \mid } \href{symbols/card-lt-pred.html}{\prec} \href{symbols/card-op.html}{ \mid } \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/card-op.html}{ \mid } \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PSizeLimAx_prf
Scheme of Types 0(βˆ€([X@Variable]:[Class@Type])(([X@Class.Expression]∈V)⟷(|[X@Class.Expression]|β‰Ί|V|)))
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmSizeLimitation) → · (3.43) · #AxmSizeLimitation
3.44
Title β€œIs hereditary” predicate #DefHereditaryClass #label-is-hereditary-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/hereditary-pred.html}{\mathsf{Hereditary}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PKernelDef_prf
Scheme of Types 0(βˆ€([A@Variable]:[Class@Type])(Hereditary([A@Class.Expression])⟷(βˆ€([B@Variable]:[Class@Type])(([B@Class.Expression]∈[A@Class.Expression])β†’βˆ€([X@Variable]:[Class@Type])(([X@Class.Expression]βŠ†[B@Class.Expression])β†’([X@Class.Expression]∈[A@Class.Expression]))))))
Verification Definitional (Kernel AST) · Standalone Entry (DefHereditaryClass) → · (3.44) · #DefHereditaryClass
3.45
Title β€œIs powerful” predicate #DefPowerfulClass #label-is-powerful-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/powerful-pred.html}{\mathsf{Powerful}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/power-op.html}{\mathcal{P}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PKernelDef_prf
Scheme of Types 0(βˆ€([U@Variable]:[Class@Type])(Powerful([U@Class.Expression])⟷(βˆ€([B@Variable]:[Class@Type])(([B@Class.Expression]∈[U@Class.Expression])β†’(𝒫([B@Class.Expression])∈[U@Class.Expression])))))
Verification Definitional (Kernel AST) · Standalone Entry (DefPowerfulClass) → · (3.45) · #DefPowerfulClass
3.46
Title β€œIs pairful” predicate #DefPairfulClass #label-is-pairful-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/pairful-pred.html}{\mathsf{Pairful}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/upair-op.html}{\{} \href{symbols/variables.html}{A} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{B} \href{symbols/upair-op.html}{\}} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PKernelDef_prf
Scheme of Types 0(βˆ€([U@Variable]:[Class@Type])(Pairful([U@Class.Expression])⟷(βˆ€([A@Variable]:[Class@Type])βˆ€([B@Variable]:[Class@Type])((([A@Class.Expression]∈[U@Class.Expression])∧([B@Class.Expression]∈[U@Class.Expression]))β†’({[A@Class.Expression],[B@Class.Expression]}∈[U@Class.Expression])))))
Verification Definitional (Kernel AST) · Standalone Entry (DefPairfulClass) → · (3.46) · #DefPairfulClass
3.47
Title β€œIs tight” predicate #DefTightClass #label-is-tight-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/tight-pred.html}{\mathsf{Tight}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/card-lt-pred.html}{\prec} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PKernelDef_prf
Scheme of Types 0(βˆ€([U@Variable]:[Class@Type])(Tight([U@Class.Expression])⟷(βˆ€([B@Variable]:[Class@Type])(([B@Class.Expression]βŠ†[U@Class.Expression])β†’(([B@Class.Expression]β‰Ί[U@Class.Expression])⟷([B@Class.Expression]∈[U@Class.Expression]))))))
Verification Definitional (Kernel AST) · Standalone Entry (DefTightClass) → · (3.47) · #DefTightClass
3.48
Title Singleton set #DefSingletonSet #label-singleton-set
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/singleton-op.html}{\{} \href{symbols/variables.html}{a} \href{symbols/singleton-op.html}{\}} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{x} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/variables.html}{x} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{a} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpSingleton
Scheme of Types 0(βˆ€([a@Variable]:[Class@Type])({[a@Class.Expression]}={[x@Class.Expression]|[x@Class.Expression]=[a@Class.Expression]}))
Verification Definitional (Kernel AST) · Standalone Entry (DefSingletonSet) → · (3.48) · #DefSingletonSet
3.49
Title Unordered pair #DefUnorderedPair #label-unordered-pair
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/upair-op.html}{\{} \href{symbols/variables.html}{a} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{b} \href{symbols/upair-op.html}{\}} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{x} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{a} \href{symbols/delimiters-brackets.html}{)} \href{symbols/or-conn.html}{\lor} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{b} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpUPair
Scheme of Types 0(βˆ€([a@Variable]:[Class@Type])βˆ€([b@Variable]:[Class@Type])({[a@Class.Expression],[b@Class.Expression]}={[x@Class.Expression]|([x@Class.Expression]=[a@Class.Expression])∨([x@Class.Expression]=[b@Class.Expression])}))
Verification Definitional (Kernel AST) · Standalone Entry (DefUnorderedPair) → · (3.49) · #DefUnorderedPair
3.50
Title Set-theoretic models of natural numbers(TBI) #DefNaturalNumberModels #label-set-theoretic-models-of-natural-numbers-tbi
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/numeral-0.html}{0} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/numeral-1.html}{1} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/singleton-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/singleton-op.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/numeral-2.html}{2} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/upair-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/comma-delim.html}{,} \href{symbols/singleton-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/singleton-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/numeral-3.html}{3} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/upair-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/comma-delim.html}{,} \href{symbols/singleton-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/singleton-op.html}{\}} \href{symbols/comma-delim.html}{,} \href{symbols/upair-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/comma-delim.html}{,} \href{symbols/singleton-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/singleton-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpNatModel
Scheme of Types 0((0:Class) = βˆ…) ∧ (((1:Class) = {βˆ…}) ∧ (((2:Class) = {βˆ…,{βˆ…}}) ∧ ((3:Class) = {βˆ…,{βˆ…},{βˆ…,{βˆ…}}})))
Kernel Note Explicit typed term interpretation / valuation (ΞΌ_Nat : Nat.Expression β†’ Class.Expression) mapping numeral terms 0, 1, 2, 3 into their von Neumann ordinal classes in the fixed background model.
Verification Definitional (Kernel AST) · Standalone Entry (DefNaturalNumberModels) → · (3.50) · #DefNaturalNumberModels
3.51
Title General definition of lists of classes which applicable not only for sets, but for proper classes too(TBI) #DefClassLists #label-general-definition-of-lists-of-classes-which-applicable-not-only-for-sets-but-for-proper-classes-too-tbi
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/mark-op.html}{\mathrm{mark}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{n} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/delimiters-brackets.html}{(} \href{symbols/singleton-op.html}{\{} \href{symbols/upair-op.html}{\{} \href{symbols/numeral-0.html}{0} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{n} \href{symbols/upair-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/binunion-op.html}{\cup} \href{symbols/class-comprehension.html}{\{} \href{symbols/delimiters-brackets.html}{(} \href{symbols/upair-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/variables.html}{a} \href{symbols/singleton-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{n} \href{symbols/upair-op.html}{\}} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/eq-pred.html}{=} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/image-op.html}{[} \href{symbols/variables.html}{A} \href{symbols/image-op.html}{]} \href{symbols/eq-pred.html}{=} \href{symbols/mark-op.html}{\mathrm{mark}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/comma-delim.html}{,} \href{symbols/numeral-1.html}{1} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/image-op.html}{[} \href{symbols/variables.html}{A} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{B} \href{symbols/image-op.html}{]} \href{symbols/eq-pred.html}{=} \href{symbols/delimiters-brackets.html}{(} \href{symbols/mark-op.html}{\mathrm{mark}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/comma-delim.html}{,} \href{symbols/numeral-1.html}{1} \href{symbols/delimiters-brackets.html}{)} \href{symbols/binunion-op.html}{\cup} \href{symbols/mark-op.html}{\mathrm{mark}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/comma-delim.html}{,} \href{symbols/numeral-2.html}{2} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/image-op.html}{[} \href{symbols/variables.html}{A} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{B} \href{symbols/image-op.html}{]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/pr1-op.html}{\mathrm{pr}_1} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{L} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{a} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/delimiters-brackets.html}{(} \href{symbols/upair-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/variables.html}{a} \href{symbols/singleton-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/comma-delim.html}{,} \href{symbols/numeral-1.html}{1} \href{symbols/upair-op.html}{\}} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{L} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/pr2-op.html}{\mathrm{pr}_2} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{L} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{b} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/delimiters-brackets.html}{(} \href{symbols/upair-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/variables.html}{b} \href{symbols/singleton-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/comma-delim.html}{,} \href{symbols/numeral-2.html}{2} \href{symbols/upair-op.html}{\}} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{L} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpOPair
Scheme of Types 0(mark(A,n) = ({{0,n}} βˆͺ {({{{a}},n}:Class) | (a ∈ A)})) ∧ (([] = βˆ…) ∧ (([A] = mark(A,1)) ∧ (([A,B] = (mark(A,1) βˆͺ mark(B,2))) ∧ (((A,B) = [A,B]) ∧ ((pr1(L) = {a | ({{{a}},1} ∈ L)}) ∧ (pr2(L) = {b | ({{{b}},2} ∈ L)}))))))
Judgements
1\(\href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{L} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{n} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/image-op.html}{]} \)
Verification Definitional (Kernel AST) · Standalone Entry (DefClassLists) → · (3.51) · #DefClassLists
3.52
Title Ordered pair(Kuratowsky's) #DefKuratowskiPair #label-ordered-pair-kuratowsky-s
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{b} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{b} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/upair-op.html}{\{} \href{symbols/upair-op.html}{\{} \href{symbols/variables.html}{a} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{a} \href{symbols/upair-op.html}{\}} \href{symbols/comma-delim.html}{,} \href{symbols/upair-op.html}{\{} \href{symbols/variables.html}{a} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{b} \href{symbols/upair-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpKuratowskiPair
Scheme of Types 0(βˆ€([a@Variable]:[Class@Type])βˆ€([b@Variable]:[Class@Type])(([a@Class.Expression],[b@Class.Expression])={{[a@Class.Expression],[a@Class.Expression]},{[a@Class.Expression],[b@Class.Expression]}}))
Verification Definitional (Kernel AST) · Standalone Entry (DefKuratowskiPair) → · (3.52) · #DefKuratowskiPair
3.53
Title Binary union #DefBinaryUnion #label-binary-union
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/binunion-op.html}{\cup} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{x} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/or-conn.html}{\lor} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpBinUnion
Scheme of Types 0(βˆ€([A@Variable]:[Class@Type])βˆ€([B@Variable]:[Class@Type])(([A@Class.Expression]βˆͺ[B@Class.Expression])={[x@Class.Expression]|([x@Class.Expression]∈[A@Class.Expression])∨([x@Class.Expression]∈[B@Class.Expression])}))
Kernel Note Special Def.: (x βˆͺ y) = ⋃{x,y} (set-restricted); General Def.: (A βˆͺ B) = {z | (z ∈ A) ∨ (z ∈ B)} (general class definition).
Verification Definitional (Kernel AST) · Standalone Entry (DefBinaryUnion) → · (3.53) · #DefBinaryUnion
3.54
Title Binary intersection #DefBinaryIntersection #label-binary-intersection
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/bininter-op.html}{\cap} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{x} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpBinInter
Scheme of Types 0(βˆ€([A@Variable]:[Class@Type])βˆ€([B@Variable]:[Class@Type])(([A@Class.Expression]∩[B@Class.Expression])={[x@Class.Expression]|([x@Class.Expression]∈[A@Class.Expression])∧([x@Class.Expression]∈[B@Class.Expression])}))
Verification Definitional (Kernel AST) · Standalone Entry (DefBinaryIntersection) → · (3.54) · #DefBinaryIntersection
3.55
Title β€œIs successor-inductive (Peano-inductive)” predicate #DefInductiveClass #label-is-successor-inductive-peano-inductive-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/ind-pred.html}{\mathrm{Ind}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/binunion-op.html}{\cup} \href{symbols/singleton-op.html}{\{} \href{symbols/variables.html}{a} \href{symbols/singleton-op.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{X} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpInd
Scheme of Types 0(βˆ€([X@Variable]:[Class@Type])(Ind([X@Class.Expression])⟷((βˆ…βˆˆ[X@Class.Expression])βˆ§βˆ€([a@Variable]:[Class@Type])(([a@Class.Expression]∈[X@Class.Expression])β†’(([a@Class.Expression]βˆͺ{[a@Class.Expression]})∈[X@Class.Expression])))))
Kernel Note Successor-inductive (Peano 0-successor-inductive) in the narrowest sense: closed under 0 = βˆ… and ordinal successor a |-> a βˆͺ {a}, as distinguished from transfinite ∈-induction (3.70) or 𝒫-induction.
Verification Definitional (Kernel AST) · Standalone Entry (DefInductiveClass) → · (3.55) · #DefInductiveClass
3.56
Title The intersection class of all successor-inductive (Peano-inductive) classes is called omega (βŠ†-minimal successor-inductive class and smallest successor-inductive ordinal) #DefOmega #label-the-intersection-class-of-all-successor-inductive-peano-inductive-classes-is-called-omega-minimal-successor-inductive-class-and-smallest-successor-inductive-ordinal
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/omega-const.html}{\omega} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{Q} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/ind-pred.html}{\mathrm{Ind}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{Q} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{Q} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpOmega
Scheme of Types 0(βˆ€([x@Variable]:[Class@Type])(([x@Class.Expression]βˆˆΟ‰)⟷(βˆ€([Q@Variable]:[Class@Type])(Ind([Q@Class.Expression])β†’([x@Class.Expression]∈[Q@Class.Expression])))))
Kernel Note By definition, Ο‰ is not only the smallest successor-inductive ordinal, but also the βŠ†-minimal (least) element among all successor-inductive (Peano-inductive) classes in the subclass (βŠ†) order (Ind(Ο‰) ∧ βˆ€(Q:Class), Ind(Q) β†’ (Ο‰ βŠ† Q)), directly expressing simple countable mathematical (Peano) induction up to Ο‰. | Special Def.: Ο‰ = β‹‚{q | Ind(q)}; General Def.: βˆ€(x:Class), (x ∈ Ο‰) ⟷ (βˆ€(Q:Class), Ind(Q) β†’ (x ∈ Q)).
Verification Definitional (Kernel AST) · Standalone Entry (DefOmega) → · (3.56) · #DefOmega
3.57
Title β€œInfinity”(Ο‰ is a set) #AxmOmegaIsSet #label-infinity-is-a-set
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/omega-const.html}{\omega} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST POmegaSetAx_prf
Scheme of Types 0(Ο‰ set)
Kernel Note Asserts that the βŠ†-minimal successor-inductive (Peano-inductive) class Ο‰ is a set.
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmOmegaIsSet) → · (3.57) · #AxmOmegaIsSet
3.58
Title Class of all sets is successor-inductive (Peano-inductive) #ThmUniversalClassInductive #label-class-of-all-sets-is-successor-inductive-peano-inductive
Classification Theorem
Formula
0\(\href{symbols/ind-pred.html}{\mathrm{Ind}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpInd
Scheme of Types 0Ind(V)
Verification Verified (Kernel) · Standalone Entry (ThmUniversalClassInductive) → · (3.58) · #ThmUniversalClassInductive
3.59
Title Intersection of all successor-inductive (Peano-inductive) classes is a successor-inductive class itself (Ο‰ is the βŠ†-least successor-inductive class) #ThmOmegaInductive #label-intersection-of-all-successor-inductive-peano-inductive-classes-is-a-successor-inductive-class-itself-is-the-least-successor-inductive-class
Classification Theorem
Formula
0\(\href{symbols/ind-pred.html}{\mathrm{Ind}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/omega-const.html}{\omega} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpInd
Scheme of Types 0Ind(Ο‰)
Kernel Note Establishes that Ο‰ itself satisfies Ind(Ο‰), making Ο‰ the βŠ†-least (minimal) element among all successor-inductive classes in the βŠ† order.
Verification Verified (Kernel) · Standalone Entry (ThmOmegaInductive) → · (3.59) · #ThmOmegaInductive
3.60
Title Class of all ordinal numbers is successor-inductive (Peano-inductive) #ThmOrdinalsInductive #label-class-of-all-ordinal-numbers-is-successor-inductive-peano-inductive
Classification Theorem
Formula
0\(\href{symbols/ind-pred.html}{\mathrm{Ind}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/on-const.html}{\mathbf{On}} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpInd
Scheme of Types 0Ind(On)
Verification Verified (Kernel) · Standalone Entry (ThmOrdinalsInductive) → · (3.60) · #ThmOrdinalsInductive
3.61
Title Ο‰ is transitive #ThmOmegaTransitive #label-is-transitive
Classification Theorem
Formula
0\(\href{symbols/trans-pred.html}{\mathrm{Tr}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/omega-const.html}{\omega} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpTrans
Scheme of Types 0Tr(Ο‰)
Verification Verified (Kernel) · Standalone Entry (ThmOmegaTransitive) → · (3.61) · #ThmOmegaTransitive
3.62
Title Ο‰ is ordinal #ThmOmegaOrdinal #label-is-ordinal
Classification Theorem
Formula
0\(\href{symbols/ord-pred.html}{\mathrm{Ord}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/omega-const.html}{\omega} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpOrd
Scheme of Types 0Ord(Ο‰)
Verification Verified (Kernel) · Standalone Entry (ThmOmegaOrdinal) → · (3.62) · #ThmOmegaOrdinal
3.63
Title Ο‰ is in the class of all ordinal numbers(=sets) #ThmOmegaInOrdinals #label-is-in-the-class-of-all-ordinal-numbers-sets
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/omega-const.html}{\omega} \href{symbols/in-pred.html}{\in} \href{symbols/on-const.html}{\mathbf{On}} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpOn
Scheme of Types 0(Ο‰βˆˆOn)
Verification Verified (Kernel) · Standalone Entry (ThmOmegaInOrdinals) → · (3.63) · #ThmOmegaInOrdinals
3.64
Title β€œIs cardinal” predicate #DefIsCardinal #label-is-cardinal-predicate
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{C} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/card-pred.html}{\mathrm{Card}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{C} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/card-op.html}{ \mid } \href{symbols/variables.html}{K} \href{symbols/card-op.html}{ \mid } \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{C} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpCard
Scheme of Types 0(βˆ€([C@Variable]:[Class@Type])(Card([C@Class.Expression])⟷(βˆƒ([K@Variable]:[Class@Type])(|[K@Class.Expression]|=[C@Class.Expression]))))
Verification Verified (Kernel) · Standalone Entry (DefIsCardinal) → · (3.64) · #DefIsCardinal
3.65
Title Ο‰ is cardinal #ThmOmegaCardinal #label-is-cardinal
Classification Theorem
Formula
0\(\href{symbols/card-pred.html}{\mathrm{Card}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/omega-const.html}{\omega} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpCard
Scheme of Types 0Card(Ο‰)
Verification Verified (Kernel) · Standalone Entry (ThmOmegaCardinal) → · (3.65) · #ThmOmegaCardinal
3.66
Title On is a cardinal class #ThmOrdinalsCardinal #label-on-is-a-cardinal-class
Classification Theorem
Formula
0\(\href{symbols/card-pred.html}{\mathrm{Card}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/on-const.html}{\mathbf{On}} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpCard
Scheme of Types 0Card(On)
Verification Verified (Kernel) · Standalone Entry (ThmOrdinalsCardinal) → · (3.66) · #ThmOrdinalsCardinal
3.67
Title Class of all sets is not a cardinal class #ThmUniversalClassNotCardinal #label-class-of-all-sets-is-not-a-cardinal-class
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/neg-conn.html}{\neg} \href{symbols/card-pred.html}{\mathrm{Card}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpCard
Scheme of Types 0(Β¬Card(V))
Verification Verified (Kernel) · Standalone Entry (ThmUniversalClassNotCardinal) → · (3.67) · #ThmUniversalClassNotCardinal
3.68
Title β€œIs a universe” predicate #DefGrothendieckUniverse #label-is-a-universe-predicate
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/universe-pred.html}{\mathsf{universe}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/omega-const.html}{\omega} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/trans-pred.html}{\mathrm{Tr}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/hereditary-pred.html}{\mathsf{Hereditary}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/powerful-pred.html}{\mathsf{Powerful}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/tight-pred.html}{\mathsf{Tight}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/pairful-pred.html}{\mathsf{Pairful}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{U} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PKernelDef_prf
Scheme of Types 0(βˆ€([U@Variable]:[Class@Type])(([U@Class.Expression] universe)⟷(((Ο‰βˆˆ[U@Class.Expression])∧((Tr([U@Class.Expression])∧Hereditary([U@Class.Expression]))∧(Powerful([U@Class.Expression])∧Tight([U@Class.Expression]))))∧Pairful([U@Class.Expression]))))
Verification Definitional (Kernel AST) · Standalone Entry (DefGrothendieckUniverse) → · (3.68) · #DefGrothendieckUniverse
3.69
Title The class of all sets is a universe #ThmUniversalClassIsUniverse #label-the-class-of-all-sets-is-a-universe
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/universe-pred.html}{\mathsf{universe}} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PVUniverseAx_prf
Scheme of Types 0(V universe)
Formal Kernel Proof
Step 0a (V β†’ set, from #DefUniversalClass + #AxmLeftInSound + #RulClassComprehension):
1\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \)
Step 0b (set β†’ V, from #DefUniversalClass + #AxmLeftInSound + #RulClassComprehension + #AxmPropVerum):
1\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \)
Step 1 (Ο‰ ∈ V, from #AxmOmegaIsSet + Step 0b):
1\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/omega-const.html}{\omega} \href{symbols/in-pred.html}{\in} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \)
Step 2 (V transitive, from #DefTransitiveClass + #DefSubclass + #DefIsSet + Step 0b):
1\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/trans-pred.html}{\mathrm{Tr}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \)
Step 3 (V Hereditary, from #DefHereditaryClass + #AxmHeredity + Steps 0a, 0b):
1\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/hereditary-pred.html}{\mathsf{Hereditary}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \)
Step 4 (V Powerful, from #DefPowerfulClass + #AxmExponent + Steps 0a, 0b):
1\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/powerful-pred.html}{\mathsf{Powerful}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \)
Step 5 (V Tight, from #DefTightClass + #AxmSizeLimitation + #DefCardinality/#DefCardLess):
1\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/tight-pred.html}{\mathsf{Tight}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \)
Step 6 (V Pairful, from #DefPairfulClass + #DefUnorderedPair sethood + Steps 0a, 0b):
1\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/pairful-pred.html}{\mathsf{Pairful}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \)
Step 7 (Instantiated #DefGrothendieckUniverse at U := V):
1\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/universe-pred.html}{\mathsf{universe}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/omega-const.html}{\omega} \href{symbols/in-pred.html}{\in} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/trans-pred.html}{\mathrm{Tr}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/hereditary-pred.html}{\mathsf{Hereditary}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/powerful-pred.html}{\mathsf{Powerful}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/tight-pred.html}{\mathsf{Tight}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/pairful-pred.html}{\mathsf{Pairful}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \)
Step 8 (Conclusion via PAndR_prf + def_to_intro, verified by Thm.checkPipeline & Thm.slow_check):
1\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/universal-class-const.html}{\mathbf{V}} \href{symbols/universe-pred.html}{\mathsf{universe}} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \)
Kernel Note Formal kernel proof (v_universe_thm_proof : unit -> Thm, verified by Thm.checkPipeline and Thm.slow_check) deriving (𝘍, [] ⊒ (V universe)) from 3.68 #DefGrothendieckUniverse (PKernelDef_prf) and the 6 component lemmas: (1) (Ο‰ ∈ V) via 3.57 #AxmOmegaIsSet (POmegaSetAx_prf), 3.05 #DefUniversalClass (PKernelDef_prf), 3.08 #AxmLeftInSound (PLeftInSoundAx_prf), and 3.01 #RulClassComprehension (PComprAx_prf); (2) (V transitive) via 3.15 #DefTransitiveClass (PKernelDef_prf), 3.06 #DefSubclass (PKernelDef_prf), and 3.02 #DefIsSet (PSetDef_prf); (3) (V Hereditary) via 3.44 #DefHereditaryClass (PKernelDef_prf) and 3.12 #AxmHeredity (PHeredityAx_prf); (4) (V Powerful) via 3.45 #DefPowerfulClass (PKernelDef_prf) and 3.13 #AxmExponent (PPowSetAx_prf); (5) (V Tight) via 3.47 #DefTightClass (PKernelDef_prf), 3.43 #AxmSizeLimitation (PSizeLimAx_prf), and 3.41/3.42 #DefCardinality/#DefCardLess (PCardLessOrderAx_prf); (6) (V Pairful) via 3.46 #DefPairfulClass (PKernelDef_prf) and 3.49 #DefUnorderedPair sethood (PPairSetAx_prf). Backup axiom constructor PVUniverseAx_prf (v_universe_axm_backup_entry) is also retained in the kernel just in case.
Verification Verified (Kernel) · Standalone Entry (ThmUniversalClassIsUniverse) → · (3.69) · #ThmUniversalClassIsUniverse
3.70
Title β€œTarski's axiom” #AxmTarskiUniverses #label-tarski-s-axiom
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{u} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{u} \href{symbols/universe-pred.html}{\mathsf{universe}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{u} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{u} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpUniverse
Scheme of Types 0(βˆ€([x@Variable]:[Class@Type])(([x@Class.Expression] set)β†’βˆƒ([u@Variable]:[Class@Type])((([u@Class.Expression] universe)∧([x@Class.Expression]∈[u@Class.Expression]))∧([u@Class.Expression] set))))
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmTarskiUniverses) → · (3.70) · #AxmTarskiUniverses
3.71
Title General form of the transfinite ∈-induction principle on a transitive class #ThmTransitiveClassInduction #label-general-form-of-the-transfinite-induction-principle-on-a-transitive-class
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/trans-pred.html}{\mathrm{Tr}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/bininter-op.html}{\cap} \href{symbols/power-op.html}{\mathcal{P}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{K} \href{symbols/sub-pred.html}{\subseteq} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PEpsIndAx_prf
Scheme of Types 0(βˆ€([K@Variable]:[Class@Type])βˆ€([A@Variable]:[Class@Type])((Tr([K@Class.Expression])∧(([K@Class.Expression]βˆ©π’«([A@Class.Expression]))βŠ†[A@Class.Expression]))β†’([K@Class.Expression]βŠ†[A@Class.Expression])))
Kernel Note Transfinite membership (∈) induction on a well-founded transitive class, contrasted with successor-induction (Peano 0-successor-induction Ind(X) in 3.55).
Verification Verified (Kernel) · Standalone Entry (ThmTransitiveClassInduction) → · (3.71) · #ThmTransitiveClassInduction
3.72
Title Soundness of the theory π˜› #AxmSoundnessOfBaseTheory #label-soundness-of-the-theory
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-tau.html}{\mathcal{T}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/eval.html}{\mathsf{eval}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpHolds
Scheme of Types 0(βˆ€([𝛗@Variable]:[Fm@Type])((π˜›,[]⊒[𝛗@Fm.Expression])β†’eval([𝛗@Fm.Expression])))
Kernel Note Local reflection / soundness schema for the recursively enumerable (r.e.) base theory of classes π˜›: if (π˜›, [] ⊒ Ο†), then the explicit formula valuation βŸ¦Ο†βŸ§ holds in the fixed background model.
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmSoundnessOfBaseTheory) → · (3.72) · #AxmSoundnessOfBaseTheory
3.73
Title Soundness of the theory 𝘍 #AxmSoundnessOfFullTheory #label-soundness-of-the-theory
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/eval.html}{\mathsf{eval}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PCredo_prf
Scheme of Types 0(βˆ€([𝛗@Variable]:[Fm@Type])((𝘍,[]⊒[𝛗@Fm.Expression])β†’eval([𝛗@Fm.Expression])))
Kernel Note 𝘍 is a non-recursively-enumerable (non-r.e.), Henkin-complete extension of the r.e. base theory π˜› (π˜› βŠ† 𝘍). Because 𝘍 is non-r.e., GΓΆdel's incompleteness theorems do not apply to 𝘍 itself, and 𝘍 is postulated with full soundness (𝘍, [] ⊒ Ο†) β†’ βŸ¦Ο†βŸ§.
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmSoundnessOfFullTheory) → · (3.73) · #AxmSoundnessOfFullTheory
3.74
Title Completeness of the theory 𝘍 #AxmCompletenessOfFullTheory #label-completeness-of-the-theory
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/eval.html}{\mathsf{eval}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST POmnis_prf
Scheme of Types 0(βˆ€([𝛗@Variable]:[Fm@Type])(eval([𝛗@Fm.Expression])β†’(𝘍,[]⊒[𝛗@Fm.Expression])))
Kernel Note Negation-completeness of the non-r.e. Henkin extension 𝘍: for every sentence Ο†, if ¬φ is not derivable in 𝘍, then Ο† is derivable in 𝘍.
Verification Definitional (Kernel AST) · Standalone Entry (AxmCompletenessOfFullTheory) → · (3.74) · #AxmCompletenessOfFullTheory
3.75
Title If a formula is derivable in π˜›, then it is derivable in 𝘍 #AxmBaseSubtheoryOfFull #label-if-a-formula-is-derivable-in-then-it-is-derivable-in
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/typing-colon.html}{:} \href{symbols/ctx-sort.html}{\mathsf{Ctx}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-tau.html}{\mathcal{T}} \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpHolds
Scheme of Types 0(βˆ€([Ξ“@Variable]:[Ctx@Type])βˆ€([𝛗@Variable]:[Fm@Type])((π˜›,[Ξ“@Ctx.Expression]⊒[𝛗@Fm.Expression])β†’(𝘍,[Ξ“@Ctx.Expression]⊒[𝛗@Fm.Expression])))
Kernel Note Theory extension monotonicity (π˜› βŠ† 𝘍): every theorem of the r.e. base theory π˜› is also a theorem of its non-r.e. Henkin completion 𝘍.
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmBaseSubtheoryOfFull) → · (3.75) · #AxmBaseSubtheoryOfFull
3.76
Title Ordered pair(Dunaev's tagged class pair) #DefDunaevOrderedPair #label-ordered-pair-dunaev-s-tagged-class-pair
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/eq-pred.html}{=} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/singleton-op.html}{\{} \href{symbols/upair-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/comma-delim.html}{,} \href{symbols/singleton-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/singleton-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/binunion-op.html}{\cup} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{x} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/eq-pred.html}{=} \href{symbols/upair-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/variables.html}{a} \href{symbols/singleton-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/comma-delim.html}{,} \href{symbols/singleton-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/singleton-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/binunion-op.html}{\cup} \href{symbols/delimiters-brackets.html}{(} \href{symbols/singleton-op.html}{\{} \href{symbols/upair-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/comma-delim.html}{,} \href{symbols/upair-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/comma-delim.html}{,} \href{symbols/singleton-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/singleton-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/binunion-op.html}{\cup} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{x} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{a} \href{symbols/in-pred.html}{\in} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/eq-pred.html}{=} \href{symbols/upair-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/variables.html}{a} \href{symbols/singleton-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/comma-delim.html}{,} \href{symbols/upair-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/comma-delim.html}{,} \href{symbols/singleton-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/singleton-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpOPair
Scheme of Types 0(βˆ€([A@Variable]:[Class@Type])βˆ€([B@Variable]:[Class@Type])(([A@Class.Expression],[B@Class.Expression])=(({{βˆ…,{βˆ…}}}βˆͺ{[x@Class.Expression]|βˆƒ([a@Variable]:[Class@Type])(([a@Class.Expression]∈[A@Class.Expression])∧([x@Class.Expression]={{{{[a@Class.Expression]}}},{βˆ…}}))})βˆͺ({{βˆ…,{βˆ…,{βˆ…}}}}βˆͺ{[x@Class.Expression]|βˆƒ([a@Variable]:[Class@Type])(([a@Class.Expression]∈[B@Class.Expression])∧([x@Class.Expression]={{{{[a@Class.Expression]}}},{βˆ…,{βˆ…}}}))}))))
Kernel Note Dunaev tagged class ordered pair (A,B) = mark(A,1) βˆͺ mark(B,2), sound for arbitrary proper classes.
Verification Definitional (Kernel AST) · Standalone Entry (DefDunaevOrderedPair) → · (3.76) · #DefDunaevOrderedPair
3.77
Title First projection of Dunaev's tagged ordered pair #ThmDunaevFirstProjection #label-first-projection-of-dunaev-s-tagged-ordered-pair
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{a} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/upair-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/variables.html}{a} \href{symbols/singleton-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/comma-delim.html}{,} \href{symbols/singleton-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/singleton-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/in-pred.html}{\in} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpPr1
Scheme of Types 0(βˆ€([A@Variable]:[Class@Type])βˆ€([B@Variable]:[Class@Type])({[a@Class.Expression]|{{{{[a@Class.Expression]}}},{βˆ…}}∈([A@Class.Expression],[B@Class.Expression])}=[A@Class.Expression]))
Kernel Note Recovers A from (A,B) via tag 1 without requiring A or B to be sets.
Verification Verified (Kernel) · Standalone Entry (ThmDunaevFirstProjection) → · (3.77) · #ThmDunaevFirstProjection
3.78
Title Second projection of Dunaev's tagged ordered pair #ThmDunaevSecondProjection #label-second-projection-of-dunaev-s-tagged-ordered-pair
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{B} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/class-comprehension.html}{\{} \href{symbols/variables.html}{b} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/upair-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/singleton-op.html}{\{} \href{symbols/variables.html}{b} \href{symbols/singleton-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/singleton-op.html}{\}} \href{symbols/comma-delim.html}{,} \href{symbols/upair-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/comma-delim.html}{,} \href{symbols/singleton-op.html}{\{} \href{symbols/emptyset-const.html}{\emptyset} \href{symbols/singleton-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/upair-op.html}{\}} \href{symbols/in-pred.html}{\in} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/comma-delim.html}{,} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/class-comprehension.html}{\}} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{B} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST CpPr2
Scheme of Types 0(βˆ€([A@Variable]:[Class@Type])βˆ€([B@Variable]:[Class@Type])({[b@Class.Expression]|{{{{[b@Class.Expression]}}},{βˆ…,{βˆ…}}}∈([A@Class.Expression],[B@Class.Expression])}=[B@Class.Expression]))
Kernel Note Recovers B from (A,B) via tag 2 without requiring A or B to be sets.
Verification Verified (Kernel) · Standalone Entry (ThmDunaevSecondProjection) → · (3.78) · #ThmDunaevSecondProjection

4. Metalogical Laws (4.01–4.06)

Explicit substitution, context encoding, co-necessitation, uniqueness quantifiers, and reflected comprehension.

Num Entity Database Record (Vertical Field Table)
4.01
Title Instantiation(meta,WIP) #DefMetaInstantiation #label-instantiation-meta-wip
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/type-sort.html}{\mathsf{Type}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{G} \href{symbols/typing-colon.html}{:} \href{symbols/ctx-sort.html}{\mathsf{Ctx}} \href{symbols/dot-delim.html}{.} \href{symbols/expression-sort.html}{\mathsf{Expression}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{t} \href{symbols/typing-colon.html}{:} \href{symbols/eval.html}{\mathsf{eval}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/dot-delim.html}{.} \href{symbols/expression-sort.html}{\mathsf{Expression}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{v} \href{symbols/typing-colon.html}{:} \href{symbols/variable-sort.html}{\mathsf{Variable}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-wau.html}{\mathcal{W}} \href{symbols/comma-delim.html}{,} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{G} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{v} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/typing-colon.html}{:} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{A} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/substitution-let.html}{\mathbf{let}} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{v} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/eq-pred.html}{=} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{t} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/substitution-let.html}{\mathbf{in}} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST ELet
Scheme of Types 0(βˆ€([A@Variable]:[Type@Type])βˆ€([G@Variable]:[Ctx.Expression@Type])βˆ€([𝛗@Variable]:[Fm@Type])βˆ€([t@Variable]:[eval([A@Type.Expression.Expression]).Expression@Type])βˆ€([v@Variable]:[Variable@Type])(𝘞,⟦[G@Ctx.Expression.Expression]βŸ§βŠ’β€Ή(βˆ€([⦃[v@Variable.Expression]⦄@Variable]:[⟦[A@Type.Expression.Expression]⟧@Type])⟦[𝛗@Fm.Expression]⟧)β†’(let ⟦[v@Name.Expression]⟧ = ⟦[t@Class.Expression.Expression]⟧ in ⟦[𝛗@Fm.Expression]⟧)β€Ί))
Verification Postulated (Kernel Axiom) · Standalone Entry (DefMetaInstantiation) → · (4.01) · #DefMetaInstantiation
4.02
Title Generalisation(meta,WIP) #DefMetaGeneralisation #label-generalisation-meta-wip
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{A} \href{symbols/typing-colon.html}{:} \href{symbols/type-sort.html}{\mathsf{Type}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/typing-colon.html}{:} \href{symbols/ctx-sort.html}{\mathsf{Ctx}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{v} \href{symbols/typing-colon.html}{:} \href{symbols/variable-sort.html}{\mathsf{Variable}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/neg-conn.html}{\neg} \href{symbols/ctx-sort.html}{\mathsf{Ctx}} \href{symbols/dot-delim.html}{.} \href{symbols/ifv-pred.html}{\mathrm{IFV}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{v} \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-wau.html}{\mathcal{W}} \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-wau.html}{\mathcal{W}} \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{v} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/typing-colon.html}{:} \href{symbols/variables.html}{A} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PForaR_prf
Scheme of Types 0(βˆ€([A@Variable]:[Type@Type])βˆ€([Ξ“@Variable]:[Ctx@Type])βˆ€([𝛗@Variable]:[Fm@Type])βˆ€([v@Variable]:[Variable@Type])((Β¬Ctx.IFV([v@Variable.Expression],[Ξ“@Ctx.Expression]))β†’((𝘞,[Ξ“@Ctx.Expression]⊒[𝛗@Fm.Expression])β†’(𝘞,[Ξ“@Ctx.Expression]βŠ’β€Ήβˆ€([⦃[v@Variable.Expression]⦄@Variable]:[[A@Type]@Type])⟦[𝛗@Fm.Expression]βŸ§β€Ί))))
Kernel Note (A theory 𝘞 is assumed here to contain only formulas without free variables, so the variable x has no free occurences in any formula of a set of formulas [|Dec(Theory.Expression)(W)|]. Here Enc(v) (ΞΌ_Variable(v) : Variable.Expression β†’ Class.Expression) denotes the explicit typed term interpretation / valuation homomorphism mapping a typed term of sort A into a term of sort Class while respecting the fixed model and variable valuation.)
Verification Postulated (Kernel Axiom) · Standalone Entry (DefMetaGeneralisation) → · (4.02) · #DefMetaGeneralisation
4.03
Title CoNecessitation(meta,WIP) #DefMetaConecessitation #label-conecessitation-meta-wip
Classification Inference Rule
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/typing-colon.html}{:} \href{symbols/ctx-sort.html}{\mathsf{Ctx}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-fau.html}{\mathcal{F}} \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\Gamma} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PCredo_prf
Scheme of Types 0(βˆ€([Ξ“@Variable]:[Ctx@Type])βˆ€([𝛗@Variable]:[Fm@Type])((𝘍,[]βŠ’β€Ήπ˜,[Ξ“@Ctx.Expression]⊒[𝛗@Fm.Expression]β€Ί)β†’(𝘍,[Ξ“@Ctx.Expression]⊒[𝛗@Fm.Expression])))
Kernel Note If a formula < 𝘍,Ξ“βŠ’π›—> is derived in 𝘍 from the empty context, then the formula 𝛗 is derived in 𝘍 from the context Ξ“. Why this holds for 𝘍: for an arbitrary theory 𝘞, concluding (𝘞, Ξ“βŠ’π›—) from (𝘞, [] ⊒ <𝘞, Ξ“βŠ’π›—>) requires 1-consistency / Σ₁-soundness of 𝘞 (and for the r.e. base theory π˜›, asserting internal co-necessitation would by LΓΆb's theorem 5.01 trivialize π˜›). Because 𝘍 is a non-r.e. sound Henkin extension equipped with Soundness 3.73 ((𝘍, [] ⊒ ψ) β†’ ⟦ψ⟧), instantiating 3.73 at ψ := <𝘍, Ξ“βŠ’π›—> directly yields (𝘍, Ξ“βŠ’π›—).
Verification Primitive / Derived Rule (Kernel) · Standalone Entry (DefMetaConecessitation) → · (4.03) · #DefMetaConecessitation
4.04
Title Quantifier β€œunique”(meta,WIP) #DefAtMostOneBinder #label-quantifier-unique-meta-wip
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/uniq-binder.html}{!} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{z} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{y} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/image-op.html}{[} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/dot-delim.html}{.} \href{symbols/expression-sort.html}{\mathsf{Expression}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/subst-slash.html}{/} \href{symbols/quotation.html}{\langle } \href{symbols/variables.html}{z} \href{symbols/quotation.html}{\rangle } \href{symbols/image-op.html}{]} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/substitution-let.html}{\mathbf{let}} \href{symbols/variables.html}{z} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{y} \href{symbols/substitution-let.html}{\mathbf{in}} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/eq-pred.html}{=} \href{symbols/variables.html}{y} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpUniq
Scheme of Types 0(βˆ€([𝛗@Variable]:[Fm@Type])((!([z@Variable]:[Class@Type])⟦[𝛗@Fm.Expression]⟧)⟷(βˆ€([x@Variable]:[Class@Type])βˆ€([y@Variable]:[Class@Type])((⟦[𝛗@Fm.Expression][([x@Class.Expression.Expression]:Class.Expression)/β€Ήzβ€Ί]⟧∧(let z = [y@Class.Expression] in ⟦[𝛗@Fm.Expression]⟧))β†’([x@Class.Expression]=[y@Class.Expression])))))
Verification Definitional (Kernel AST) · Standalone Entry (DefAtMostOneBinder) → · (4.04) · #DefAtMostOneBinder
4.05
Title Quantifier β€œexists and unique”(meta,WIP) #DefExistsUniqueBinder #label-quantifier-exists-and-unique-meta-wip
Classification Definition
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-tau.html}{\mathcal{T}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/delimiters-brackets.html}{(} \href{symbols/exists-uniq-binder.html}{\exists!} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/exists-binder.html}{\exists} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/uniq-binder.html}{!} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpExisUniq
Scheme of Types 0(βˆ€([𝛗@Variable]:[Fm@Type])(π˜›,[]βŠ’β€Ή(βˆƒ!([x@Variable]:[Class@Type])⟦[𝛗@Fm.Expression]⟧)⟷((βˆƒ([x@Variable]:[Class@Type])⟦[𝛗@Fm.Expression]⟧)∧!([x@Variable]:[Class@Type])⟦[𝛗@Fm.Expression]⟧)β€Ί))
Verification Definitional (Kernel AST) · Standalone Entry (DefExistsUniqueBinder) → · (4.05) · #DefExistsUniqueBinder
4.06
Title Class comprehension axiom schema(meta,WIP) #AxmMetaClassComprehension #label-class-comprehension-axiom-schema-meta-wip
Classification Axiom
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{x} \href{symbols/typing-colon.html}{:} \href{symbols/name-sort.html}{\mathsf{Name}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{k} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/dot-delim.html}{.} \href{symbols/expression-sort.html}{\mathsf{Expression}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/dot-delim.html}{.} \href{symbols/ffi-pred.html}{\mathrm{FFI}} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/variables.html}{k} \href{symbols/typing-colon.html}{:} \href{symbols/class-type.html}{\mathsf{Class}} \href{symbols/dot-delim.html}{.} \href{symbols/expression-sort.html}{\mathsf{Expression}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/comma-delim.html}{,} \href{symbols/quotation.html}{\langle } \href{symbols/variables.html}{x} \href{symbols/quotation.html}{\rangle } \href{symbols/comma-delim.html}{,} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-tau.html}{\mathcal{T}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{k} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/in-pred.html}{\in} \href{symbols/class-comprehension.html}{\{} \href{symbols/binder-brackets.html}{\{\!\lvert } \href{symbols/variables.html}{x} \href{symbols/binder-brackets.html}{\rvert\!\}} \href{symbols/class-comprehension.html}{ \mid } \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/class-comprehension.html}{\}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/iff-conn.html}{\longleftrightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/delimiters-brackets.html}{(} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{k} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/set-pred.html}{\mathsf{set}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/and-conn.html}{\land} \href{symbols/delimiters-brackets.html}{(} \href{symbols/substitution-let.html}{\mathbf{let}} \href{symbols/variables.html}{x} \href{symbols/eq-pred.html}{=} \href{symbols/antiquotation.html}{[\![ } \href{symbols/variables.html}{k} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/substitution-let.html}{\mathbf{in}} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PComprAx_prf
Scheme of Types 0(βˆ€([𝛗@Variable]:[Fm@Type])βˆ€([x@Variable]:[Name@Type])βˆ€([k@Variable]:[Class.Expression@Type])(Fm.FFI(([k@Class.Expression.Expression]:Class.Expression),β€Ή[x@Name.Expression]β€Ί,[𝛗@Fm.Expression])β†’(π˜›,[]βŠ’β€Ή(⟦[k@Class.Expression.Expression]⟧∈{[⦃[x@Variable.Expression]⦄@Class.Expression]|⟦[𝛗@Fm.Expression]⟧})⟷((⟦[k@Class.Expression.Expression]⟧ set)∧(let [x@Name.Expression] = ⟦[k@Class.Expression.Expression]⟧ in ⟦[𝛗@Fm.Expression]⟧))β€Ί)))
Verification Postulated (Kernel Axiom) · Standalone Entry (AxmMetaClassComprehension) → · (4.06) · #AxmMetaClassComprehension

5. Incompleteness-Related Statements (5.01–5.02)

Formalized LΓΆb's theorem and GΓΆdel's second incompleteness theorem.

Num Entity Database Record (Vertical Field Table)
5.01
Title LΓΆb's theorem(WIP) #ThmLoeb #label-l-b-s-theorem-wip
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/forall-binder.html}{\forall} \href{symbols/delimiters-brackets.html}{(} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/typing-colon.html}{:} \href{symbols/fm-sort.html}{\mathsf{Fm}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-eau.html}{\mathcal{E}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-tau.html}{\mathcal{T}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-tau.html}{\mathcal{T}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/antiquotation.html}{[\![ } \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/antiquotation.html}{ ]\!]} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-tau.html}{\mathcal{T}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpHolds
Scheme of Types 0(βˆ€([𝛗@Variable]:[Fm@Type])(𝘌,[]βŠ’β€Ή(π˜›,[]βŠ’β€Ή(π˜›,[]⊒[𝛗@Fm.Expression])β†’βŸ¦[𝛗@Fm.Expression]βŸ§β€Ί)β†’(π˜›,[]⊒[𝛗@Fm.Expression])β€Ί))
Kernel Note Here 𝘌 ∈ {IΣ₁, PA, π˜›, NBG, MK} is an unspecified elementary metatheory capable of proving the Hilbert-Bernays-LΓΆb derivability conditions D1-D3 for the r.e. base theory π˜› (specifically D3, Σ₁-completeness, which requires Σ₁-induction and fails in Robinson's arithmetic Q; see HΓ‘jek & PudlΓ‘k 1993, Metamathematics of First-Order Arithmetic, Ch. I Β§3 & Ch. III; Bezboruah & Shepherdson 1976, JSL 41(2):503-512; Boolos 1993, The Logic of Provability, Ch. 2).
Verification Verified (Kernel) · Standalone Entry (ThmLoeb) → · (5.01) · #ThmLoeb
5.02
Title GΓΆdel's second incompleteness theorem(WIP) #ThmSecondIncompleteness #label-g-del-s-second-incompleteness-theorem-wip
Classification Theorem
Formula
0\(\href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-eau.html}{\mathcal{E}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/delimiters-brackets.html}{(} \href{symbols/neg-conn.html}{\neg} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-tau.html}{\mathcal{T}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/bot-const.html}{\bot} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \href{symbols/delimiters-brackets.html}{)} \href{symbols/impl-conn.html}{\rightarrow} \href{symbols/neg-conn.html}{\neg} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-tau.html}{\mathcal{T}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/neg-conn.html}{\neg} \href{symbols/delimiters-brackets.html}{(} \href{symbols/theory-tau.html}{\mathcal{T}} \href{symbols/comma-delim.html}{,} \href{symbols/empty-list-const.html}{[\,]} \href{symbols/turnstile-derivability.html}{\vdash} \href{symbols/quotation.html}{\langle } \href{symbols/bot-const.html}{\bot} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \href{symbols/quotation.html}{\rangle } \href{symbols/delimiters-brackets.html}{)} \)
SML Kernel AST TpHolds
Scheme of Types 0(𝘌,[]βŠ’β€Ή(Β¬(π˜›,[]βŠ’β€ΉβŠ₯β€Ί))β†’Β¬(π˜›,[]βŠ’β€ΉΒ¬(π˜›,[]βŠ’β€ΉβŠ₯β€Ί)β€Ί)β€Ί)
Kernel Note Formalized in the unspecified elementary metatheory 𝘌 ∈ {IΣ₁, PA, π˜›, NBG, MK} (not Robinson's Q, which lacks Σ₁-induction needed for HBL condition D3; cf. HΓ‘jek & PudlΓ‘k 1993; Bezboruah & Shepherdson 1976) for the recursively enumerable object theory π˜›. Note that GΓΆdel's second incompleteness theorem applies to the r.e. theory π˜›, whereas 𝘍 is non-r.e.
Verification Verified (Kernel) · Standalone Entry (ThmSecondIncompleteness) → · (5.02) · #ThmSecondIncompleteness