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

〈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)), tn0 = none, irred(t1), ∀ t0. ¬ t1 _ t2 =>top t0, ¬ value(t1) ⊦ 〈skip〉 (tn0 = none ⊃ irred(t1 _ t2); t1 _ t2 => tn0 .t)

Heuristic symbolic execution applied rule skip right

And obtained the following new goals

Proof step 21:
〈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)), tn0 = none, irred(t1), ∀ t0. ¬ t1 _ t2 =>top t0, ¬ value(t1), tn0 = none ⊃ ¬ irred(t1 _ t2) ; ¬ t1 _ t2 => tn0 .t ⊦

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ()]]