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

t => t2, t => t1 ⊦ t1 = t2

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 1:
⊦ t => t' ↔ (∃ C, t0, t1. context(C) ∧ t = C[t0] ∧ t0 =>top t1 ∧ t' = C[t1])
Proof step 31:
t => t2, ∃ C, t0, t2. context(C) ∧ t = C[t0] ∧ t0 =>top t2 ∧ t1 = C[t2] ⊦ t1 = t2

Rule argument

[x0lemmaarg: spec-name: instance-name: lemma-name: reduction-is-topred-in-ctxt antecedent: succedent: t => t' ↔ (∃ C, t0, t1. context(C) ∧ t = C[t0] ∧ t0 =>top t1 ∧ t' = C[t1]) substlist: [t', t] → [t1, t] add preconditions?: F is rewrite lemma?: T current spec?: T rotate lemma?: F replace all?: T paths: ((0, 0, 1)) dummy: () ]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (t1, t)]]