[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 ex-first-nontau
α ^ ≠ [] ⊦ ∃ n. ⌜n⌝ < # α ∧ α[n] ≠ τ ∧ (∀ m. m < n → α[m] = τ)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
remtau-cons
,
remtau-split
,
remtau-to-strong
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
remtau-empty-equiv
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat-inf
/
lsle-trans
nat-inf
/
less-fin
nat-basic
/
ls-02