English
If t.encard < s.encard and MapsTo f s t, then there exist a1, a2 in s with a1 ≠ a2 and f a1 = f a2.
Русский
Если t.encard < s.encard и MapsTo f s t, то существуют a1, a2 в s такие, что a1 ≠ a2 и f a1 = f a2.
LaTeX
$$$\\exists a_1 \\in s, \\exists a_2 \\in s, a_1 \\neq a_2 \\land f a_1 = f a_2$$$
Lean4
/-- A tactic (for use in default params) that applies `Set.toFinite` to synthesize a `Set.Finite`
term. -/
@[tactic_parser 1000]
public meta def tacticToFinite_tac : Lean.ParserDescr✝ :=
ParserDescr.node✝ `Set.tacticToFinite_tac 1024 (ParserDescr.nonReservedSymbol✝ "toFinite_tac" false✝)