Predicates closed under increasing suprema #
Admissible predicates support fixed-point induction and logical relations for
lazy values. Closure is preserved by continuous inverse images, universal
quantification, disjoint sums, and adjoining bottom. Admissible.fix_induction
states fixed-point induction with this hypothesis.
A predicate closed under suprema of increasing sequences.
Equations
- OmegaCompletePartialOrder.Admissible p = ∀ (c : OmegaCompletePartialOrder.Chain α), (∀ (n : ℕ), p (c n)) → p (OmegaCompletePartialOrder.ωSup c)
Instances For
Fixed-point induction for an admissible predicate: it holds at the least fixed point when it holds at bottom and is preserved by the recursive body.
Fixed-point induction for a relation between two least fixed points: it holds of the pair when it holds at bottom and the recursive bodies preserve it in lockstep.
Continuous inverse images of admissible predicates are admissible.
The graph of a continuous map is admissible.
Admissibility is preserved by universal quantification.
Every predicate on an equality-ordered type is admissible.
Disjoint case analysis preserves admissibility.
An admissible predicate on values remains admissible when bottom is accepted in the lifted domain.