[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 Koenigs-Lemma-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:
infgraph-def ⊦ infgraph(g) ↔ (∀ s. ∃ a. dom(g)(a) ∧ ¬ a ∈ s) An Axiom
finroot-def ⊦ finroot(g) ↔ (∃ s. ∀ a. isroot(g)(a) ↔ a ∈ s) An Axiom
finout-def ⊦ finout(g) ↔ (∀ a. ∃ s. ∀ b. edge(g)(a, b) ↔ b ∈ s) An Axiom
allreachable-def ⊦ allreachable(g) ↔ (∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b))) An Axiom
reach-def ⊦ reach(g)(s, n)(b) ↔ (∃ x. x ≠ [] ∧ x.head ∈ s ∧ pathp(g)(⌜x⌝ ) ∧ b = x.last ∧ # x = n + 1) An Axiom
haspathanylength-def ⊦ haspathanylength(g)(a) ↔ (∀ n. ∃ x. x.head = a ∧ # x = n + 1 ∧ pathp(g)(⌜x⌝ )) An Axiom
reachle-def ⊦ reach≤(g)(s, n)(b) ↔ (∃ m. m ≤ n ∧ reach(g)(s, m)(b)) An Axiom
it-succ ⊦ ((cf ^ (n + 1)))(x) = cf(((cf ^ n))(x)) An Axiom
it-zero ⊦ ((cf ^ 0))(x) = x An Axiom
KoenigsLemmainfgraph(g), finroot(g), finout(g), allreachable(g) ⊦ ∃ nf. isroot(g)(nf(0)) ∧ pathp(g)(⌜nf⌝ ) A User Theorem
KoenigsLemma-auxisroot(g)(a), haspathanylength(g)(a), ∀ x. x ≠ [] ∧ pathp(g)(⌜x⌝ ) ∧ haspathanylength(g)(x.last) → (∃ b. cf(x) = x + b ') ∧ pathp(g)(⌜cf(x)⌝ ) ∧ haspathanylength(g)(cf(x).last) ⊦ # ((cf ^ n))(a ') = n + 1 ∧ haspathanylength(g)(((cf ^ n))(a ').last) ∧ pathp(g)(⌜((cf ^ n))(a ')⌝ ) A User Theorem
finreach-finfinout(g) ⊦ ∃ s0. ∀ a. reach(g)(s, n)(a) ↔ a ∈ s0 A User Theorem
finreachle-finfinout(g) ⊦ ∃ s0. ∀ a. reach≤(g)(s, n)(a) ↔ a ∈ s0 A User Theorem
finset-nextfinfinout(g) ⊦ ∀ s. ∃ s0. ∀ b. b ∈ s0 ↔ (∃ a. a ∈ s ∧ edge(g)(a, b)) A User Theorem
hpal-nextfinout(g) ⊦ ∀ x. x ≠ [] ∧ pathp(g)(⌜x⌝ ) ∧ haspathanylength(g)(x.last) → (∃ y. (∃ b. y = x + b ') ∧ pathp(g)(⌜y⌝ ) ∧ haspathanylength(g)(y.last)) A User Theorem
hpal-next-aux∀ b. edge(g)(a, b) ↔ b ∈ s, ∀ b. b ∈ s → ¬ haspathanylength(g)(b) ⊦ ¬ haspathanylength(g)(a) A User Theorem
hpal-next-auxh∀ b. b ∈ s → ¬ haspathanylength(g)(b) ⊦ ∃ n. ∀ x. pathp(g)(⌜x⌝ ) ∧ x ≠ [] ∧ x.head ∈ s → # x < n A User Theorem
hpal-reachset-setfinout(g), ∀ a. a ∈ s → ¬ haspathanylength(g)(a) ⊦ ∃ s0. ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0 A User Theorem
hpal-rootinfgraph(g), allreachable(g), finroot(g), finout(g) ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) A User Theorem