Finiteness lemmas for pointwise operations on sets

@[simp]

theorem Set.finite_one {α : Type u_1} [One α] : Set.Finite 1

@[simp]

theorem Set.finite_zero {α : Type u_1} [Zero α] : Set.Finite 0

theorem Set.Finite.mul {α : Type u_1} [Mul α] {s t : Set α} : s.Finite → t.Finite → (s * t).Finite

theorem Set.Finite.add {α : Type u_1} [Add α] {s t : Set α} : s.Finite → t.Finite → (s + t).Finite

@[instance_reducible]

instance Set.fintypeMul {α : Type u_1} [Mul α] [DecidableEq α] (s t : Set α) [Fintype ↑s] [Fintype ↑t] : Fintype ↑(s * t)

Multiplication preserves finiteness.

Equations

• s.fintypeMul t = Set.fintypeImage2 (fun (x1 x2 : α) => x1 * x2) s t

@[instance_reducible]

instance Set.fintypeAdd {α : Type u_1} [Add α] [DecidableEq α] (s t : Set α) [Fintype ↑s] [Fintype ↑t] : Fintype ↑(s + t)

Addition preserves finiteness.

Equations

• s.fintypeAdd t = Set.fintypeImage2 (fun (x1 x2 : α) => x1 + x2) s t

@[instance_reducible]

instance Set.decidableMemMul {α : Type u_1} [Monoid α] {s t : Set α} [Fintype α] [DecidableEq α] [DecidablePred fun (x : α) => x ∈ s] [DecidablePred fun (x : α) => x ∈ t] : DecidablePred fun (x : α) => x ∈ s * t

Equations

• Set.decidableMemMul x✝ = decidable_of_iff (∃ x ∈ s, ∃ y ∈ t, x * y = x✝) ⋯

@[instance_reducible]

instance Set.decidableMemAdd {α : Type u_1} [AddMonoid α] {s t : Set α} [Fintype α] [DecidableEq α] [DecidablePred fun (x : α) => x ∈ s] [DecidablePred fun (x : α) => x ∈ t] : DecidablePred fun (x : α) => x ∈ s + t

Equations

• Set.decidableMemAdd x✝ = decidable_of_iff (∃ x ∈ s, ∃ y ∈ t, x + y = x✝) ⋯

@[instance_reducible]

instance Set.decidableMemPow {α : Type u_1} [Monoid α] {s : Set α} [Fintype α] [DecidableEq α] [DecidablePred fun (x : α) => x ∈ s] (n : ℕ) : DecidablePred fun (x : α) => x ∈ s ^ n

Equations

• Set.decidableMemPow n = Nat.recAux (⋯.mpr inferInstance) (fun (n : ℕ) (ih : DecidablePred fun (x : α) => x ∈ s ^ n) => ⋯.mpr inferInstance) n

@[instance_reducible]

instance Set.decidableMemNSMul {α : Type u_1} [AddMonoid α] {s : Set α} [Fintype α] [DecidableEq α] [DecidablePred fun (x : α) => x ∈ s] (n : ℕ) : DecidablePred fun (x : α) => x ∈ n • s

Equations

• Set.decidableMemNSMul n = Nat.recAux (⋯.mpr inferInstance) (fun (n : ℕ) (ih : DecidablePred fun (x : α) => x ∈ n • s) => ⋯.mpr inferInstance) n

theorem Set.Finite.smul {α : Type u_1} {β : Type u_2} [SMul α β] {s : Set α} {t : Set β} : s.Finite → t.Finite → (s • t).Finite

theorem Set.Finite.vadd {α : Type u_1} {β : Type u_2} [VAdd α β] {s : Set α} {t : Set β} : s.Finite → t.Finite → (s +ᵥ t).Finite

theorem Set.Finite.smul_set {α : Type u_1} {β : Type u_2} [SMul α β] {s : Set β} {a : α} : s.Finite → (a • s).Finite

theorem Set.Finite.vadd_set {α : Type u_1} {β : Type u_2} [VAdd α β] {s : Set β} {a : α} : s.Finite → (a +ᵥ s).Finite

theorem Set.Infinite.of_smul_set {α : Type u_1} {β : Type u_2} [SMul α β] {s : Set β} {a : α} : (a • s).Infinite → s.Infinite

theorem Set.Infinite.of_vadd_set {α : Type u_1} {β : Type u_2} [VAdd α β] {s : Set β} {a : α} : (a +ᵥ s).Infinite → s.Infinite

theorem Set.Finite.sdiv {α : Type u_1} {β : Type u_2} [SDiv α β] {s t : Set β} (hs : s.Finite) (ht : t.Finite) : (s /ₛ t).Finite

theorem Set.Finite.vsub {α : Type u_1} {β : Type u_2} [VSub α β] {s t : Set β} (hs : s.Finite) (ht : t.Finite) : (s -ᵥ t).Finite

theorem Set.finite_mul {α : Type u_1} [Mul α] [IsLeftCancelMul α] [IsRightCancelMul α] {s t : Set α} : (s * t).Finite ↔ s.Finite ∧ t.Finite ∨ s = ∅ ∨ t = ∅

