| infgraph(g), allreachable(g), finroot(g), finout(g) ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
allreachable(g), finout(g), finroot(g), infgraph(g) ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
| allreachable(g), finout(g), finroot(g), infgraph(g) ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
⊦ finroot(g) ↔ (∃ s. ∀ a. isroot(g)(a) ↔ a ∈ s)
allreachable(g), finout(g), infgraph(g), ∃ s. ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
Used terms: g
| ⊦ finroot(g) ↔ (∃ s. ∀ a. isroot(g)(a) ↔ a ∈ s) |
| allreachable(g), finout(g), infgraph(g), ∃ s. ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
finout(g), infgraph(g), ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)) ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
Used simplifier rules: allreachable-def: ⊦ allreachable(g) ↔ (∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)));
| finout(g), infgraph(g), ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)) ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
finout(g), ∀ a. a ∈ s → ¬ haspathanylength(g)(a) ⊦ ∃ s0. ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0
finout(g), infgraph(g), ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∀ a. a ∈ s → ¬ haspathanylength(g)(a), ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
finout(g), infgraph(g), ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s, ∃ s0. ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0 ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
Used terms: g, s
| finout(g), ∀ a. a ∈ s → ¬ haspathanylength(g)(a) ⊦ ∃ s0. ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0 |
| finout(g), infgraph(g), ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∀ a. a ∈ s → ¬ haspathanylength(g)(a), ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
# s ≠ 0, s ≠ ∅, finout(g), haspathanylength(g)(a), infgraph(g), a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic
| # s ≠ 0, s ≠ ∅, finout(g), haspathanylength(g)(a), infgraph(g), a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
# s ≠ 0, s ≠ ∅, finout(g), haspathanylength(g)(a), infgraph(g), a ∈ s, ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)) ⊦ isroot(g)(a) ∧ haspathanylength(g)(a)
Used terms: a
| # s ≠ 0, s ≠ ∅, finout(g), haspathanylength(g)(a), infgraph(g), a ∈ s, ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)) ⊦ isroot(g)(a) ∧ haspathanylength(g)(a) |
# s ≠ 0, s ≠ ∅, finout(g), haspathanylength(g)(a), infgraph(g), a ∈ s, ¬ isroot(g)(a), ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s ⊦
| # s ≠ 0, s ≠ ∅, finout(g), haspathanylength(g)(a), infgraph(g), a ∈ s, ¬ isroot(g)(a), ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ |
Used terms: a
| finout(g), infgraph(g), ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s, ∃ s0. ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0 ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
finout(g), infgraph(g), ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0, ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)) ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
| finout(g), infgraph(g), ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0, ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)) ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
⊦ infgraph(g) ↔ (∀ s. ∃ a. dom(g)(a) ∧ ¬ a ∈ s)
finout(g), ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0, ∀ s. ∃ a. dom(g)(a) ∧ ¬ a ∈ s ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
Used terms: g
| ⊦ infgraph(g) ↔ (∀ s. ∃ a. dom(g)(a) ∧ ¬ a ∈ s) |
| finout(g), ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0, ∀ s. ∃ a. dom(g)(a) ∧ ¬ a ∈ s ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
finout(g), ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0, ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∃ a. dom(g)(a) ∧ ¬ a ∈ s0 ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
Used terms: s0
| finout(g), ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0, ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∃ a. dom(g)(a) ∧ ¬ a ∈ s0 ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
dom(g)(a), finout(g), ¬ a ∈ s0, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0 ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
| dom(g)(a), finout(g), ¬ a ∈ s0, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. (∃ a. a ∈ s ∧ path(g)(a, b)) ↔ b ∈ s0 ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
dom(g)(a), finout(g), ¬ a ∈ s0, (∃ a0. a0 ∈ s ∧ path(g)(a0, a)) ↔ a ∈ s0, ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)) ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
Used terms: a
| dom(g)(a), finout(g), ¬ a ∈ s0, (∃ a0. a0 ∈ s ∧ path(g)(a0, a)) ↔ a ∈ s0, ∀ a. isroot(g)(a) ↔ a ∈ s, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)) ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
dom(g)(a), finout(g), ¬ a ∈ s0, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a), ∃ a0. a0 ∈ s ∧ path(g)(a0, a)
| dom(g)(a), finout(g), ¬ a ∈ s0, ∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)), ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a), ∃ a0. a0 ∈ s ∧ path(g)(a0, a) |
dom(g)(a), finout(g), ¬ a ∈ s0, dom(g)(a) → (∃ a0. isroot(g)(a0) ∧ path(g)(a0, a)), ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∃ a0. a0 ∈ s ∧ path(g)(a0, a), ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
Used terms: a
| dom(g)(a), finout(g), ¬ a ∈ s0, dom(g)(a) → (∃ a0. isroot(g)(a0) ∧ path(g)(a0, a)), ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∃ a0. a0 ∈ s ∧ path(g)(a0, a), ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
dom(g)(a), finout(g), isroot(g)(a0), path(g)(a0, a), ¬ a ∈ s0, ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a), ∃ a0. a0 ∈ s ∧ path(g)(a0, a)
| dom(g)(a), finout(g), isroot(g)(a0), path(g)(a0, a), ¬ a ∈ s0, ∀ a. isroot(g)(a) ↔ a ∈ s ⊦ ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a), ∃ a0. a0 ∈ s ∧ path(g)(a0, a) |
isroot(g)(a0) ↔ a0 ∈ s, dom(g)(a), finout(g), isroot(g)(a0), path(g)(a0, a), ¬ a ∈ s0 ⊦ ∃ a0. a0 ∈ s ∧ path(g)(a0, a), ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
Used terms: a0
| isroot(g)(a0) ↔ a0 ∈ s, dom(g)(a), finout(g), isroot(g)(a0), path(g)(a0, a), ¬ a ∈ s0 ⊦ ∃ a0. a0 ∈ s ∧ path(g)(a0, a), ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
# s ≠ 0, s ≠ ∅, dom(g)(a), finout(g), isroot(g)(a0), path(g)(a0, a), a0 ∈ s, ¬ a ∈ s0 ⊦ ∃ a0. a0 ∈ s ∧ path(g)(a0, a), ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a)
Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic
| # s ≠ 0, s ≠ ∅, dom(g)(a), finout(g), isroot(g)(a0), path(g)(a0, a), a0 ∈ s, ¬ a ∈ s0 ⊦ ∃ a0. a0 ∈ s ∧ path(g)(a0, a), ∃ a. isroot(g)(a) ∧ haspathanylength(g)(a) |
Used terms: a0
The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.