Plain-language statement
For any input as, running M.Pset on as ends in the unique state that is exact the set of states reachable by running M on as.
Exact Lean statement
theorem na_pset_run (as : Stream' A) (k : ℕ) :
M.PSet.DetRun as k = { s : M.State | ∃ ss, M.FinRun k as ss ∧ ss k = s }Formal artifact
Lean source
theorem na_pset_run (as : Stream' A) (k : ℕ) : M.PSet.DetRun as k = { s : M.State | ∃ ss, M.FinRun k as ss ∧ ss k = s } := by induction' k with k h_ind · rw [na_pset_reach_init as, Set.ext_iff] intro s ; constructor · intro h_init use (fun k ↦ s) ; simpa [NA.FinRun] · rintro ⟨ss, ⟨h_init, h_next⟩, h_s⟩ simpa [← h_s] rw [na_pset_reach_next as k, h_ind, Set.ext_iff] intro s ; constructor <;> simp · rintro s' ⟨ss, ⟨h_init, h_next⟩, h_s'⟩ h_s use (fun j ↦ if j < k + 1 then ss j else s) simp ; constructor · simpa intro j h_j rcases (by omega : j < k ∨ j = k) with h_j' | h_j' · simp [h_j, h_j'] ; exact h_next j h_j' · simpa [h_j', h_s'] · rintro ss ⟨h_init, h_next⟩ h_s use (ss k) simp [← h_s, h_next k (by omega)] use ss ; simp ; constructor · exact h_init intro j h_j exact h_next j (by omega)- Project
- Automata Theory
- License
- Apache-2.0
- Commit
- f196548710ce
- Source
- AutomataTheory/Automata/PSet.lean:49-74
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Acc lang congr
acc_lang_congr
Plain-language statement
The language accepted by c.toDA with a unique accepting state s is exactly the equivalence class of s.
Source project: Automata Theory
Person-level attribution pending.
Acc lang concat e
Automata.acc_lang_concat_e
Plain-language statement
The language of the concatenation NA that is accepted by M0's accepting states is the language accepted by M0.
Source project: Automata Theory
Person-level attribution pending.
Acc lang concat ne
Automata.acc_lang_concat_ne
Plain-language statement
The language of the concatenation NA that is accepted by M1's accepting states is the language accepted by M0 concatenated with the language accepted by M1 minus the empty word.
Source project: Automata Theory
Person-level attribution pending.