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



View long theorem info. View the proof. 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,

Proof step 1 from proof imfin-lemma-aux (conclusion) (back to tree)

⊦ ∃ ass0. ∀ as0. as0 ∈ ass0 ↔ (∃ as. as ∈ ass ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

User applied rule structural induction

And obtained the following new goals

Rule argument

term: ass

Additional information

Used simplifier rules: astateset generated by ∅, ++;;

Proof step 2 from proof imfin-lemma-aux (previous step) (back to tree)

⊦ ∃ ass0. ∀ as0. as0 ∈ ass0 ↔ (∃ as. as ∈ ∅ ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ a ∈ ∅; (s)

Proof step 3 from proof imfin-lemma-aux (previous step) (back to tree)

⊦ ∃ ass0. ∀ durqs. ¬ durqs ∈ ass0

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: ∅ abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ ¬ a ∈ ∅; (s) Used terms: ∅

Proof step 4 from proof imfin-lemma-aux (previous step) (back to tree)

∀ pcf, tid, lsf. ∃ ass1. ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ ∃ ass1. ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ++ durqs ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ s ++ b ↔ a = b ∨ a ∈ s; (s)

Proof step 5 from proof imfin-lemma-aux (previous step) (back to tree)

∀ pcf, tid, lsf. ∃ ass1. ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ ∃ ass1. ∀ durqs0. durqs0 ∈ ass1 ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 1 terms: pcf, tid, lsf abort: F discard: T computed: T

Additional information

Used terms: pcf, tid, lsf

Proof step 6 from proof imfin-lemma-aux (previous step) (back to tree)

∃ ass1. ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ ∃ ass1. ∀ durqs0. durqs0 ∈ ass1 ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof imfin-lemma-aux (previous step) (back to tree)

∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ ∃ ass1. ∀ durqs0. durqs0 ∈ ass1 ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ass1 ++ durqs abort: F discard: F computed: F

Additional information

Used terms: ass1 ++ durqs

Proof step 8 from proof imfin-lemma-aux (previous step) (back to tree)

∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ ∀ durqs0. durqs0 ∈ ass1 ++ durqs ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ ass1. ∀ durqs0. durqs0 ∈ ass1 ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ s ++ b ↔ a = b ∨ a ∈ s; (s)

Proof step 9 from proof imfin-lemma-aux (previous step) (back to tree)

∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs0 = durqs ∨ durqs0 ∈ ass1 ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ ass1. ∀ durqs0. durqs0 ∈ ass1 ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 2 terms: ass1 ++ ( (durqs.pcf:= durqs.pcf(tid; resDeq)) .lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) abort: F discard: T computed: F

Additional information

Used terms: ass1 ++ ( (durqs.pcf:= durqs.pcf(tid; resDeq)) .lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty))

Proof step 10 from proof imfin-lemma-aux (previous step) (back to tree)

∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs0 = durqs ∨ durqs0 ∈ ass1 ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∀ durqs0. durqs0 ∈ ass1 ++ ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ s ++ b ↔ a = b ∨ a ∈ s; (s)

Proof step 11 from proof imfin-lemma-aux (previous step) (back to tree)

∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs0 = durqs ∨ durqs0 ∈ ass1 ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), durqs1 = ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [durqs, ags, alsf, apcf]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: durqs, gstate, alsf, apcf

Proof step 12 from proof imfin-lemma-aux (previous step) (back to tree)

durqs = mkstate(ags, alsf, apcf), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = ((durqs.pcf:= apcf(tid; resDeq)).lsf:= alsf(tid; alsf(tid).oval:= Empty)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), durqs0 = durqs ∨ durqs0 ∈ ass1 ↔ (∃ as. (as = durqs ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s)

Proof step 13 from proof imfin-lemma-aux (previous step) (back to tree)

∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs0 = mkstate(ags, alsf, apcf) ∨ durqs0 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 14 from proof imfin-lemma-aux (previous step) (back to tree)

∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), durqs0 = mkstate(ags, alsf, apcf) ∨ durqs0 ∈ ass1 ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Proof step 15 from proof imfin-lemma-aux (previous step) (back to tree)

durqs0 = mkstate(ags, alsf, apcf), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 16 from proof imfin-lemma-aux (previous step) (back to tree)

∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 2 terms: mkstate(ags, alsf, apcf) abort: F discard: F computed: T

Additional information

Used terms: mkstate(ags, alsf, apcf)