theorem Set.finite_add {α : Type u_1} [Add α] [IsLeftCancelAdd α] [IsRightCancelAdd α] {s t : Set α} : (s + t).Finite ↔ s.Finite ∧ t.Finite ∨ s = ∅ ∨ t = ∅

theorem Set.infinite_mul {α : Type u_1} [Mul α] [IsLeftCancelMul α] [IsRightCancelMul α] {s t : Set α} : (s * t).Infinite ↔ s.Infinite ∧ t.Nonempty ∨ t.Infinite ∧ s.Nonempty

theorem Set.infinite_add {α : Type u_1} [Add α] [IsLeftCancelAdd α] [IsRightCancelAdd α] {s t : Set α} : (s + t).Infinite ↔ s.Infinite ∧ t.Nonempty ∨ t.Infinite ∧ s.Nonempty

@[simp]

theorem Set.finite_inv {α : Type u_1} [InvolutiveInv α] {s : Set α} : s⁻¹.Finite ↔ s.Finite

@[simp]

theorem Set.finite_neg {α : Type u_1} [InvolutiveNeg α] {s : Set α} : (-s).Finite ↔ s.Finite

@[simp]

theorem Set.infinite_inv {α : Type u_1} [InvolutiveInv α] {s : Set α} : s⁻¹.Infinite ↔ s.Infinite

@[simp]

theorem Set.infinite_neg {α : Type u_1} [InvolutiveNeg α] {s : Set α} : (-s).Infinite ↔ s.Infinite

theorem Set.Finite.of_inv {α : Type u_1} [InvolutiveInv α] {s : Set α} : s⁻¹.Finite → s.Finite

Alias of the forward direction of Set.finite_inv.

theorem Set.Finite.inv {α : Type u_1} [InvolutiveInv α] {s : Set α} : s.Finite → s⁻¹.Finite

Alias of the reverse direction of Set.finite_inv.

theorem Set.Finite.neg {α : Type u_1} [InvolutiveNeg α] {s : Set α} : s.Finite → (-s).Finite

Alias of the reverse direction of Set.finite_neg.

theorem Set.Finite.of_neg {α : Type u_1} [InvolutiveNeg α] {s : Set α} : (-s).Finite → s.Finite

Alias of the forward direction of Set.finite_neg.

theorem Set.Finite.div {α : Type u_1} [Div α] {s t : Set α} : s.Finite → t.Finite → (s / t).Finite

theorem Set.Finite.sub {α : Type u_1} [Sub α] {s t : Set α} : s.Finite → t.Finite → (s - t).Finite

@[instance_reducible]

instance Set.fintypeDiv {α : Type u_1} [Div α] [DecidableEq α] (s t : Set α) [Fintype ↑s] [Fintype ↑t] : Fintype ↑(s / t)

Division preserves finiteness.

Equations

• s.fintypeDiv t = Set.fintypeImage2 (fun (x1 x2 : α) => x1 / x2) s t

@[instance_reducible]

instance Set.fintypeSub {α : Type u_1} [Sub α] [DecidableEq α] (s t : Set α) [Fintype ↑s] [Fintype ↑t] : Fintype ↑(s - t)

Subtraction preserves finiteness.

Equations

• s.fintypeSub t = Set.fintypeImage2 (fun (x1 x2 : α) => x1 - x2) s t

theorem Set.finite_div {α : Type u_1} [Group α] {s t : Set α} : (s / t).Finite ↔ s.Finite ∧ t.Finite ∨ s = ∅ ∨ t = ∅

theorem Set.finite_sub {α : Type u_1} [AddGroup α] {s t : Set α} : (s - t).Finite ↔ s.Finite ∧ t.Finite ∨ s = ∅ ∨ t = ∅

theorem Set.infinite_div {α : Type u_1} [Group α] {s t : Set α} : (s / t).Infinite ↔ s.Infinite ∧ t.Nonempty ∨ t.Infinite ∧ s.Nonempty

theorem Set.infinite_sub {α : Type u_1} [AddGroup α] {s t : Set α} : (s - t).Infinite ↔ s.Infinite ∧ t.Nonempty ∨ t.Infinite ∧ s.Nonempty

theorem Group.card_pow_eq_card_pow_card_univ {G : Type u_3} [Group G] [Fintype G] (S : Set G) [(k : ℕ) → DecidablePred fun (x : G) => x ∈ S ^ k] (k : ℕ) : Fintype.card G ≤ k → Fintype.card ↑(S ^ k) = Fintype.card ↑(S ^ Fintype.card G)

theorem AddGroup.card_nsmul_eq_card_nsmul_card_univ {G : Type u_3} [AddGroup G] [Fintype G] (S : Set G) [(k : ℕ) → DecidablePred fun (x : G) => x ∈ k • S] (k : ℕ) : Fintype.card G ≤ k → Fintype.card ↑(k • S) = Fintype.card ↑(Fintype.card G • S)