[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 4 from proof RED1-lem (previous step)

〈RED1(t2; tn)〉 tn = tn1, 〈RED1(t1; tn)〉 tn = none, 〈TOPRED(t1 _ t2; tn)〉 tn = none, ∀ t0. #(t0) < #(t1 _ t2) → (true → 〈RED1(t0; tn)〉 (tn = none ⊃ irred(t0); t0 => tn .t)), irred(t1), value(t1), ∀ t0. ¬ t1 _ t2 =>top t0, tn1 = none ⊃ irred(t2) ; t2 => tn1 .t, tn1 ≠ none ⊦ 〈tn1 := some(t1 _ tn1 .t)〉 (tn1 = none ⊃ irred(t1 _ t2); t1 _ t2 => tn1 .t)

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ some(t) ≠ none], [CSIMPSEQ : ⊦ some(t) .t = t], [CSIMPSEQ : ⊦ t => t' ∧ value(t1) → (¬ t1 _ t => t1 _ t' ↔ false)])]]