All proofs
Project-declaredLean 4.24.0-rc1 · mathlib@aad26963

Inf occ pair

inf_occ_pair

Plain-language statement

Same as inf_acc_proj, but for pair types. This result does follow from inf_occ_proj, but that proof (see below) turns out to be longer.

Exact Lean statement

theorem inf_occ_pair {X1 X2 : Type*} [Finite X1] [Finite X2] (xs : Stream' (X1 × X2)) :
    fst '' (InfOcc xs) = InfOcc (fst ∘ xs) ∧
    snd '' (InfOcc xs) = InfOcc (snd ∘ xs)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem inf_occ_pair {X1 X2 : Type*} [Finite X1] [Finite X2] (xs : Stream' (X1 × X2)) :    fst '' (InfOcc xs) = InfOcc (fst ∘ xs)     snd '' (InfOcc xs) = InfOcc (snd ∘ xs) := by  constructor  · ext x1 ; simp ; constructor    · rintro x2, h_inf      obtain φ, h_mono, h_x := frequently_iff_strict_mono.mp h_inf      apply frequently_iff_strict_mono.mpr      aesop    · intro h_inf      let s := { x : X1 × X2 | x.1 = x1 }      have h_inf' : ᶠ k in atTop, xs k  s := by exact h_inf      obtain x, h_x, h_inf'' := frequently_in_finite_set.mp h_inf'      aesop  · ext x2 ; simp ; constructor    · rintro x1, h_inf      obtain φ, h_mono, h_x := frequently_iff_strict_mono.mp h_inf      apply frequently_iff_strict_mono.mpr      aesop    · intro h_inf      let s := { x : X1 × X2 | x.2 = x2 }      have h_inf' : ᶠ k in atTop, xs k  s := by exact h_inf      obtain x, h_x, h_inf'' := frequently_in_finite_set.mp h_inf'      aesop
Project
Automata Theory
License
Apache-2.0
Commit
f196548710ce
Source
AutomataTheory/Sequences/InfOcc.lean:102-125

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

Project-declaredLean 4.24.0-rc1

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.

automata theoryformal languagescomputer science

Source project: Automata Theory

Person-level attribution pending.

View proof record
Project-declaredLean 4.24.0-rc1

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.

automata theoryformal languagescomputer science

Source project: Automata Theory

Person-level attribution pending.

View proof record
Project-declaredLean 4.24.0-rc1

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.

automata theoryformal languagescomputer science

Source project: Automata Theory

Person-level attribution pending.

View proof record