Proof step 17 from proof imfin-lemma-aux (previous step) (back to tree)

∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), (mkstate(ags, alsf, apcf) = mkstate(ags, alsf, apcf) ∨ mkstate(ags, alsf, apcf) ∈ ass0) ∧ mkstate(ags, alsf, apcf) = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (mkstate(ags, alsf, apcf).pcf:= mkstate(ags, alsf, apcf).pcf(tid; resDeq)) .lsf:= mkstate(ags, alsf, apcf).lsf(tid; mkstate(ags, alsf, apcf).lsf(tid).oval:= Empty) ;mkstate(ags, alsf, apcf) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s)

Proof step 18 from proof imfin-lemma-aux (previous step) (back to tree)

mkstate(ags, alsf, apcf) ≠ (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq));mkstate(ags, alsf, apcf)), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val0, val, obsEmpty, lsf(tid), optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, lsf(tid), oval, tid0, optval

Proof step 19 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), mkstate(ags, alsf, apcf) ≠ (pcf(tid) = invDeq ∧ obsEmpty ⊃ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq));mkstate(ags, alsf, apcf)), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Proof step 20 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), obsEmpty, pcf(tid) = invDeq, mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 21 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 22 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 23 from proof imfin-lemma-aux (previous step) (back to tree)

durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 24 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 2 terms: mkstate(ags, alsf, apcf)

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) Used terms: mkstate(ags, alsf, apcf)

Proof step 25 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), durqs1 ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset]

Proof step 26 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass1 ≠ 0, ass1 ≠ ∅, mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), durqs1 ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: durqs1 abort: F discard: F computed: T

Additional information

Used terms: durqs1

Proof step 27 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass1 ≠ 0, ass1 ≠ ∅, mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), durqs1 ∈ ass1, durqs1 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset]

Proof step 28 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass1 ≠ 0, # ass0 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), durqs ∈ ass0, ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [durqs, ags0, alsf0, apcf0]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: durqs, gstate, alsf0, apcf0

Proof step 29 from proof imfin-lemma-aux (previous step) (back to tree)

durqs = mkstate(ags0, alsf0, apcf0), lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass1 ≠ 0, # ass0 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ((durqs.pcf:= apcf0(tid; resDeq)).lsf:= alsf0(tid; alsf0(tid).oval:= Empty)) ∈ ass1, durqs ∈ ass0, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ ((durqs.pcf:= apcf0(tid; resDeq)).lsf:= alsf0(tid; alsf0(tid).oval:= Empty)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s)

Proof step 30 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass1 ≠ 0, # ass0 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0, apcf0) ∈ ass0, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 2 terms: mkstate(ags0, alsf0, apcf0)

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) Used terms: mkstate(ags0, alsf0, apcf0)

Proof step 31 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, durqs1 ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ¬ durqs1 ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s)

Proof step 32 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), durqs ∈ ass0, ¬ ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [durqs, ags0, alsf0, apcf0]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: durqs, gstate, alsf0, apcf0

Proof step 33 from proof imfin-lemma-aux (previous step) (back to tree)

durqs = mkstate(ags0, alsf0, apcf0), lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ((durqs.pcf:= apcf0(tid; resDeq)).lsf:= alsf0(tid; alsf0(tid).oval:= Empty)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), durqs ∈ ass0, ¬ ((durqs.pcf:= apcf0(tid; resDeq)).lsf:= alsf0(tid; alsf0(tid).oval:= Empty)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s)

Proof step 34 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags0, alsf0, apcf0) ≠ mkstate(ags, alsf, apcf), mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: mkstate(ags0, alsf0, apcf0(tid; resDeq)) abort: F discard: F computed: T

Additional information

Used terms: mkstate(ags0, alsf0, apcf0(tid; resDeq))

Proof step 35 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags0, alsf0, apcf0) ≠ mkstate(ags, alsf, apcf), mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, mkstate(ags0, alsf0, apcf0(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0, apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 36 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags0, alsf0, apcf0) ≠ mkstate(ags, alsf, apcf), mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, mkstate(ags0, alsf0, apcf0(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0, apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) abort: F discard: F computed: T

Additional information

Used terms: mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq))

