[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 refine-implies-infguess-forward (conclusion) (back to tree)

C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦ ≤F(infguess(CIOAut(cstartf, cstepf)), AIOAut(astartf, astepf))

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ ≤F(infguess(CIOAut(cstartf, cstepf)), AIOAut(astartf, astepf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: infguessAut[Cinfguess-fw-C], name:infguessAut-def, seq:⊦ infguess(CIOAut(startf, stepf)) = EXIOAut (λ σα. cexec(CIOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), subst:[stepf, startf] → [cstepf, cstartf], <all paths>

Additional information

Used terms: cstepf, cstartf

Proof step 3 from proof refine-implies-infguess-forward (previous step) (back to tree)

⊦ infguess(CIOAut(startf, stepf)) = EXIOAut (λ σα. cexec(CIOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))

A spec-lemma

Proof step 4 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ ≤F (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), AIOAut(astartf, astepf)) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: restricted-refine-implies-forward[refine-EXIO-A], name:refine-and-cstepdet-implies-forward, seq:C_≤T_A(EXIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstepdet(EXIOAut(cstartf, cstepf)) ⊦ ≤F(EXIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), subst:[cstartf, cstepf, astartf, astepf] → [λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), astartf, astepf]

Additional information

Used terms: λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), astartf, astepf

Proof step 5 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≤T_A(EXIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstepdet(EXIOAut(cstartf, cstepf)) ⊦ ≤F(EXIOAut(cstartf, cstepf), AIOAut(astartf, astepf))

A spec-lemma

Proof step 6 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ ≤F (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), AIOAut(astartf, astepf)) ⊦ C_≤T_A (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), AIOAut(astartf, astepf)) ∧ cstepdet (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)))

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 2

Additional information

Proof step 7 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ⊦ C_≤T_A (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), AIOAut(astartf, astepf)) ∧ cstepdet (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 8 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ C_≤T_A (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), AIOAut(astartf, astepf)) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: infguess-forwardrefines-orig[Cinfguess-fw-C], name:infguess-has-same-traces, seq: ⊦ C_≡T_A(infguess(CIOAut(startf, stepf)), CIOAut(startf, stepf)), subst:[startf, stepf] → [cstartf, cstepf]

Additional information

Used terms: cstartf, cstepf

Proof step 9 from proof refine-implies-infguess-forward (previous step) (back to tree)

⊦ C_≡T_A(infguess(CIOAut(startf, stepf)), CIOAut(startf, stepf))

A spec-lemma

Proof step 10 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≡T_A(infguess(CIOAut(cstartf, cstepf)), CIOAut(cstartf, cstepf)), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ C_≤T_A (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), AIOAut(astartf, astepf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: infguessAut[Cinfguess-fw-C], name:infguessAut-def, seq:⊦ infguess(CIOAut(startf, stepf)) = EXIOAut (λ σα. cexec(CIOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), subst:[stepf, startf] → [cstepf, cstartf], <all paths>

Additional information

Used terms: cstepf, cstartf

Proof step 11 from proof refine-implies-infguess-forward (previous step) (back to tree)

⊦ infguess(CIOAut(startf, stepf)) = EXIOAut (λ σα. cexec(CIOAut(startf, stepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ stepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))

A spec-lemma

Proof step 12 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≡T_A (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), CIOAut(cstartf, cstepf)), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ C_≤T_A (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), AIOAut(astartf, astepf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOrefine-def[Cinfguess-fw-C-refine-EXIO-IO], name:equiv-both-leq, seq:⊦ C_≡T_A(EXIOAut(cstartf, cstepf), CIOAut(astartf, astepf)) ↔ C_≤T_A(EXIOAut(cstartf, cstepf), CIOAut(astartf, astepf)) ∧ A_≤T_C(CIOAut(astartf, astepf), EXIOAut(cstartf, cstepf)), subst:[astepf, astartf, cstepf, cstartf] → [cstepf, cstartf, λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2)], <all paths>

Additional information

Used terms: cstepf, cstartf, λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2)

Proof step 13 from proof refine-implies-infguess-forward (previous step) (back to tree)

⊦ C_≡T_A(EXIOAut(cstartf, cstepf), CIOAut(astartf, astepf)) ↔ C_≤T_A(EXIOAut(cstartf, cstepf), CIOAut(astartf, astepf)) ∧ A_≤T_C(CIOAut(astartf, astepf), EXIOAut(cstartf, cstepf))

A spec-lemma

Proof step 14 from proof refine-implies-infguess-forward (previous step) (back to tree)

A_≤T_C (CIOAut(cstartf, cstepf), EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), C_≤T_A (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), CIOAut(cstartf, cstepf)), ¬ C_≤T_A (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), AIOAut(astartf, astepf)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (σ × α).1 = σ; (s) ⊦ cexec(CIOAut(startf, stepf))(σ, β) ↔ cfrag(CIOAut(startf, stepf))(σ, β) ∧ startf(σ[0]); (s)

Proof step 15 from proof refine-implies-infguess-forward (previous step) (back to tree)

A_≤T_C (CIOAut(cstartf, cstepf), EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))), C_≤T_A (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), CIOAut(cstartf, cstepf)), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ C_≤T_A (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), AIOAut(astartf, astepf)) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 1

