[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
,
Theorem lastn-neq-01
⊦ n ≤ # x ∧ a ∈ y ∧ ¬ a ∈ x → x.takeRight(n) ≠ b ' + y
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 8
Used lemmas:
rest-in-01
,
lastn-restn-01
,
lastN-rec
,
lastN-zero
,
Used spec theorems:
Used simplifier rules:
list
/
app-02
list
/
e
list
/
a
list
/
in-17
list
/
in-append
list
/
in-14
list-last
/
lb
list
/
in-rec
list-data
/
l
nat-basic
/
f
list
/
in-15
nat
/
le-ls-simp
nat
/
le-def
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
list
/
Last
nat
/
sub-ls
nat-basic
/
trans-Nat
nat-basic
/
lf
nat
/
elim-pred-c
nat-basic
/
s-04
nat
/
lels
nat-basic
/
oz
nat-basic
/
lf-01
nat
/
elim-sub
nat
/
lep
list
/
len
list
/
len-02
nat-basic
/
eq-01
list
/
inapp-13
nat-basic
/
lf-02
nat-basic
/
l-02
list-last
/
last-elim