[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 le-one-01
⊦ # x + # y ≤ 1 ∧ x ≠ [] → # x = 1 ∧ y = []
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 3
Used lemmas:
sel-add-dottail
,
l
,
size-add
,
disj-nil-add
,
gen-list
,
fr-07
,
lf-01
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
succ
nat
/
le-add
nat-basic
/
z-01
nat-basic
/
a
nat-basic
/
c