[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 14 from proof val-trans (previous step)

str0 < str, char0 ' + str < str3, ∀ str3, char, str0. str < str3 ∧ char ' + str0 < str ∧ (∀ str2, str3. str0 < str2 ∧ str2 < str3 → str0 < str3) → char ' + str0 < str3, ∀ str2, str3. str0 < str2 ∧ str2 < str3 → str0 < str3 ⊦ char0 ' + str0 < str3

User applied rule structural induction

And obtained the following new goals

Proof step 15:
∀ str0, str, char0. str0 < str ∧ char0 ' + str < str1 ∧ (∀ str3, char, str0. str < str3 ∧ char ' + str0 < str ∧ (∀ str2, str3. str0 < str2 ∧ str2 < str3 → str0 < str3) → char ' + str0 < str3) ∧ (∀ str2, str3. str0 < str2 ∧ str2 < str3 → str0 < str3) → char0 ' + str0 < str1, str0 < str, char0 ' + str < char + str1, ∀ str3, char, str0. str < str3 ∧ char ' + str0 < str ∧ (∀ str2, str3. str0 < str2 ∧ str2 < str3 → str0 < str3) → char ' + str0 < str3, ∀ str2, str3. str0 < str2 ∧ str2 < str3 → str0 < str3 ⊦ char0 ' + str0 < char + str1

Rule argument

indvar: str3

Additional information

Used simplifier rules: Less-notempty: ⊦ ¬ str < "";%string freely generated by "", +;;