[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 4 from proof irrefl (
previous step
)
⊦ ∀ a. (∀ a0. a0 ≪ a → (∀ a. ¬(a0 = a ∧ a ≪ a))) → (∀ a1. ¬(a = a1 ∧ a1 ≪ a1))
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 5
:
a0 ≪ a0, ∀ a1. a1 ≪ a0 → ¬ a1 ≪ a1 ⊦
Rule argument
Additional information