Theorems · Theorem · general topology
Topology.IsInducing.isCountablyCompact_iff
∀ {E : Type u_2} {F : Type u_3} [inst : TopologicalSpace E] [inst_1 : TopologicalSpace F] {A : Set E} {f : E → F},
Topology.IsInducing f → (IsCountablyCompact A ↔ IsCountablyCompact (f '' A))If f : X → Y is an inducing map, the image f '' s of a set s is countably compact if and
only if s is countably compact.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 76 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites17
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
- TopologicalSpacestatement and proof · cited by 24,529
- Filterproof · cited by 8,121
- Set.imagestatement and proof · cited by 5,609
- Filter.NeBotproof · cited by 853
- Filter.mapproof · cited by 819
- Filter.principalproof · cited by 740
- LE.le.trans_eqproof · cited by 328
- Topology.IsInducingstatement and proof · cited by 266
- Filter.IsCountablyGeneratedproof · cited by 220
- ClusterPtproof · cited by 138
- Filter.map_monoproof · cited by 63
Cited by1
Results whose statement or proof uses this declaration.
- Topology.IsEmbedding.isCountablyCompact_iffproof · cited by 1