[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 21 from proof and-zerosin (previous step)

bits0 = bits0.first ', true ∈ bitsand(false ' + bits2, bits0), ∀ bits1, bits0. # bits1 < #(false + bits2) → true ∈ bitsand(bits1, bits0) → bits1 = [] ∨ bits0 = [] ∨ true ∈ bits1 ⊦ false ' + bits2 = true ', bits0 = false ', bits0 = true ', bits0 = [], bits2 = [], true ∈ bits2

User applied rule insert elim lemma

And closed the goal!

Rule argument

seq: ⊦ bits ≠ [] → ( (boolvar ↔ bits.first) ∧ bits0 = bits.rest ↔ bits = boolvar + bits0) subst: [bits, boolvar, bits0] → [bits0, boolvar, bits] rotate: T spec: list-data inst: bitlista name: elim-1

Additional information

Used simplifier rules: ⊦ boolvar + bits = boolvar ' + bits;% ⊦ boolvar ' = boolvar0 ' + bits ↔ (boolvar ↔ boolvar0) ∧ bits = [];% ⊦ (bits + bits0) + bits1 = bits + bits0 + bits1;% ⊦ boolvar ' + bits ≠ [];%⊦ bits ≠ [] → ( (boolvar ↔ bits.first) ∧ bits0 = bits.rest ↔ bits = boolvar + bits0); (elim) Used terms: bits0, boolvar, bits