Theorems · Theorem · dynamical systems
Dynamics.coverMincard_finite_iff
∀ {X : Type u_1} (T : X → X) (F : Set X) (U : SetRel X X) (n : ℕ),
Dynamics.coverMincard T F U n < ⊤ ↔ ∃ s, Dynamics.IsDynCoverOf T F U n ↑s ∧ ↑s.card = Dynamics.coverMincard T F U n- Cited by
- 6 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- Top.topstatement and proof · cited by 9,680
- SetLike.coestatement and proof · cited by 8,199
- ENatstatement and proof · cited by 4,985
- Set.rangeproof · cited by 4,705
- Finset.cardstatement and proof · cited by 2,327
- iInfproof · cited by 1,690
- LT.lt.neproof · cited by 872
- SetRelstatement and proof · cited by 581
- Set.mem_rangeproof · cited by 102
- WithTop.coe_lt_topproof · cited by 44
Cited by6
Results whose statement or proof uses this declaration.
- Dynamics.coverMincard_closure_leproof · cited by 2
- Dynamics.netMaxcard_le_coverMincardproof · cited by 2
- Dynamics.le_coverMincard_imageproof · cited by 2
- Dynamics.coverMincard_image_leproof · cited by 2
- Dynamics.coverMincard_mul_le_powproof · cited by 2
- Dynamics.coverMincard_union_leproof · cited by 1