[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 661 from proof SII-loops (previous step)

〈if kappa = 0 then abort else let tn = none in { RED1(t4; tn): kappa -1 ; if tn ≠ none then RED(tn .t; t3): kappa -1 else t3 := t4 }〉 t3 = t, ∀ kappa0, t. kappa0 < kappa → (〈RED(S _ (S _ K _ K) _ (S _ K _ K) _ (S _ (S _ K _ K) _ (S _ K _ K)); t0): kappa0 〉 t0 = t → false), t3 = t0 ∧ t4 = S _ (S _ K _ K) _ (S _ K _ K) _ (S _ (S _ K _ K) _ (S _ K _ K)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 660:
〈if kappa = 0 then abort else let tn = none in { RED1(S _ (S _ K _ K) _ (S _ K _ K) _ (S _ (S _ K _ K) _ (S _ K _ K)); tn): kappa - 1 ; if tn ≠ none then RED(tn .t; t3): kappa - 1 else t3 := S _ (S _ K _ K) _ (S _ K _ K) _ (S _ (S _ K _ K) _ (S _ K _ K)) }〉 t3 = t, ∀ kappa0, t. kappa0 < kappa → (〈RED(S _ (S _ K _ K) _ (S _ K _ K) _ (S _ (S _ K _ K) _ (S _ K _ K)); t3): kappa0 〉 t3 = t → false) ⊦

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ n -1 = n - 1])]]