[Imprint][Data Privacy Statement][E-Mail]

Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Theorem base for Specification finitedepth-trees-gen

This is a listing of all goals defined over the current specification. Axioms are marked yellow, proved theorems green and unproved theorems blue. Click on individual names to get more information on the proof.

Name: Sequent: Type:
treep-def ⊦ treep(g) ↔ rooted(g) ∧ nocycle(g) An Axiom
order-def ⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )) An Axiom
rooted-def ⊦ rooted(g) ↔ (∃ a. isroot(g)(a) ∧ (∀ b. path(g)(a, b))) An Axiom
findepth-def ⊦ findepth(g) ↔ (∀ σ. pathp(g)(σ) → # σ ≠ ∞) An Axiom
nocycle-def ⊦ nocycle(g) ↔ (∀ a, y. ¬ pathp(g)(⌜a '⌝ + ⌜y⌝ + ⌜a '⌝ )) An Axiom
findepth-nocyclefindepth(g) ⊦ nocycle(g) A User Theorem
irreflexivenocycle(g) ⊦ ¬ ls(g)(a, a) A User Theorem
transitive ⊦ ls(g)(a, b) ∧ ls(g)(b, c) → ls(g)(a, c) A User Theorem
unique-root ⊦ rooted(g) ∧ isroot(g)(a) ∧ isroot(g)(b) → a = b A User Theorem
well-foundedfindepth(g) ⊦ ¬(∃ nf. ∀ n. ls(g)(nf(n + 1), nf(n))) A User Theorem
well-founded-indrooted(g), findepth(g), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ eP(a) A User Theorem