| ⊦ αs ∈ α × ss ↔ actstream(αs) = α ∧ endstate(αs) ∈ ss |
¬(αs ∈ α × ss ↔ actstream(αs) = α ∧ endstate(αs) ∈ ss) ⊦
| ¬(αs ∈ α × ss ↔ actstream(αs) = α ∧ endstate(αs) ∈ ss) ⊦ |
αs = α0 × s, ¬(αs ∈ α × ss ↔ α0 = α ∧ s ∈ ss) ⊦
Used simplifier rules: ⊦ ασ = actstream(αs) ∧ st = endstate(αs) ↔ αs = ασ × st; (elim) Used terms: αs, ασ, st
| αs = α0 × s, ¬(αs ∈ α × ss ↔ α0 = α ∧ s ∈ ss) ⊦ |
¬(α0 × s ∈ α × ss ↔ α0 = α ∧ s ∈ ss) ⊦
| ¬(α0 × s ∈ α × ss ↔ α0 = α ∧ s ∈ ss) ⊦ |
¬(α0 × s ∈ α × (ss0 ++ s0) ↔ α0 = α ∧ s ∈ ss0 ++ s0), ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦
Used simplifier rules: times-null: ⊦ α × ∅ = ∅; stateset generated by ∅, ++;; ⊦ ¬ a ∈ ∅; (s) ⊦ ¬ a ∈ ∅; (s)
| ¬(α0 × s ∈ α × (ss0 ++ s0) ↔ α0 = α ∧ s ∈ ss0 ++ s0), ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦ |
¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α ∧ (s = s0 ∨ s ∈ ss0)), ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦
Used simplifier rules: times-ins: ⊦ α × (ss ++ s) = (α × ss) ++ (α × s); ⊦ a ∈ s ++ b ↔ a = b ∨ a ∈ s; (s) ⊦ a ∈ s ++ b ↔ a = b ∨ a ∈ s; (s)
| ¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α ∧ (s = s0 ∨ s ∈ ss0)), ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦ |
¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α ∧ (s = s0 ∨ s ∈ ss0)), s ∈ ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦
¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α ∧ (s = s0 ∨ s ∈ ss0)), ¬ s ∈ ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦
Used formulas: s ∈ ss0
| ¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α ∧ (s = s0 ∨ s ∈ ss0)), s ∈ ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦ |
# ss0 ≠ 0, ¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α), ss0 ≠ ∅, s ∈ ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦
Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[stateset]
| # ss0 ≠ 0, ¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α), ss0 ≠ ∅, s ∈ ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦ |
# ss0 ≠ 0, ¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α), ss0 ≠ ∅, s ∈ ss0, α0 × s ∈ α × ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦
# ss0 ≠ 0, ¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α), ss0 ≠ ∅, s ∈ ss0, ¬ α0 × s ∈ α × ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦
Used formulas: α0 × s ∈ α × ss0
| # ss0 ≠ 0, ¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α), ss0 ≠ ∅, s ∈ ss0, α0 × s ∈ α × ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦ |
# ss0 ≠ 0, #(α × ss0) ≠ 0, ss0 ≠ ∅, α × ss0 ≠ ∅, α0 ≠ α, s ∈ ss0, α0 × s ∈ α × ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦
Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[Koenigs-Lemma-gen-behact] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[Koenigs-Lemma-gen-behact]
| # ss0 ≠ 0, #(α × ss0) ≠ 0, ss0 ≠ ∅, α × ss0 ≠ ∅, α0 ≠ α, s ∈ ss0, α0 × s ∈ α × ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦ |
Used terms: α0, s, α
| # ss0 ≠ 0, ¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α), ss0 ≠ ∅, s ∈ ss0, ¬ α0 × s ∈ α × ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦ |
# ss0 ≠ 0, ¬(α0 × s = α × s0 ↔ α0 = α), ss0 ≠ ∅, s ∈ ss0, ¬ α0 × s ∈ α × ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦
| # ss0 ≠ 0, ¬(α0 × s = α × s0 ↔ α0 = α), ss0 ≠ ∅, s ∈ ss0, ¬ α0 × s ∈ α × ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦ |
Used simplifier rules: ⊦ ασ × st = ασ0 × st0 ↔ ασ = ασ0 ∧ st = st0; (ws) Used terms: α, s, α
| ¬(α0 × s = α × s0 ∨ α0 × s ∈ α × ss0 ↔ α0 = α ∧ (s = s0 ∨ s ∈ ss0)), ¬ s ∈ ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦ |
#(α × ss0) ≠ 0, α × ss0 ≠ ∅, α0 × s ≠ α × s0, α0 × s ∈ α × ss0, ¬ s ∈ ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦
Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[Koenigs-Lemma-gen-behact] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[Koenigs-Lemma-gen-behact] ⊦ ασ × st = ασ0 × st0 ↔ ασ = ασ0 ∧ st = st0; (ws)
| #(α × ss0) ≠ 0, α × ss0 ≠ ∅, α0 × s ≠ α × s0, α0 × s ∈ α × ss0, ¬ s ∈ ss0, ∀ α0, s, α. α0 × s ∈ α × ss0 ↔ α0 = α ∧ s ∈ ss0 ⊦ |
Used terms: α0, s, α
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.