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

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

User applied rule insert lemma

And obtained the following new goals

Proof step 10:
⊦ char1 < char2 ∨ char1 = char2 ∨ char2 < char1
Proof step 11:
char = char0, ∀ str0, char. (∀ str2. str0 = str2 ∨ str0 < str2 ∨ str2 < str0) → char ' + str0 = str ∨ char ' + str0 < str ∨ str < char ' + str0, ∀ str2. str0 = str2 ∨ str0 < str2 ∨ str2 < str0 ⊦ char < char0, char0 < char, char = char0 ∧ str0 < str, char0 = char ∧ str < str0, char = char0 ∧ str0 = str

Rule argument

spec: string-less inst: name: Char-total seq: ⊦ char1 < char2 ∨ char1 = char2 ∨ char2 < char1 subst: [char1, char2] → [char, char0] flags: current, []

Additional information

Used terms: char, char0