[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
,
Proof step 11 from proof valid-indices-append (
previous step
)
∀ n. n ∈ nx0 ∨ n ∈ nx1 → n < # ar ⊦ (∀ n. n ∈ nx0 → n < # ar) ∧ (∀ n. n ∈ nx1 → n < # ar)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 12
:
∀ n. n ∈ nx0 ∨ n ∈ nx1 → n < # ar ⊦ (n ∈ nx0 → n < # ar) ∧ (n0 ∈ nx1 → n0 < # ar)
Rule argument
Additional information