Plain-language statement
The language accepted by the sum NA is the union of the languages accepted by the component automata.
Exact Lean statement
theorem acc_lang_union :
(NA.Sum M).AcceptedLang (NA.Sum_Acc M acc) = ⋃ i : I, (M i).AcceptedLang (acc i)Formal artifact
Lean source
theorem acc_lang_union : (NA.Sum M).AcceptedLang (NA.Sum_Acc M acc) = ⋃ i : I, (M i).AcceptedLang (acc i) := by ext al ; simp [NA.Sum_Acc, NA.AcceptedLang, NA.FinAccept] constructor · rintro ⟨n, as, ⟨ss, h_run, h_acc⟩, h_al⟩ obtain ⟨i, ss_i, h_run_i, h_ss_i⟩ := na_sum_fin_run.mp h_run use i, n, as constructor · use ss_i constructor · assumption obtain ⟨i', si', h_si', h_last⟩ := h_acc simp [h_ss_i] at h_last rw [Sigma.mk.inj_iff] at h_last obtain ⟨rfl, h_si'_eq⟩ := h_last rw [heq_eq_eq] at h_si'_eq simpa [← h_si'_eq] · assumption · rintro ⟨i, n, as, ⟨ss_i, h_run, h_last⟩, h_al⟩ use n, as constructor · use ((Sigma.mk i) ∘ ss_i) constructor · apply na_sum_fin_run.mpr use i, ss_i simp [h_run] · use i, ss_i (Fin.last n) simpa · assumption- Project
- Automata Theory
- License
- Apache-2.0
- Commit
- f196548710ce
- Source
- AutomataTheory/Automata/Sum.lean:123-151
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.