[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 41 from proof reduction-is-topred-in-ctxt (previous step)

∀ t'. t0 => t' ↔ (∃ C, t2, t1. context(C) ∧ t0 = C[t2] ∧ t2 =>top t1 ∧ t' = C[t1]), ∀ t'. t1 => t' ↔ (∃ C, t0, t2. context(C) ∧ t1 = C[t0] ∧ t0 =>top t2 ∧ t' = C[t2]), t0 _ t1 = C[K _ v _ v0] ∧ t' = C[v] ∧ value(v) ∧ value(v0) ∧ context(C) ∨ t0 _ t1 = C[S _ v1 _ v2 _ v3] ∧ t' = C[v1 _ v3 _ (v2 _ v3)] ∧ value(v1) ∧ value(v2) ∧ value(v3) ∧ context(C) ⊦ ∃ C, t2, t3. context(C) ∧ t0 _ t1 = C[t2] ∧ t2 =>top t3 ∧ t' = C[t3]

User applied rule constructor cut

And obtained the following new goals

Rule argument

[var-arg: C]

Additional information

[[CONCRETESIMPRULES : ([CSIMPGEN : rawctxt generated by o, _, _;])]]