[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 9 from proof perm-all (
previous step
)
∀ a. a ∈ x ∨ a ∈ y → #oc(a, x) = #oc(a, y) ⊦ (∀ a. #oc(a, x) ≤ #oc(a, y)) ∧ (∀ a. #oc(a, y) ≤ #oc(a, x))
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 10
:
∀ a. a ∈ x ∨ a ∈ y → #oc(a, x) = #oc(a, y) ⊦ #oc(a, x) ≤ #oc(a, y) ∧ #oc(a0, y) ≤ #oc(a0, x)
Rule argument
Additional information