Proof step 37 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags0, alsf0, apcf0) ≠ mkstate(ags, alsf, apcf), mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, mkstate(ags0, alsf0, apcf0(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0, apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 38 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags0, alsf0, apcf0) ≠ mkstate(ags, alsf, apcf), mkstate(ags, alsf, apcf) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, mkstate(ags0, alsf0, apcf0(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0, apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf, apcf) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), ∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 2 terms: mkstate(ags0, alsf0, apcf0)

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) Used terms: mkstate(ags0, alsf0, apcf0)

Proof step 39 from proof imfin-lemma-aux (previous step) (back to tree)

durqs0 ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset]

Proof step 40 from proof imfin-lemma-aux (previous step) (back to tree)

# ass1 ≠ 0, ass1 ≠ ∅, durqs0 ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: durqs0 abort: F discard: F computed: T

Additional information

Used terms: durqs0

Proof step 41 from proof imfin-lemma-aux (previous step) (back to tree)

# ass1 ≠ 0, ass1 ≠ ∅, durqs0 ∈ ass1, durqs0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset]

Proof step 42 from proof imfin-lemma-aux (previous step) (back to tree)

# ass1 ≠ 0, # ass0 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, durqs ∈ ass0, (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty);durqs) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty);durqs) = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val0, val, obsEmpty, lsf(tid), optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, lsf(tid), oval, tid0, optval

Proof step 43 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass1 ≠ 0, # ass0 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, (pcf(tid) = invDeq ∧ obsEmpty ⊃ (durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty);durqs) ∈ ass1, durqs ∈ ass0, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ (pcf(tid) = invDeq ∧ obsEmpty ⊃ (durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty);durqs) = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 2 terms: durqs

Additional information

Used terms: durqs

Proof step 44 from proof imfin-lemma-aux (previous step) (back to tree)

durqs0 ≠ mkstate(ags, alsf, apcf), ¬ durqs0 ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as) ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 45 from proof imfin-lemma-aux (previous step) (back to tree)

(pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty);durqs) ≠ mkstate(ags, alsf, apcf), ¬ (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty);durqs) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), durqs = mkstate(ags, alsf, apcf) ∨ durqs ∈ ass0 ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ lsf(tid).obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val0, val, obsEmpty, lsf(tid), optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, lsf(tid), oval, tid0, optval

Proof step 46 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), (pcf(tid) = invDeq ∧ obsEmpty ⊃ (durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty);durqs) ≠ mkstate(ags, alsf, apcf), ¬ (pcf(tid) = invDeq ∧ obsEmpty ⊃ (durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty);durqs) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), durqs = mkstate(ags, alsf, apcf) ∨ durqs ∈ ass0 ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Proof step 47 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), obsEmpty, pcf(tid) = invDeq, ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) ≠ mkstate(ags, alsf, apcf), ¬ (pcf(tid) = invDeq ∧ obsEmpty ⊃ (durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty);durqs) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), durqs = mkstate(ags, alsf, apcf) ∨ durqs ∈ ass0 ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 48 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) ≠ mkstate(ags, alsf, apcf), ¬ ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), durqs = mkstate(ags, alsf, apcf) ∨ durqs ∈ ass0 ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [durqs, ags0, alsf0, apcf0]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: durqs, gstate, alsf0, apcf0

Proof step 49 from proof imfin-lemma-aux (previous step) (back to tree)

durqs = mkstate(ags0, alsf0, apcf0), lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, ((durqs.pcf:= apcf0(tid; resDeq)).lsf:= alsf0(tid; alsf0(tid).oval:= Empty)) ≠ mkstate(ags, alsf, apcf), ¬ ((durqs.pcf:= apcf0(tid; resDeq)).lsf:= alsf0(tid; alsf0(tid).oval:= Empty)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), durqs = mkstate(ags, alsf, apcf) ∨ durqs ∈ ass0 ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s)

Proof step 50 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), mkstate(ags0, alsf0, apcf0) = mkstate(ags, alsf, apcf) ∨ mkstate(ags0, alsf0, apcf0) ∈ ass0 ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 51 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), mkstate(ags0, alsf0, apcf0) = mkstate(ags, alsf, apcf) ∨ mkstate(ags0, alsf0, apcf0) ∈ ass0, durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 6

Additional information

Proof step 52 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), mkstate(ags0, alsf0, apcf0) = mkstate(ags, alsf, apcf), pcf(tid) = invDeq, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws)

Proof step 53 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: mkstate(ags, alsf, apcf(tid; resDeq)) abort: F discard: F computed: T

