Struct Elimination 

pub struct Elimination {
    pub rederivations: Vec<Rederivation>,
    pub escape_remains: bool,
}

What a target’s closure rests on once its leaves are re-derived.

Fields

rederivations: Vec<Rederivation>

The declarations of the closure that hold re-derived leaves, in export order.

escape_remains: bool

Whether the re-derived closure still mentions Lean.ofReduceBool outside every leaf.

Implementations

impl Elimination

pub fn eliminates(&self) -> bool

Whether the re-derived proof no longer rests on ELIMINATED_AXIOM although Lean’s did.

pub fn lean_after_rederivation( &self, lean: &[String], ) -> Result<Vec<String>, String>

Lean’s #print axioms (Lean names) with the eliminated escape removed: the axioms the re-derived proof must rest on. Lean’s report must name the escape it says was eliminated.

pub fn information_changes(&self) -> Vec<(String, String)>

The information changes a package states, one per declaration holding leaves.

pub fn disclosed_by<'a>( &self, stated: impl IntoIterator<Item = (&'a str, &'a str)>, ) -> Result<(), String>

Whether stated (category, detail pairs) carries exactly this disclosure: every change it must, and no change of the category it must not.

Trait Implementations

impl Clone for Elimination

fn clone(&self) -> Elimination

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Elimination

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Default for Elimination

fn default() -> Elimination

Returns the “default value” for a type.

impl PartialEq for Elimination

fn eq(&self, other: &Elimination) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Elimination

impl StructuralPartialEq for Elimination