Additional information

Proof step 16 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), C_≤T_A (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), CIOAut(cstartf, cstepf)), ¬ C_≤T_A (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), AIOAut(astartf, astepf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOrefine-def[refine-EXIO-A], name:leq-def, seq:⊦ C_≤T_A(EXIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. extrace(EXIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α)), subst:[astepf, astartf, cstepf, cstartf] → [astepf, astartf, λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0])], <all paths>

Additional information

Used terms: astepf, astartf, λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0])

Proof step 17 from proof refine-implies-infguess-forward (previous step) (back to tree)

⊦ C_≤T_A(EXIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. extrace(EXIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α))

A spec-lemma

Proof step 18 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≤T_A (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), CIOAut(cstartf, cstepf)), C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ∃ α. ¬ ( extrace (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α) → atrace(AIOAut(astartf, astepf))(α)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 19 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), C_≤T_A (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2)), CIOAut(cstartf, cstepf)), extrace (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α), ¬ atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOrefine-def[Cinfguess-fw-C-refine-EXIO-IO], name:leq-def, seq:⊦ C_≤T_A(EXIOAut(cstartf, cstepf), CIOAut(astartf, astepf)) ↔ (∀ α. extrace(EXIOAut(cstartf, cstepf))(α) → ctrace(CIOAut(astartf, astepf))(α)), subst:[astepf, astartf, cstepf, cstartf] → [cstepf, cstartf, λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0])], <all paths>

Additional information

Used terms: cstepf, cstartf, λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0])

Proof step 20 from proof refine-implies-infguess-forward (previous step) (back to tree)

⊦ C_≤T_A(EXIOAut(cstartf, cstepf), CIOAut(astartf, astepf)) ↔ (∀ α. extrace(EXIOAut(cstartf, cstepf))(α) → ctrace(CIOAut(astartf, astepf))(α))

A spec-lemma

Proof step 21 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), extrace (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α), ¬ atrace(AIOAut(astartf, astepf))(α), ∀ α. extrace (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α) → ctrace(CIOAut(cstartf, cstepf))(α) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOrefine-def, name:leq-def, seq:⊦ C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α)), subst:[astepf, astartf, cstepf, cstartf] → [astepf, astartf, cstepf, cstartf], <all paths>

Additional information

Used terms: astepf, astartf, cstepf, cstartf

Proof step 22 from proof refine-implies-infguess-forward (previous step) (back to tree)

⊦ C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ (∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α))

A spec-lemma

Proof step 23 from proof refine-implies-infguess-forward (previous step) (back to tree)

extrace (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α), ¬ atrace(AIOAut(astartf, astepf))(α), ∀ α. extrace (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α) → ctrace(CIOAut(cstartf, cstepf))(α), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: α

Proof step 24 from proof refine-implies-infguess-forward (previous step) (back to tree)

extrace (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α), ¬ atrace(AIOAut(astartf, astepf))(α), extrace (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α) → ctrace(CIOAut(cstartf, cstepf))(α), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 25 from proof refine-implies-infguess-forward (previous step) (back to tree)

ctrace(CIOAut(cstartf, cstepf))(α), extrace (EXIOAut (λ σα. cfrag(CIOAut(cstartf, cstepf))(σα.1, σα.2) ∧ cstartf(σα.1[0]), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ tl(σα.1) ≠ [] ∧ cstepf(hd(σα.1), hd(σα.2), hd(tl(σα.1))) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) (α), ¬ atrace(AIOAut(astartf, astepf))(α), ∀ α. ctrace(CIOAut(cstartf, cstepf))(α) → atrace(AIOAut(astartf, astepf))(α) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: α

Additional information

Used terms: α

Proof step 26 from proof refine-implies-infguess-forward (previous step) (back to tree)

C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), ¬ cstepdet (EXIOAut (λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2), λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2))) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: restricted[refine-EXIO-A-restrictedC], name:stepdeterministic, seq:⊦ cstepdet(EXIOAut(startf, stepf)) ↔ (∀ s, a0, a1, s0, s1. stepf(s, a0, s0) ∧ stepf(s, a1, s1) → a0 = a1 ∧ s0 = s1), subst:[stepf, startf] → [λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2)], <all paths>

Additional information

Used simplifier rules: ⊦ (σ × α).1 = σ; (s) Used terms: λ σα, a, σα0. σα.1 ≠ [] ∧ σα.2 ≠ [] ∧ σα0.1 ≠ [] ∧ cstepf(hd(σα.1), a, hd(σα0.1)) ∧ hd(σα.2) = a ∧ σα0 = tl(σα.1) × tl(σα.2), λ σα. cexec(CIOAut(cstartf, cstepf))(σα.1, σα.2)

Proof step 27 from proof refine-implies-infguess-forward (previous step) (back to tree)

⊦ cstepdet(EXIOAut(startf, stepf)) ↔ (∀ s, a0, a1, s0, s1. stepf(s, a0, s0) ∧ stepf(s, a1, s1) → a0 = a1 ∧ s0 = s1)

A spec-lemma

Proof Tree for refine-implies-infguess-forward (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