Additional information

Used terms: mkstate(ags, alsf, apcf(tid; resDeq))

Proof step 54 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags, alsf, apcf(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags, alsf, apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 55 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags, alsf, apcf(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags, alsf, apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 56 from proof imfin-lemma-aux (previous step) (back to tree)

durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags, alsf, apcf(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags, alsf, apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 57 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags, alsf, apcf(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags, alsf, apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: mkstate(ags, alsf, apcf)

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) Used terms: mkstate(ags, alsf, apcf)

Proof step 58 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), durqs1 ∈ ass1, ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags, alsf, apcf(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags, alsf, apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset]

Proof step 59 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass1 ≠ 0, ass1 ≠ ∅, mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), durqs1 ∈ ass1, ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags, alsf, apcf(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags, alsf, apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: durqs1 abort: F discard: F computed: T

Additional information

Used terms: durqs1

Proof step 60 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass1 ≠ 0, ass1 ≠ ∅, mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), durqs1 ∈ ass1, ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags, alsf, apcf(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags, alsf, apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), durqs1 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset]

Proof step 61 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass1 ≠ 0, # ass0 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) ∈ ass1, ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags, alsf, apcf(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags, alsf, apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [durqs, ags0, alsf0, apcf0]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: durqs, gstate, alsf0, apcf0

Proof step 62 from proof imfin-lemma-aux (previous step) (back to tree)

durqs = mkstate(ags0, alsf0, apcf0), lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass1 ≠ 0, # ass0 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), ((durqs.pcf:= apcf0(tid; resDeq)).lsf:= alsf0(tid; alsf0(tid).oval:= Empty)) ∈ ass1, durqs ∈ ass0, ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags, alsf, apcf(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags, alsf, apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ ((durqs.pcf:= apcf0(tid; resDeq)).lsf:= alsf0(tid; alsf0(tid).oval:= Empty)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s)

Proof step 63 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass1 ≠ 0, # ass0 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0, apcf0) ∈ ass0, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags, alsf, apcf(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags, alsf, apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: mkstate(ags0, alsf0, apcf0)

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) Used terms: mkstate(ags0, alsf0, apcf0)

Proof step 64 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset]

Proof step 65 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 66 from proof imfin-lemma-aux (previous step) (back to tree)

durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 67 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: mkstate(ags, alsf, apcf)

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) Used terms: mkstate(ags, alsf, apcf)

Proof step 68 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0, apcf0) ∈ ass0, durqs1 ∈ ass1, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset]

Proof step 69 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, # ass1 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0, apcf0) ∈ ass0, durqs1 ∈ ass1, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: mkstate(ags0, alsf0, apcf0(tid; resDeq)) abort: F discard: F computed: T

Additional information

Used terms: mkstate(ags0, alsf0, apcf0(tid; resDeq))

Proof step 70 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, # ass1 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), durqs1 ∈ ass1, mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, mkstate(ags0, alsf0, apcf0(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0, apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 71 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, # ass1 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0, apcf0) ∈ ass0, durqs1 ∈ ass1, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, mkstate(ags0, alsf0, apcf0(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0, apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 12 terms: mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) abort: F discard: F computed: T

Additional information

Used terms: mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq))

Proof step 72 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, # ass1 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), durqs1 ∈ ass1, mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, mkstate(ags0, alsf0, apcf0(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0, apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 73 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, # ass1 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0, apcf0) ∈ ass0, durqs1 ∈ ass1, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, mkstate(ags0, alsf0, apcf0(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0, apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), ∃ as. as ∈ ass0 ∧ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 2 terms: mkstate(ags0, alsf0, apcf0)

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) Used terms: mkstate(ags0, alsf0, apcf0)

Proof step 74 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, durqs1 ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), ¬ durqs1 ∈ ass1, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty)), mkstate(ags0, alsf0, apcf0) = mkstate(ags, alsf, apcf) ∨ mkstate(ags0, alsf0, apcf0) ∈ ass0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s)

Proof step 75 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ ((durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty)) ∈ ass1, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), mkstate(ags0, alsf0, apcf0) = mkstate(ags, alsf, apcf) ∨ mkstate(ags0, alsf0, apcf0) ∈ ass0 ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [durqs, ags1, alsf1, apcf1]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: durqs, gstate, alsf1, apcf1

