[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 26 from proof reduce-unique (previous step)

C[t3] = C0[t1], context(C0), context(C), t3 =>top t0, t1 = K _ v _ v0 ∧ t = v ∧ value(v) ∧ value(v0) ∨ t1 = S _ v1 _ v2 _ v3 ∧ t = v1 _ v3 _ (v2 _ v3) ∧ value(v1) ∧ value(v2) ∧ value(v3) ⊦ C[t0] = C0[t]

User applied rule case distinction

And obtained the following new goals

Proof step 14:
t1 = K _ v _ v0 ∧ t = v ∧ value(v) ∧ value(v0), C[t3] = C0[t1], context(C0), context(C), t3 =>top t0 ⊦ C[t0] = C0[t]
Proof step 25:
t1 = S _ v1 _ v2 _ v3 ∧ t = v1 _ v3 _ (v2 _ v3) ∧ value(v1) ∧ value(v2) ∧ value(v3), C[t3] = C0[t1], context(C0), context(C), t3 =>top t0 ⊦ C[t0] = C0[t]

Rule argument

[CASEDARG : pos: left 5, ()]

Additional information

[[CONCRETESIMPRULES : ()]]