[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 firstN-lastN-in-01
⊦ n < # x ∧ a ∈ x ∧ ¬ a ∈ lastn(n, x) → (¬ a ∈ firstn(# x - n, x) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
firstN-lastN-in
,
Used spec theorems:
Used simplifier rules:
list-data
/
l
nat-basic1
/
f
nat
/
lels-03