Proof step 76 from proof imfin-lemma-aux (previous step) (back to tree)

durqs = mkstate(ags1, alsf1, apcf1), lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ((durqs.pcf:= apcf1(tid; resDeq)).lsf:= alsf1(tid; alsf1(tid).oval:= Empty)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ ((durqs.pcf:= apcf1(tid; resDeq)).lsf:= alsf1(tid; alsf1(tid).oval:= Empty)) ∈ ass1, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), mkstate(ags0, alsf0, apcf0) = mkstate(ags, alsf, apcf) ∨ mkstate(ags0, alsf0, apcf0) ∈ ass0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s)

Proof step 77 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags1, alsf1, apcf1) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), mkstate(ags0, alsf0, apcf0) = mkstate(ags, alsf, apcf) ∨ mkstate(ags0, alsf0, apcf0) ∈ ass0 ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 12

Additional information

Proof step 78 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), mkstate(ags0, alsf0, apcf0) = mkstate(ags, alsf, apcf), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags1, alsf1, apcf1) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws)

Proof step 79 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1, apcf1) ∈ ass0, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: mkstate(ags1, alsf1, apcf1(tid; resDeq)) abort: F discard: F computed: T

Additional information

Used terms: mkstate(ags1, alsf1, apcf1(tid; resDeq))

Proof step 80 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1, apcf1) ∈ ass0, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags1, alsf1, apcf1(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1, apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 81 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1, apcf1) ∈ ass0, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags1, alsf1, apcf1(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1, apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 12 terms: mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) abort: F discard: F computed: T

Additional information

Used terms: mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq))

Proof step 82 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1, apcf1) ∈ ass0, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags1, alsf1, apcf1(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1, apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 83 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1, apcf1) ∈ ass0, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, ¬ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∈ ass1, mkstate(ags1, alsf1, apcf1(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1, apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: mkstate(ags1, alsf1, apcf1)

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) Used terms: mkstate(ags1, alsf1, apcf1)

Proof step 84 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags1, alsf1, apcf1) ∈ ass0, mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 12 terms: mkstate(ags1, alsf1, apcf1(tid; resDeq)) abort: F discard: F computed: T

Additional information

Used terms: mkstate(ags1, alsf1, apcf1(tid; resDeq))

Proof step 85 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0, apcf0) ∈ ass0, mkstate(ags1, alsf1, apcf1) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, mkstate(ags1, alsf1, apcf1(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1, apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 86 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags1, alsf1, apcf1) ∈ ass0, mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, mkstate(ags1, alsf1, apcf1(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1, apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 13 terms: mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) abort: F discard: F computed: T

Additional information

Used terms: mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq))

Proof step 87 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags0, alsf0, apcf0) ∈ ass0, mkstate(ags1, alsf1, apcf1) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, mkstate(ags1, alsf1, apcf1(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1, apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 88 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid) = invDeq, # ass0 ≠ 0, ass0 ≠ ∅, mkstate(ags1, alsf1, apcf1) ≠ mkstate(ags, alsf, apcf), mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), mkstate(ags1, alsf1, apcf1) ∈ ass0, mkstate(ags0, alsf0, apcf0) ∈ ass0, ¬ mkstate(ags0, alsf0(tid; alsf0(tid).oval:= Empty), apcf0(tid; resDeq)) ∈ ass1, ¬ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) ∈ ass1, mkstate(ags1, alsf1, apcf1(tid; resDeq)) ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1, apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))) ⊦ ∃ as. as ∈ ass0 ∧ mkstate(ags1, alsf1(tid; alsf1(tid).oval:= Empty), apcf1(tid; resDeq)) = ((as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty))

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: mkstate(ags1, alsf1, apcf1)

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) Used terms: mkstate(ags1, alsf1, apcf1)

Proof step 89 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), durqs ≠ mkstate(ags, alsf, apcf), ¬ (pcf(tid) = invDeq ∧ obsEmpty ⊃ (durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty);durqs) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), durqs = mkstate(ags, alsf, apcf) ∨ durqs ∈ ass0, pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset]

Proof step 90 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ (pcf(tid) = invDeq ∧ obsEmpty ⊃ (durqs.pcf:= durqs.pcf(tid; resDeq)).lsf:= durqs.lsf(tid; durqs.lsf(tid).oval:= Empty);durqs) ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 6

