Proof step 1 from proof B-postfix-weak-same-loc-postfix (conclusion) (back to tree)

⊦ bel ⊒w bel0 ∧ bel.forall(λ be. be = SF ∨ be.l = l) → bel ⊒ bel0

System applied rule normalize

And obtained the following new goals

Proof step 2:
bel.forall(λ be. be = SF ∨ be.l = l), bel ⊒w bel0, ¬ bel ⊒ bel0 ⊦

Rule argument

Additional information

Proof step 2 from proof B-postfix-weak-same-loc-postfix (previous step) (back to tree)

bel.forall(λ be. be = SF ∨ be.l = l), bel ⊒w bel0, ¬ bel ⊒ bel0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 3:
bel.forall(λ be. be = SF ∨ be.l = l), ¬ bel ⊒ bel0, ∀ l0. bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0) ⊦

Rule argument

Additional information

Used simplifier rules: B-postfix-weak: ⊦ bel0 ⊒w bel1 ↔ (∀ l. bel0 |SF l ⊒ bel1 |SF l); B-restrict-SF-l: ⊦ bel |SF l = bel.filter(λ be. be = SF ∨ be.l = l);

Proof step 3 from proof B-postfix-weak-same-loc-postfix (previous step) (back to tree)

bel.forall(λ be. be = SF ∨ be.l = l), ¬ bel ⊒ bel0, ∀ l0. bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0) ⊦

User applied rule all left

And obtained the following new goals

Proof step 4:
bel.forall(λ be. be = SF ∨ be.l = l), bel.filter(λ be. be = SF ∨ be.l = l) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l), ¬ bel ⊒ bel0, ∀ l0. bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0) ⊦

Rule argument

pos: left 3 terms: l abort: F discard: F computed: T

Additional information

Used terms: l

Proof step 4 from proof B-postfix-weak-same-loc-postfix (previous step) (back to tree)

bel.forall(λ be. be = SF ∨ be.l = l), bel.filter(λ be. be = SF ∨ be.l = l) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l), ¬ bel ⊒ bel0, ∀ l0. bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 5:
bel.forall(λ be. be = SF ∨ be.l = l), bel ⊒ bel0.filter(λ be. be = SF ∨ be.l = l), ¬ bel ⊒ bel0, ∀ l0. bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ x.forall(p) → x.filter(p) = x; (s)

Proof step 5 from proof B-postfix-weak-same-loc-postfix (previous step) (back to tree)

bel.forall(λ be. be = SF ∨ be.l = l), bel ⊒ bel0.filter(λ be. be = SF ∨ be.l = l), ¬ bel ⊒ bel0, ∀ l0. bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Proof step 6:
⊦ x.forall(p) → x.filter(p) = x
Proof step 7:
bel.forall(λ be. be = SF ∨ be.l = l), bel ⊒ bel0.filter(λ be. be = SF ∨ be.l = l), ¬ bel0.forall(λ be. be = SF ∨ be.l = l), ¬ bel ⊒ bel0, ∀ l0. bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0) ⊦

Rule argument

spec: forall-indexWhere, name:filter-forall, seq: ⊦ x.forall(p) → x.filter(p) = x, subst:[x, p] → [bel0, λ be. be = SF ∨ be.l = l]; ['a] → [Bevent], <all paths>

Additional information

Used terms: bel0, λ be. be = SF ∨ be.l = l

Proof step 6 from proof B-postfix-weak-same-loc-postfix (previous step) (back to tree)

⊦ x.forall(p) → x.filter(p) = x

A spec-lemma

Proof step 7 from proof B-postfix-weak-same-loc-postfix (previous step) (back to tree)

bel.forall(λ be. be = SF ∨ be.l = l), bel ⊒ bel0.filter(λ be. be = SF ∨ be.l = l), ¬ bel0.forall(λ be. be = SF ∨ be.l = l), ¬ bel ⊒ bel0, ∀ l0. bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Proof step 8:
⊦ bel ⊒w bel0 ∧ bel.forall(λ be. be = SF ∨ be.l = l) → bel0.forall(λ be. be = SF ∨ be.l = l)
Proof step 9:
bel.forall(λ be. be = SF ∨ be.l = l), bel ⊒ bel0.filter(λ be. be = SF ∨ be.l = l), ¬ bel0.forall(λ be. be = SF ∨ be.l = l), ¬ bel ⊒ bel0, ∀ l0. bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0) ⊦ bel ⊒w bel0 ∧ bel.forall(λ be. be = SF ∨ be.l = l)

Rule argument

spec: <toplevel>, name:B-postfix-weak-same-loc, seq:⊦ bel ⊒w bel0 ∧ bel.forall(λ be. be = SF ∨ be.l = l) → bel0.forall(λ be. be = SF ∨ be.l = l), subst:[bel, bel0, l] → [bel, bel0, l], <all paths>

Additional information

Used terms: bel, bel0, l

Proof step 8 from proof B-postfix-weak-same-loc-postfix (previous step) (back to tree)

⊦ bel ⊒w bel0 ∧ bel.forall(λ be. be = SF ∨ be.l = l) → bel0.forall(λ be. be = SF ∨ be.l = l)

Lemma B-postfix-weak-same-loc

Proof step 9 from proof B-postfix-weak-same-loc-postfix (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 10:
bel.forall(λ be. be = SF ∨ be.l = l), bel ⊒ bel0.filter(λ be. be = SF ∨ be.l = l), ¬ bel0.forall(λ be. be = SF ∨ be.l = l), ¬ bel ⊒ bel0, ¬ bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0), ∀ l0. bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0) ⊦

Rule argument

Additional information

Used simplifier rules: B-postfix-weak: ⊦ bel0 ⊒w bel1 ↔ (∀ l. bel0 |SF l ⊒ bel1 |SF l); B-restrict-SF-l: ⊦ bel |SF l = bel.filter(λ be. be = SF ∨ be.l = l);

Proof step 10 from proof B-postfix-weak-same-loc-postfix (previous step) (back to tree)

bel.forall(λ be. be = SF ∨ be.l = l), bel ⊒ bel0.filter(λ be. be = SF ∨ be.l = l), ¬ bel0.forall(λ be. be = SF ∨ be.l = l), ¬ bel ⊒ bel0, ¬ bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0), ∀ l0. bel.filter(λ be. be = SF ∨ be.l = l0) ⊒ bel0.filter(λ be. be = SF ∨ be.l = l0) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 6 terms: l0

Additional information

Used terms: l0

Proof Tree for B-postfix-weak-same-loc-postfix (View conclusion)

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.