Source-pinned research

Research proof index

Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.

This index contains 15 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

15 results

Clear filters
Project-declaredLean 4.32.1

Mem induction Scheme sigma1 iff

LO.FirstOrder.Arithmetic.mem_inductionScheme_sigma1_iff

Plain-language statement

RHS of chSigma1_mem_iff reduced to a clean ∃ψ (with the 𝚺₁ side condition).

formal logicmetatheoryproof theory

Source project: Foundation

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.1

Mem induction Scheme univ iff

LO.FirstOrder.Arithmetic.mem_inductionScheme_univ_iff

Plain-language statement

RHS of chUniv_mem_iff reduced to a clean ∃ψ over the syntactic universal closure.

formal logicmetatheoryproof theory

Source project: Foundation

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.1

Quote ball

LO.FirstOrder.Arithmetic.quote_ball

Plain-language statement

The code of the bounded universal ∀¹[#0 < bShift t] φ is qqBall (termBShift ⌜t⌝) ⌜φ⌝.

formal logicmetatheoryproof theory

Source project: Foundation

Person-level attribution pending.

View proof record