OrR

A list of lists containing the auxiliary formulas of the rule. The first list constains the auxiliary formulas in the first premise and so on.

A list of lists of SequentIndices denoting the auxiliary formula(s) of the rule. The first list contains the auxiliary formulas in the first premise and so on.

Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see gapt.proofs.DagProof.DagLikeOps for a list.

All definitions introduced by any subproof.

throws java.lang.Exception if inconsistent definitions are used

Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.

Checks whether this instance is equal to that. This universal equality method is defined in AnyRef.

The immediate subproofs of this rule.

Definitions introduced by the bottom-most inference rule.

Is this a proof of the empty clause with empty assertions, and consistent definitions?

The name of this rule (in words).

The list of main formulas of the rule.

A list of SequentIndices denoting the main formula(s) of the rule.

The name of this rule (in symbols).

A list of occurrence connectors, one for each immediate subproof.

The upper sequents of the rule.

An iterator over the names of all the elements of this product.

An iterator over all the elements of this product.

Returns the subproof at the given position: p.subProofAt(Nil) is p itself; p.subProofAt(i :: is) is the ith subproof of p.subProofAt(is).

Set of all (transitive) sub-proofs including this.

Returns a string representation of the object.

The default representation is platform dependent.

Operations that view the sub-proofs as a tree, see gapt.proofs.DagProof.TreeLikeOps for a list.

Assertions of the proof.

Attention: this is interpreted as assertions.toNegConjunction --> conclusion.toDisjunction

These assertions indicate the splitting assumptions this proof depends on.

The conclusion of the rule.

Calculates a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.