[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 isPropFO-rec
⊦ be.l ≠ l ∧ be ≠ SF → (isPropFO(n + 1, l, be ' + bel) ↔ isPropFO(n, l, bel))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
isPropFO-FOWs-delpos-other
,
isPropFO-FOWs-delpos-tail
,
isPropFO-cons-leading-FO
,
isPropFO-restrict-SF-l-head
,
isPropFO-restrict-delpos
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 12
Used lemmas:
isPropFO-def
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/
a
list-del
/
get-succ
nat-basic
/
l
nat-basic
/
succ
list
/
len-05
list-data
/
l
nat-basic
/
f
nat-basic
/
trans-Nat
nat-basic
/
lf
nat
/
fle-01
nat
/
lels
nat
/
lez
nat-basic
/
zero
list-del
/
get-zero
nat
/
succ-01