[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 15 from proof challenge3a (previous step)

m2 = m0, # ar = n, ¬ bv0, ar1 = ar, ar[m] = ar[n0], m ≠ n0, m0 < # ar, m < # ar, n0 < # ar, ∀ n0. m0 < n0 ∧ n0 < # ar → ar[n0] ≠ ar[m0], ∀ m1. m1 < m0 → (∀ n. m1 < n ∧ n < # ar → ar[m1] ≠ ar[n]) ⊦ ⦉while n < # ar1 ∧ ¬ bv0 do if ar1[m2] = ar1[n] then m1 := m2, n2 := n, bv0 := true else n := n + 1⦊ ⦉m2 := m2 + 1⦊ ( (bv0 ⊃ (ar[m1] = ar[n2] ∧ m1 ≠ n2 ∧ m1 < # ar ∧ n2 < # ar); (∀ m1. m1 < m2 → (∀ n. m1 < n ∧ n < # ar → ar[m1] ≠ ar[n]))) ∧ m2 ≤ # ar ∧ (∃ m, n. ar1[m] = ar1[n] ∧ m ≠ n ∧ m < # ar1 ∧ n < # ar1) ∧ ¬ m2 ≤ m0)

User applied rule while exit right

And obtained the following new goals

Proof step 14:
m2 = m0, # ar = n, ¬ bv0, ar1 = ar, ar[m] = ar[n0], m ≠ n0, m0 < # ar, m < # ar, n0 < # ar, ∀ n0. m0 < n0 ∧ n0 < # ar → ar[n0] ≠ ar[m0], ∀ m1. m1 < m0 → (∀ n. m1 < n ∧ n < # ar → ar[m1] ≠ ar[n]) ⊦ ⦉m2 := m2 + 1⦊ ( (bv0 ⊃ (ar[m1] = ar[n2] ∧ m1 ≠ n2 ∧ m1 < # ar ∧ n2 < # ar); (∀ m1. m1 < m2 → (∀ n. m1 < n ∧ n < # ar → ar[m1] ≠ ar[n]))) ∧ m2 ≤ # ar ∧ (∃ m, n. ar1[m] = ar1[n] ∧ m ≠ n ∧ m < # ar1 ∧ n < # ar1) ∧ ¬ m2 ≤ m0)

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ ¬ n < n])]]