Theorem: Multiset.le_prod_nonempty_of_submultiplicative_on_pred
File: Mathlib/Algebra/Order/BigOperators/Group/Multiset.lean

tactic: revert s
state_before: ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
s : Multiset α
hs_nonempty : s ≠ ∅
hs : ∀ a ∈ s, p a
⊢ f s.prod ≤ (map f s).prod
state_after: ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
⊢ ∀ (s : Multiset α), s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod

tactic: refine Multiset.induction ?_ ?_
state_before: ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
⊢ ∀ (s : Multiset α), s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
state_after: case refine_1
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
⊢ 0 ≠ ∅ → (∀ a ∈ 0, p a) → f (prod 0) ≤ (map f 0).prod

case refine_2
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
⊢ ∀ (a : α) (s : Multiset α),
    (s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod) →
      a ::ₘ s ≠ ∅ → (∀ a_2 ∈ a ::ₘ s, p a_2) → f (a ::ₘ s).prod ≤ (map f (a ::ₘ s)).prod

tactic: rintro a s hs - hsa_prop
state_before: case refine_2
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
⊢ ∀ (a : α) (s : Multiset α),
    (s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod) →
      a ::ₘ s ≠ ∅ → (∀ a_2 ∈ a ::ₘ s, p a_2) → f (a ::ₘ s).prod ≤ (map f (a ::ₘ s)).prod
state_after: case refine_2
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
⊢ f (a ::ₘ s).prod ≤ (map f (a ::ₘ s)).prod

tactic: rw [prod_cons, map_cons, prod_cons]
state_before: case refine_2
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
⊢ f (a ::ₘ s).prod ≤ (map f (a ::ₘ s)).prod
state_after: case refine_2
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
⊢ f (a * s.prod) ≤ f a * (map f s).prod

tactic: by_cases hs_empty : s = ∅
state_before: case refine_2
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
⊢ f (a * s.prod) ≤ f a * (map f s).prod
state_after: case pos
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
hs_empty : s = ∅
⊢ f (a * s.prod) ≤ f a * (map f s).prod

case neg
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
hs_empty : ¬s = ∅
⊢ f (a * s.prod) ≤ f a * (map f s).prod

tactic: have hsa_restrict : ∀ x, x ∈ s → p x := fun x hx => hsa_prop x (mem_cons_of_mem hx)
state_before: case neg
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
hs_empty : ¬s = ∅
⊢ f (a * s.prod) ≤ f a * (map f s).prod
state_after: case neg
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
hs_empty : ¬s = ∅
hsa_restrict : ∀ x ∈ s, p x
⊢ f (a * s.prod) ≤ f a * (map f s).prod

tactic: have hp_sup : p s.prod := prod_induction_nonempty p hp_mul hs_empty hsa_restrict
state_before: case neg
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
hs_empty : ¬s = ∅
hsa_restrict : ∀ x ∈ s, p x
⊢ f (a * s.prod) ≤ f a * (map f s).prod
state_after: case neg
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
hs_empty : ¬s = ∅
hsa_restrict : ∀ x ∈ s, p x
hp_sup : p s.prod
⊢ f (a * s.prod) ≤ f a * (map f s).prod

tactic: have hp_a : p a := hsa_prop a (mem_cons_self a s)
state_before: case neg
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
hs_empty : ¬s = ∅
hsa_restrict : ∀ x ∈ s, p x
hp_sup : p s.prod
⊢ f (a * s.prod) ≤ f a * (map f s).prod
state_after: case neg
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
hs_empty : ¬s = ∅
hsa_restrict : ∀ x ∈ s, p x
hp_sup : p s.prod
hp_a : p a
⊢ f (a * s.prod) ≤ f a * (map f s).prod

tactic: exact (h_mul a _ hp_a hp_sup).trans (mul_le_mul_left' (hs hs_empty hsa_restrict) _)
state_before: case neg
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
hs_empty : ¬s = ∅
hsa_restrict : ∀ x ∈ s, p x
hp_sup : p s.prod
hp_a : p a
⊢ f (a * s.prod) ≤ f a * (map f s).prod
state_after: no goals

tactic: simp
state_before: case refine_1
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
⊢ 0 ≠ ∅ → (∀ a ∈ 0, p a) → f (prod 0) ≤ (map f 0).prod
state_after: no goals

tactic: simp [hs_empty]
state_before: case pos
ι : Type u_1
α : Type u_2
β : Type u_3
inst✝¹ : CommMonoid α
inst✝ : OrderedCommMonoid β
f : α → β
p : α → Prop
h_mul : ∀ (a b : α), p a → p b → f (a * b) ≤ f a * f b
hp_mul : ∀ (a b : α), p a → p b → p (a * b)
a : α
s : Multiset α
hs : s ≠ ∅ → (∀ a ∈ s, p a) → f s.prod ≤ (map f s).prod
hsa_prop : ∀ a_1 ∈ a ::ₘ s, p a_1
hs_empty : s = ∅
⊢ f (a * s.prod) ≤ f a * (map f s).prod
state_after: no goals