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

〈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) ⊦

Heuristic conditional left split applied rule if left

And obtained the following new goals

Proof step 4:
〈abort〉 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), kappa = 0 ⊦
Proof step 659:
〈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), kappa ≠ 0 ⊦

Rule argument

[fmapos-arg: pos: left 1]

Additional information

[[CONCRETESIMPRULES : ()]]