Theorems · Theorem · dynamical systems
SymbolicDynamics.FullShift.finite_setOfPred_pattern_support_eq
∀ {A : Type u_3} {G : Type u_4} [Finite A] [inst : Inhabited A] (U : Finset G), {p | p.support = U}.FinitePatterns with support exactly U form a finite set.
- Defined in
- Mathlib.Dynamics.SymbolicDynamics.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Equivproof · cited by 8,337
- Fintypeproof · cited by 7,736
- Set.Elemproof · cited by 7,166
- Set.ofPredstatement and proof · cited by 6,101
- Equiv.symmproof · cited by 3,681
- Finitestatement and proof · cited by 3,029
- Set.Finitestatement · cited by 1,814
- nonempty_fintypeproof · cited by 261
- Set.toFiniteproof · cited by 174
- Subtype.coe_etaproof · cited by 110
- SymbolicDynamics.FullShift.Patternstatement and proof · cited by 21
Cited by1
Results whose statement or proof uses this declaration.
- SymbolicDynamics.FullShift.finite_setOf_pattern_support_eqproof · cited by 0