Additional information

Proof step 91 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: durqs abort: F discard: F computed: T

Additional information

Used terms: durqs

Proof step 92 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ durqs ∈ ass1, durqs ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 93 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ↔ (∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 94 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty, durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ∨ durqs1 ∈ ass1 ⊦ ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 95 from proof imfin-lemma-aux (previous step) (back to tree)

durqs1 = mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 96 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 2 terms: mkstate(ags, alsf, apcf) abort: F discard: F computed: T

Additional information

Used terms: mkstate(ags, alsf, apcf)

Proof step 97 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), (mkstate(ags, alsf, apcf) = mkstate(ags, alsf, apcf) ∨ mkstate(ags, alsf, apcf) ∈ ass0) ∧ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (mkstate(ags, alsf, apcf).pcf:= mkstate(ags, alsf, apcf).pcf(tid; resDeq)) .lsf:= mkstate(ags, alsf, apcf).lsf(tid; mkstate(ags, alsf, apcf).lsf(tid).oval:= Empty) ;mkstate(ags, alsf, apcf) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (mkstate(gstate, lsf, pcf).lsf:= lsf0) = mkstate(gstate, lsf0, pcf); (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ (mkstate(gstate, lsf, pcf).pcf:= pcf0) = mkstate(gstate, lsf, pcf0); (s) ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s)

Proof step 98 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ (pcf(tid) = invDeq ∧ obsEmpty ⊃ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq));mkstate(ags, alsf, apcf)), durqs ∈ ass0, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 99 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 100 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)) = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: durqs abort: F discard: F computed: T

Additional information

Used terms: durqs

Proof step 101 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, durqs1 ∈ ass1, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[DQ-refines-DurQ-instance-astateset-stateset]

Proof step 102 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, # ass1 ≠ 0, ass0 ≠ ∅, ass1 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, durqs1 ∈ ass1, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule exists right

And closed the goal!

Rule argument

pos: right 2 terms: durqs abort: F discard: F computed: T

Additional information

Used terms: durqs

Proof step 103 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs1 ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), durqs ∈ ass0, ¬ durqs1 ∈ ass1, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), ∃ as. (as = mkstate(ags, alsf, apcf) ∨ as ∈ ass0) ∧ durqs1 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 104 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, (pcf(tid) = invDeq ∧ obsEmpty ⊃ (durqs0.pcf:= durqs0.pcf(tid; resDeq)).lsf:= durqs0.lsf(tid; durqs0.lsf(tid).oval:= Empty);durqs0) ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs ∈ ass0, ¬ (pcf(tid) = invDeq ∧ obsEmpty ⊃ (durqs0.pcf:= durqs0.pcf(tid; resDeq)).lsf:= durqs0.lsf(tid; durqs0.lsf(tid).oval:= Empty);durqs0) ∈ ass1, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), pcf(tid) ≠ invDeq ∨ ¬ obsEmpty, durqs0 = mkstate(ags, alsf, apcf) ∨ durqs0 ∈ ass0 ⊦ ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 105 from proof imfin-lemma-aux (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # ass0 ≠ 0, ass0 ≠ ∅, durqs ≠ mkstate(ags, alsf, apcf), durqs0 ≠ mkstate(ags, alsf(tid; alsf(tid).oval:= Empty), apcf(tid; resDeq)), durqs ∈ ass0, ¬ (pcf(tid) = invDeq ∧ obsEmpty ⊃ (durqs0.pcf:= durqs0.pcf(tid; resDeq)).lsf:= durqs0.lsf(tid; durqs0.lsf(tid).oval:= Empty);durqs0) ∈ ass1, ¬ durqs ∈ ass1, ∀ as0. as0 ∈ ass1 ↔ (∃ as. as ∈ ass0 ∧ as0 = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)), durqs0 = mkstate(ags, alsf, apcf) ∨ durqs0 ∈ ass0, pcf(tid) ≠ invDeq ∨ ¬ obsEmpty ⊦ ∃ as. as ∈ ass0 ∧ durqs = (pcf(tid) = invDeq ∧ obsEmpty ⊃ (as.pcf:= as.pcf(tid; resDeq)).lsf:= as.lsf(tid; as.lsf(tid).oval:= Empty);as)

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 11

Additional information

Proof Tree for imfin-lemma-aux (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.

the proof tree