Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Proof of `FO(≤, PFP) definability is closed under first-order reductions` (2nd statement)

groundedproofs/Lax134656Proofs/Bridge.lean · lax-134656

What this proof establishes

no assumptions

thm✓Lax134656.PartialFixedPointClosure (2nd statement)

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The library's pullback of a simultaneous induction.