url
stringclasses
147 values
commit
stringclasses
147 values
file_path
stringlengths
7
101
full_name
stringlengths
1
94
start
stringlengths
6
10
end
stringlengths
6
11
tactic
stringlengths
1
11.2k
state_before
stringlengths
3
2.09M
state_after
stringlengths
6
2.09M
input
stringlengths
73
2.09M
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
have hbn : 0 < (1 - schnirelmannDensity B) := by rw [hbeta] at hbo rw [lt_sub_iff_add_lt, zero_add, lt_iff_le_and_ne] exact ⟨schnirelmannDensity_le_one, hbo⟩
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 ⊒ schnirelmannDensity A * ↑n * (1 - Ξ²) + Ξ² * ↑n ≀ ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n * (1 - Ξ²) + Ξ² * ↑n ≀ ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n
Please generate a tactic in lean4 to solve the state. STATE: case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 ⊒ schnirelmannDensity A * ↑n * (1 - Ξ²) + Ξ² * ↑n ≀ ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
simp only [add_le_add_iff_right, sub_pos, sub_neg]
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n * (1 - Ξ²) + Ξ² * ↑n ≀ ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n * (1 - Ξ²) ≀ ↑(countelements A n) * (1 - Ξ²)
Please generate a tactic in lean4 to solve the state. STATE: case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n * (1 - Ξ²) + Ξ² * ↑n ≀ ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
rw [← le_div_iff (hbn)]
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n * (1 - Ξ²) ≀ ↑(countelements A n) * (1 - Ξ²)
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n) * (1 - Ξ²) / (1 - schnirelmannDensity B)
Please generate a tactic in lean4 to solve the state. STATE: case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n * (1 - Ξ²) ≀ ↑(countelements A n) * (1 - Ξ²) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
rw [mul_div_assoc]
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n) * (1 - Ξ²) / (1 - schnirelmannDensity B)
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n) * ((1 - Ξ²) / (1 - schnirelmannDensity B))
Please generate a tactic in lean4 to solve the state. STATE: case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n) * (1 - Ξ²) / (1 - schnirelmannDensity B) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
have hun : (1 - schnirelmannDensity B) / (1 - schnirelmannDensity B) = 1 := by rw [div_self] positivity
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n) * ((1 - Ξ²) / (1 - schnirelmannDensity B))
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B hun : (1 - schnirelmannDensity B) / (1 - schnirelmannDensity B) = 1 ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n) * ((1 - Ξ²) / (1 - schnirelmannDensity B))
Please generate a tactic in lean4 to solve the state. STATE: case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n) * ((1 - Ξ²) / (1 - schnirelmannDensity B)) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
rw [hun, mul_one]
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B hun : (1 - schnirelmannDensity B) / (1 - schnirelmannDensity B) = 1 ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n) * ((1 - Ξ²) / (1 - schnirelmannDensity B))
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B hun : (1 - schnirelmannDensity B) / (1 - schnirelmannDensity B) = 1 ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n)
Please generate a tactic in lean4 to solve the state. STATE: case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B hun : (1 - schnirelmannDensity B) / (1 - schnirelmannDensity B) = 1 ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n) * ((1 - Ξ²) / (1 - schnirelmannDensity B)) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
exact schnirelmannDensity_mul_le_card_filter
case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B hun : (1 - schnirelmannDensity B) / (1 - schnirelmannDensity B) = 1 ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case neg A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B hun : (1 - schnirelmannDensity B) / (1 - schnirelmannDensity B) = 1 ⊒ schnirelmannDensity A * ↑n ≀ ↑(countelements A n) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
rw [hbeta] at hbo
A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 ⊒ 0 < 1 - schnirelmannDensity B
A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : Β¬schnirelmannDensity B = 1 ⊒ 0 < 1 - schnirelmannDensity B
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 ⊒ 0 < 1 - schnirelmannDensity B TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
rw [lt_sub_iff_add_lt, zero_add, lt_iff_le_and_ne]
A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : Β¬schnirelmannDensity B = 1 ⊒ 0 < 1 - schnirelmannDensity B
A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : Β¬schnirelmannDensity B = 1 ⊒ schnirelmannDensity B ≀ 1 ∧ schnirelmannDensity B β‰  1
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : Β¬schnirelmannDensity B = 1 ⊒ 0 < 1 - schnirelmannDensity B TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
exact ⟨schnirelmannDensity_le_one, hbo⟩
A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : Β¬schnirelmannDensity B = 1 ⊒ schnirelmannDensity B ≀ 1 ∧ schnirelmannDensity B β‰  1
no goals
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : Β¬schnirelmannDensity B = 1 ⊒ schnirelmannDensity B ≀ 1 ∧ schnirelmannDensity B β‰  1 TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
rw [div_self]
A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ (1 - schnirelmannDensity B) / (1 - schnirelmannDensity B) = 1
A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ 1 - schnirelmannDensity B β‰  0
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ (1 - schnirelmannDensity B) / (1 - schnirelmannDensity B) = 1 TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
positivity
A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ 1 - schnirelmannDensity B β‰  0
no goals
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hbo : ¬β = 1 hbn : 0 < 1 - schnirelmannDensity B ⊒ 1 - schnirelmannDensity B β‰  0 TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
le_schnirelmannDensity_add
[115, 1]
[216, 26]
ring_nf
A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hc2 : Ξ± * ↑n * (1 - Ξ²) + Ξ² * ↑n ≀ ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n ⊒ Ξ± * ↑n * (1 - Ξ²) + Ξ² * ↑n = (Ξ± * (1 - Ξ²) + Ξ²) * ↑n
no goals
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n✝ : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B dum : Ξ± * (1 - Ξ²) + Ξ² = Ξ± + Ξ² - Ξ± * Ξ² n : β„• n1 : n > 0 lem : ⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n} βŠ† (A + B) ∩ ↑(Icc 1 n) aux : countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n ≀ countelements (A + B) n claim : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (⋃ a, {c | c ∈ A + B ∧ 0 < c - ↑a ∧ c ≀ next_elm A a n}) n) ht : ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) ≀ ↑(countelements (A + B) n) hc1 : ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n = ↑(countelements A n) + Ξ² * (↑n - ↑(countelements A n)) hc2 : Ξ± * ↑n * (1 - Ξ²) + Ξ² * ↑n ≀ ↑(countelements A n) * (1 - Ξ²) + Ξ² * ↑n ⊒ Ξ± * ↑n * (1 - Ξ²) + Ξ² * ↑n = (Ξ± * (1 - Ξ²) + Ξ²) * ↑n TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
let Ξ± := schnirelmannDensity A
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
have halpha : Ξ± = schnirelmannDensity A := rfl
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
let Ξ² := schnirelmannDensity B
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
have hbeta : Ξ² = schnirelmannDensity B := rfl
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
let Ξ³ := schnirelmannDensity (A + B)
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
have hgamma : Ξ³ = schnirelmannDensity (A + B) := rfl
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
rw [← halpha, ← hbeta, ← hgamma]
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B)
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 - Ξ³ ≀ (1 - Ξ±) * (1 - Ξ²)
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 - schnirelmannDensity (A + B) ≀ (1 - schnirelmannDensity A) * (1 - schnirelmannDensity B) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
linarith
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) h : 1 - Ξ³ ≀ 1 - (Ξ± + Ξ² - Ξ± * Ξ²) ⊒ 1 - Ξ³ ≀ (1 - Ξ±) * (1 - Ξ²)
no goals
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) h : 1 - Ξ³ ≀ 1 - (Ξ± + Ξ² - Ξ± * Ξ²) ⊒ 1 - Ξ³ ≀ (1 - Ξ±) * (1 - Ξ²) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
rw [sub_le_iff_le_add, add_comm_sub]
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 - Ξ³ ≀ 1 - (Ξ± + Ξ² - Ξ± * Ξ²)
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 ≀ 1 + (Ξ³ - (Ξ± + Ξ² - Ξ± * Ξ²))
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 - Ξ³ ≀ 1 - (Ξ± + Ξ² - Ξ± * Ξ²) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
nth_rewrite 1 [← add_zero 1]
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 ≀ 1 + (Ξ³ - (Ξ± + Ξ² - Ξ± * Ξ²))
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 + 0 ≀ 1 + (Ξ³ - (Ξ± + Ξ² - Ξ± * Ξ²))
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 ≀ 1 + (Ξ³ - (Ξ± + Ξ² - Ξ± * Ξ²)) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
rw [add_le_add_iff_left, le_sub_comm, sub_zero]
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 + 0 ≀ 1 + (Ξ³ - (Ξ± + Ξ² - Ξ± * Ξ²))
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ Ξ± + Ξ² - Ξ± * Ξ² ≀ Ξ³
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 1 + 0 ≀ 1 + (Ξ³ - (Ξ± + Ξ² - Ξ± * Ξ²)) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
rw [sub_eq_add_neg]
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ Ξ± + Ξ² - Ξ± * Ξ² ≀ Ξ³
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ Ξ± + Ξ² + -(Ξ± * Ξ²) ≀ Ξ³
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ Ξ± + Ξ² - Ξ± * Ξ² ≀ Ξ³ TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
exact h0
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) h0 : Ξ± + Ξ² - Ξ± * Ξ² ≀ Ξ³ ⊒ Ξ± + Ξ² + -(Ξ± * Ξ²) ≀ Ξ³
no goals
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) h0 : Ξ± + Ξ² - Ξ± * Ξ² ≀ Ξ³ ⊒ Ξ± + Ξ² + -(Ξ± * Ξ²) ≀ Ξ³ TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
rw [halpha, hbeta, hgamma]
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ Ξ± + Ξ² - Ξ± * Ξ² ≀ Ξ³
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ schnirelmannDensity A + schnirelmannDensity B - schnirelmannDensity A * schnirelmannDensity B ≀ schnirelmannDensity (A + B)
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ Ξ± + Ξ² - Ξ± * Ξ² ≀ Ξ³ TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
apply le_schnirelmannDensity_add A B
A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ schnirelmannDensity A + schnirelmannDensity B - schnirelmannDensity A * schnirelmannDensity B ≀ schnirelmannDensity (A + B)
case hA A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 0 ∈ A case hB A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 0 ∈ B
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ schnirelmannDensity A + schnirelmannDensity B - schnirelmannDensity A * schnirelmannDensity B ≀ schnirelmannDensity (A + B) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
exact hA
case hA A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 0 ∈ A
no goals
Please generate a tactic in lean4 to solve the state. STATE: case hA A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 0 ∈ A TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
schnirelmannDensity_for_two
[218, 1]
[239, 11]
exact hB
case hB A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 0 ∈ B
no goals
Please generate a tactic in lean4 to solve the state. STATE: case hB A✝ B✝ : Set β„• n : β„• A B : Set β„• hA : 0 ∈ A hB : 0 ∈ B Ξ± : ℝ := schnirelmannDensity A halpha : Ξ± = schnirelmannDensity A Ξ² : ℝ := schnirelmannDensity B hbeta : Ξ² = schnirelmannDensity B Ξ³ : ℝ := schnirelmannDensity (A + B) hgamma : Ξ³ = schnirelmannDensity (A + B) ⊒ 0 ∈ B TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Combinatorics/Schnirelmann.lean
mannTheorem
[243, 1]
[245, 8]
sorry
A✝ B✝ : Set β„• n : β„• A B : Set β„• ⊒ min 1 (schnirelmannDensity A + schnirelmannDensity B) ≀ schnirelmannDensity (A + B)
no goals
Please generate a tactic in lean4 to solve the state. STATE: A✝ B✝ : Set β„• n : β„• A B : Set β„• ⊒ min 1 (schnirelmannDensity A + schnirelmannDensity B) ≀ schnirelmannDensity (A + B) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.prod_top
[46, 1]
[47, 53]
simp [mem_prod, LatticeHom.coe_fst]
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝² : Lattice Ξ± inst✝¹ : Lattice Ξ² inst✝ : Lattice Ξ³ L✝ M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a✝ : Ξ± L : Sublattice Ξ± a : Ξ± Γ— Ξ² ⊒ a ∈ L.prod ⊀ ↔ a ∈ comap (LatticeHom.fst Ξ± Ξ²) L
no goals
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝² : Lattice Ξ± inst✝¹ : Lattice Ξ² inst✝ : Lattice Ξ³ L✝ M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a✝ : Ξ± L : Sublattice Ξ± a : Ξ± Γ— Ξ² ⊒ a ∈ L.prod ⊀ ↔ a ∈ comap (LatticeHom.fst Ξ± Ξ²) L TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.top_prod
[49, 1]
[50, 53]
simp [mem_prod, LatticeHom.coe_snd]
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝² : Lattice Ξ± inst✝¹ : Lattice Ξ² inst✝ : Lattice Ξ³ L✝ M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a✝ : Ξ± L : Sublattice Ξ² a : Ξ± Γ— Ξ² ⊒ a ∈ ⊀.prod L ↔ a ∈ comap (LatticeHom.snd Ξ± Ξ²) L
no goals
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝² : Lattice Ξ± inst✝¹ : Lattice Ξ² inst✝ : Lattice Ξ³ L✝ M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a✝ : Ξ± L : Sublattice Ξ² a : Ξ± Γ— Ξ² ⊒ a ∈ ⊀.prod L ↔ a ∈ comap (LatticeHom.snd Ξ± Ξ²) L TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.le_prod_iff
[61, 1]
[63, 36]
simp [SetLike.le_def, forall_and]
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝² : Lattice Ξ± inst✝¹ : Lattice Ξ² inst✝ : Lattice Ξ³ L M✝ : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a : Ξ± M : Sublattice Ξ² N : Sublattice (Ξ± Γ— Ξ²) ⊒ N ≀ L.prod M ↔ N ≀ comap (LatticeHom.fst Ξ± Ξ²) L ∧ N ≀ comap (LatticeHom.snd Ξ± Ξ²) M
no goals
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝² : Lattice Ξ± inst✝¹ : Lattice Ξ² inst✝ : Lattice Ξ³ L M✝ : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a : Ξ± M : Sublattice Ξ² N : Sublattice (Ξ± Γ— Ξ²) ⊒ N ≀ L.prod M ↔ N ≀ comap (LatticeHom.fst Ξ± Ξ²) L ∧ N ≀ comap (LatticeHom.snd Ξ± Ξ²) M TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.prod_eq_bot
[65, 1]
[66, 53]
simpa only [← coe_inj] using Set.prod_eq_empty_iff
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝² : Lattice Ξ± inst✝¹ : Lattice Ξ² inst✝ : Lattice Ξ³ L M✝ : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a : Ξ± M : Sublattice Ξ² ⊒ L.prod M = βŠ₯ ↔ L = βŠ₯ ∨ M = βŠ₯
no goals
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝² : Lattice Ξ± inst✝¹ : Lattice Ξ² inst✝ : Lattice Ξ³ L M✝ : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a : Ξ± M : Sublattice Ξ² ⊒ L.prod M = βŠ₯ ↔ L = βŠ₯ ∨ M = βŠ₯ TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.prod_eq_top
[68, 1]
[69, 85]
simpa only [← coe_inj] using Set.prod_eq_univ
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝⁴ : Lattice Ξ± inst✝³ : Lattice Ξ² inst✝² : Lattice Ξ³ L M✝ : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a : Ξ± inst✝¹ : Nonempty Ξ± inst✝ : Nonempty Ξ² M : Sublattice Ξ² ⊒ L.prod M = ⊀ ↔ L = ⊀ ∧ M = ⊀
no goals
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝⁴ : Lattice Ξ± inst✝³ : Lattice Ξ² inst✝² : Lattice Ξ³ L M✝ : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a : Ξ± inst✝¹ : Nonempty Ξ± inst✝ : Nonempty Ξ² M : Sublattice Ξ² ⊒ L.prod M = ⊀ ↔ L = ⊀ ∧ M = ⊀ TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.pi_empty
[93, 1]
[93, 96]
simp [mem_pi]
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a✝ : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) L : (i : ΞΊ) β†’ Sublattice (Ο€ i) a : (i : ΞΊ) β†’ Ο€ i ⊒ a ∈ pi βˆ… L ↔ a ∈ ⊀
no goals
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a✝ : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) L : (i : ΞΊ) β†’ Sublattice (Ο€ i) a : (i : ΞΊ) β†’ Ο€ i ⊒ a ∈ pi βˆ… L ↔ a ∈ ⊀ TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.pi_top
[95, 1]
[96, 31]
simp [mem_pi]
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s✝ t : Set Ξ± a✝ : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) s : Set ΞΊ a : (i : ΞΊ) β†’ Ο€ i ⊒ (a ∈ pi s fun i => ⊀) ↔ a ∈ ⊀
no goals
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s✝ t : Set Ξ± a✝ : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) s : Set ΞΊ a : (i : ΞΊ) β†’ Ο€ i ⊒ (a ∈ pi s fun i => ⊀) ↔ a ∈ ⊀ TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.pi_bot
[98, 1]
[99, 31]
simp [mem_pi]
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝⁴ : Lattice Ξ± inst✝³ : Lattice Ξ² inst✝² : Lattice Ξ³ L M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a✝ : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝¹ : (i : ΞΊ) β†’ Lattice (Ο€ i) inst✝ : Nonempty ΞΊ a : (i : ΞΊ) β†’ Ο€ i ⊒ (a ∈ pi univ fun i => βŠ₯) ↔ a ∈ βŠ₯
no goals
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝⁴ : Lattice Ξ± inst✝³ : Lattice Ξ² inst✝² : Lattice Ξ³ L M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a✝ : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝¹ : (i : ΞΊ) β†’ Lattice (Ο€ i) inst✝ : Nonempty ΞΊ a : (i : ΞΊ) β†’ Ο€ i ⊒ (a ∈ pi univ fun i => βŠ₯) ↔ a ∈ βŠ₯ TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.le_pi
[101, 1]
[102, 101]
simp [SetLike.le_def]
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M✝ : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s✝ t : Set Ξ± a : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) s : Set ΞΊ L : (i : ΞΊ) β†’ Sublattice (Ο€ i) M : Sublattice ((i : ΞΊ) β†’ Ο€ i) ⊒ M ≀ pi s L ↔ βˆ€ i ∈ s, M ≀ comap (Pi.evalLatticeHom Ο€ i) (L i)
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M✝ : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s✝ t : Set Ξ± a : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) s : Set ΞΊ L : (i : ΞΊ) β†’ Sublattice (Ο€ i) M : Sublattice ((i : ΞΊ) β†’ Ο€ i) ⊒ (βˆ€ ⦃x : (i : ΞΊ) β†’ Ο€ i⦄, x ∈ M β†’ βˆ€ i ∈ s, x i ∈ L i) ↔ βˆ€ i ∈ s, βˆ€ ⦃x : (i : ΞΊ) β†’ Ο€ i⦄, x ∈ M β†’ x i ∈ L i
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M✝ : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s✝ t : Set Ξ± a : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) s : Set ΞΊ L : (i : ΞΊ) β†’ Sublattice (Ο€ i) M : Sublattice ((i : ΞΊ) β†’ Ο€ i) ⊒ M ≀ pi s L ↔ βˆ€ i ∈ s, M ≀ comap (Pi.evalLatticeHom Ο€ i) (L i) TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.le_pi
[101, 1]
[102, 101]
aesop
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M✝ : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s✝ t : Set Ξ± a : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) s : Set ΞΊ L : (i : ΞΊ) β†’ Sublattice (Ο€ i) M : Sublattice ((i : ΞΊ) β†’ Ο€ i) ⊒ (βˆ€ ⦃x : (i : ΞΊ) β†’ Ο€ i⦄, x ∈ M β†’ βˆ€ i ∈ s, x i ∈ L i) ↔ βˆ€ i ∈ s, βˆ€ ⦃x : (i : ΞΊ) β†’ Ο€ i⦄, x ∈ M β†’ x i ∈ L i
no goals
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M✝ : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s✝ t : Set Ξ± a : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) s : Set ΞΊ L : (i : ΞΊ) β†’ Sublattice (Ο€ i) M : Sublattice ((i : ΞΊ) β†’ Ο€ i) ⊒ (βˆ€ ⦃x : (i : ΞΊ) β†’ Ο€ i⦄, x ∈ M β†’ βˆ€ i ∈ s, x i ∈ L i) ↔ βˆ€ i ∈ s, βˆ€ ⦃x : (i : ΞΊ) β†’ Ο€ i⦄, x ∈ M β†’ x i ∈ L i TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.pi_univ_eq_bot
[104, 1]
[105, 28]
simp_rw [← coe_inj]
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) L : (i : ΞΊ) β†’ Sublattice (Ο€ i) ⊒ pi univ L = βŠ₯ ↔ βˆƒ i, L i = βŠ₯
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) L : (i : ΞΊ) β†’ Sublattice (Ο€ i) ⊒ ↑(pi univ L) = ↑βŠ₯ ↔ βˆƒ i, ↑(L i) = ↑βŠ₯
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) L : (i : ΞΊ) β†’ Sublattice (Ο€ i) ⊒ pi univ L = βŠ₯ ↔ βˆƒ i, L i = βŠ₯ TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/Mathlib/Order/Sublattice.lean
Sublattice.pi_univ_eq_bot
[104, 1]
[105, 28]
simp
ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) L : (i : ΞΊ) β†’ Sublattice (Ο€ i) ⊒ ↑(pi univ L) = ↑βŠ₯ ↔ βˆƒ i, ↑(L i) = ↑βŠ₯
no goals
Please generate a tactic in lean4 to solve the state. STATE: ΞΉ : Sort u_1 Ξ± : Type u_2 Ξ² : Type u_3 Ξ³ : Type u_4 inst✝³ : Lattice Ξ± inst✝² : Lattice Ξ² inst✝¹ : Lattice Ξ³ L✝ M : Sublattice Ξ± f : LatticeHom Ξ± Ξ² s t : Set Ξ± a : Ξ± ΞΊ : Type u_5 Ο€ : ΞΊ β†’ Type u_6 inst✝ : (i : ΞΊ) β†’ Lattice (Ο€ i) L : (i : ΞΊ) β†’ Sublattice (Ο€ i) ⊒ ↑(pi univ L) = ↑βŠ₯ ↔ βˆƒ i, ↑(L i) = ↑βŠ₯ TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
mem_combiFrontier_iff
[36, 1]
[37, 97]
simp [combiFrontier]
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ x ∈ combiFrontier π•œ s ↔ βˆƒ t βŠ‚ s, x ∈ (convexHull π•œ) ↑t
no goals
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ x ∈ combiFrontier π•œ s ↔ βˆƒ t βŠ‚ s, x ∈ (convexHull π•œ) ↑t TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_empty
[44, 1]
[47, 42]
apply Set.eq_empty_of_subset_empty
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiFrontier π•œ βˆ… = βˆ…
case a π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiFrontier π•œ βˆ… βŠ† βˆ…
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiFrontier π•œ βˆ… = βˆ… TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_empty
[44, 1]
[47, 42]
convert combiFrontier_subset_convexHull
case a π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiFrontier π•œ βˆ… βŠ† βˆ…
case h.e'_4 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ βˆ… = (convexHull π•œ) β†‘βˆ…
Please generate a tactic in lean4 to solve the state. STATE: case a π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiFrontier π•œ βˆ… βŠ† βˆ… TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_empty
[44, 1]
[47, 42]
rw [Finset.coe_empty, convexHull_empty]
case h.e'_4 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ βˆ… = (convexHull π•œ) β†‘βˆ…
no goals
Please generate a tactic in lean4 to solve the state. STATE: case h.e'_4 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ βˆ… = (convexHull π•œ) β†‘βˆ… TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiInterior_empty
[49, 1]
[52, 42]
apply Set.eq_empty_of_subset_empty
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiInterior π•œ βˆ… = βˆ…
case a π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiInterior π•œ βˆ… βŠ† βˆ…
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiInterior π•œ βˆ… = βˆ… TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiInterior_empty
[49, 1]
[52, 42]
convert combiInterior_subset_convexHull
case a π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiInterior π•œ βˆ… βŠ† βˆ…
case h.e'_4 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ βˆ… = (convexHull π•œ) β†‘βˆ…
Please generate a tactic in lean4 to solve the state. STATE: case a π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiInterior π•œ βˆ… βŠ† βˆ… TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiInterior_empty
[49, 1]
[52, 42]
rw [Finset.coe_empty, convexHull_empty]
case h.e'_4 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ βˆ… = (convexHull π•œ) β†‘βˆ…
no goals
Please generate a tactic in lean4 to solve the state. STATE: case h.e'_4 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ βˆ… = (convexHull π•œ) β†‘βˆ… TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_singleton
[54, 1]
[59, 14]
refine eq_empty_of_subset_empty fun y hy ↦ ?_
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiFrontier π•œ {x} = βˆ…
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x y : E hy : y ∈ combiFrontier π•œ {x} ⊒ y ∈ βˆ…
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiFrontier π•œ {x} = βˆ… TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_singleton
[54, 1]
[59, 14]
rw [mem_combiFrontier_iff] at hy
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x y : E hy : y ∈ combiFrontier π•œ {x} ⊒ y ∈ βˆ…
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x y : E hy : βˆƒ t βŠ‚ {x}, y ∈ (convexHull π•œ) ↑t ⊒ y ∈ βˆ…
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x y : E hy : y ∈ combiFrontier π•œ {x} ⊒ y ∈ βˆ… TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_singleton
[54, 1]
[59, 14]
obtain ⟨s, hs, hys⟩ := hy
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x y : E hy : βˆƒ t βŠ‚ {x}, y ∈ (convexHull π•œ) ↑t ⊒ y ∈ βˆ…
case intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x y : E s : Finset E hs : s βŠ‚ {x} hys : y ∈ (convexHull π•œ) ↑s ⊒ y ∈ βˆ…
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x y : E hy : βˆƒ t βŠ‚ {x}, y ∈ (convexHull π•œ) ↑t ⊒ y ∈ βˆ… TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_singleton
[54, 1]
[59, 14]
rw [Finset.eq_empty_of_ssubset_singleton hs] at hys
case intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x y : E s : Finset E hs : s βŠ‚ {x} hys : y ∈ (convexHull π•œ) ↑s ⊒ y ∈ βˆ…
case intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x y : E s : Finset E hs : s βŠ‚ {x} hys : y ∈ (convexHull π•œ) β†‘βˆ… ⊒ y ∈ βˆ…
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x y : E s : Finset E hs : s βŠ‚ {x} hys : y ∈ (convexHull π•œ) ↑s ⊒ y ∈ βˆ… TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_singleton
[54, 1]
[59, 14]
simp at hys
case intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x y : E s : Finset E hs : s βŠ‚ {x} hys : y ∈ (convexHull π•œ) β†‘βˆ… ⊒ y ∈ βˆ…
no goals
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x y : E s : Finset E hs : s βŠ‚ {x} hys : y ∈ (convexHull π•œ) β†‘βˆ… ⊒ y ∈ βˆ… TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiInterior_singleton
[61, 1]
[64, 7]
unfold combiInterior
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiInterior π•œ {x} = {x}
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ (convexHull π•œ) ↑{x} \ combiFrontier π•œ {x} = {x}
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiInterior π•œ {x} = {x} TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiInterior_singleton
[61, 1]
[64, 7]
rw [combiFrontier_singleton]
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ (convexHull π•œ) ↑{x} \ combiFrontier π•œ {x} = {x}
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ (convexHull π•œ) ↑{x} \ βˆ… = {x}
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ (convexHull π•œ) ↑{x} \ combiFrontier π•œ {x} = {x} TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiInterior_singleton
[61, 1]
[64, 7]
simp
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ (convexHull π•œ) ↑{x} \ βˆ… = {x}
no goals
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ (convexHull π•œ) ↑{x} \ βˆ… = {x} TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
apply Subset.antisymm _ _
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ (convexHull π•œ) ↑s = ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ (convexHull π•œ) ↑s βŠ† ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t βŠ† (convexHull π•œ) ↑s
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ (convexHull π•œ) ↑s = ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
refine s.strongInductionOn ?_
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ (convexHull π•œ) ↑s βŠ† ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ βˆ€ (s : Finset E), (βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1) β†’ (convexHull π•œ) ↑s βŠ† ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ (convexHull π•œ) ↑s βŠ† ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
rintro s ih x hx
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ βˆ€ (s : Finset E), (βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1) β†’ (convexHull π•œ) ↑s βŠ† ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ βˆ€ (s : Finset E), (βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1) β†’ (convexHull π•œ) ↑s βŠ† ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
by_cases h : x ∈ combiFrontier π•œ s
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
case pos π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s h : x ∈ combiFrontier π•œ s ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t case neg π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s h : x βˆ‰ combiFrontier π•œ s ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
rw [mem_combiFrontier_iff] at h
case pos π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s h : x ∈ combiFrontier π•œ s ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
case pos π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s h : βˆƒ t βŠ‚ s, x ∈ (convexHull π•œ) ↑t ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
Please generate a tactic in lean4 to solve the state. STATE: case pos π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s h : x ∈ combiFrontier π•œ s ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
obtain ⟨t, st, ht⟩ := h
case pos π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s h : βˆƒ t βŠ‚ s, x ∈ (convexHull π•œ) ↑t ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
case pos.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
Please generate a tactic in lean4 to solve the state. STATE: case pos π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s h : βˆƒ t βŠ‚ s, x ∈ (convexHull π•œ) ↑t ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
specialize ih _ st ht
case pos.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
case pos.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t ih : x ∈ ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
Please generate a tactic in lean4 to solve the state. STATE: case pos.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
simp only [exists_prop, Set.mem_iUnion] at ih ⊒
case pos.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t ih : x ∈ ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
case pos.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t ih : βˆƒ i βŠ† t, x ∈ combiInterior π•œ i ⊒ βˆƒ i βŠ† s, x ∈ combiInterior π•œ i
Please generate a tactic in lean4 to solve the state. STATE: case pos.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t ih : x ∈ ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
obtain ⟨Z, Zt, hZ⟩ := ih
case pos.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t ih : βˆƒ i βŠ† t, x ∈ combiInterior π•œ i ⊒ βˆƒ i βŠ† s, x ∈ combiInterior π•œ i
case pos.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t Z : Finset E Zt : Z βŠ† t hZ : x ∈ combiInterior π•œ Z ⊒ βˆƒ i βŠ† s, x ∈ combiInterior π•œ i
Please generate a tactic in lean4 to solve the state. STATE: case pos.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t ih : βˆƒ i βŠ† t, x ∈ combiInterior π•œ i ⊒ βˆƒ i βŠ† s, x ∈ combiInterior π•œ i TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
exact ⟨_, Zt.trans st.1, hZ⟩
case pos.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t Z : Finset E Zt : Z βŠ† t hZ : x ∈ combiInterior π•œ Z ⊒ βˆƒ i βŠ† s, x ∈ combiInterior π•œ i
no goals
Please generate a tactic in lean4 to solve the state. STATE: case pos.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t✝ : Finset E x✝ : E s : Finset E x : E hx : x ∈ (convexHull π•œ) ↑s t : Finset E st : t βŠ‚ s ht : x ∈ (convexHull π•œ) ↑t Z : Finset E Zt : Z βŠ† t hZ : x ∈ combiInterior π•œ Z ⊒ βˆƒ i βŠ† s, x ∈ combiInterior π•œ i TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
exact subset_iUnionβ‚‚ s Subset.rfl ⟨hx, h⟩
case neg π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s h : x βˆ‰ combiFrontier π•œ s ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t
no goals
Please generate a tactic in lean4 to solve the state. STATE: case neg π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s✝ t : Finset E x✝ : E s : Finset E ih : βˆ€ t βŠ‚ s, (convexHull π•œ) ↑t βŠ† ⋃ t_1, ⋃ (_ : t_1 βŠ† t), combiInterior π•œ t_1 x : E hx : x ∈ (convexHull π•œ) ↑s h : x βˆ‰ combiFrontier π•œ s ⊒ x ∈ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
simplex_combiInteriors_cover
[70, 1]
[82, 75]
exact iUnionβ‚‚_subset fun t ht ↦ diff_subset.trans $ convexHull_mono ht
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t βŠ† (convexHull π•œ) ↑s
no goals
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : OrderedRing π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ ⋃ t, ⋃ (_ : t βŠ† s), combiInterior π•œ t βŠ† (convexHull π•œ) ↑s TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
ext x
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiFrontier π•œ s = {x | βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x}
case h π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ x ∈ combiFrontier π•œ s ↔ x ∈ {x | βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x}
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x : E ⊒ combiFrontier π•œ s = {x | βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x} TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
simp_rw [combiFrontier, Set.mem_iUnion, Set.mem_setOf_eq]
case h π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ x ∈ combiFrontier π•œ s ↔ x ∈ {x | βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x}
case h π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ (βˆƒ i, βˆƒ (_ : i βŠ‚ s), x ∈ (convexHull π•œ) ↑i) ↔ βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x
Please generate a tactic in lean4 to solve the state. STATE: case h π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ x ∈ combiFrontier π•œ s ↔ x ∈ {x | βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x} TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
constructor
case h π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ (βˆƒ i, βˆƒ (_ : i βŠ‚ s), x ∈ (convexHull π•œ) ↑i) ↔ βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x
case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ (βˆƒ i, βˆƒ (_ : i βŠ‚ s), x ∈ (convexHull π•œ) ↑i) β†’ βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x case h.mpr π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ (βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x) β†’ βˆƒ i, βˆƒ (_ : i βŠ‚ s), x ∈ (convexHull π•œ) ↑i
Please generate a tactic in lean4 to solve the state. STATE: case h π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ (βˆƒ i, βˆƒ (_ : i βŠ‚ s), x ∈ (convexHull π•œ) ↑i) ↔ βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
simp only [and_imp, exists_prop, exists_imp]
case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ (βˆƒ i, βˆƒ (_ : i βŠ‚ s), x ∈ (convexHull π•œ) ↑i) β†’ βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x
case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ βˆ€ x_1 βŠ‚ s, x ∈ (convexHull π•œ) ↑x_1 β†’ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ (βˆƒ i, βˆƒ (_ : i βŠ‚ s), x ∈ (convexHull π•œ) ↑i) β†’ βˆƒ w, βˆƒ (_ : βˆ€ y ∈ s, 0 ≀ w y) (_ : βˆ‘ y ∈ s, w y = 1) (_ : βˆƒ y ∈ s, w y = 0), s.centerMass w id = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
intro t ts hx
case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ βˆ€ x_1 βŠ‚ s, x ∈ (convexHull π•œ) ↑x_1 β†’ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s hx : x ∈ (convexHull π•œ) ↑t ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t : Finset E x✝ x : E ⊒ βˆ€ x_1 βŠ‚ s, x ∈ (convexHull π•œ) ↑x_1 β†’ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rw [Finset.convexHull_eq, Set.mem_setOf_eq] at hx
case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s hx : x ∈ (convexHull π•œ) ↑t ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s hx : βˆƒ w, (βˆ€ y ∈ t, 0 ≀ w y) ∧ βˆ‘ y ∈ t, w y = 1 ∧ t.centerMass w id = x ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s hx : x ∈ (convexHull π•œ) ↑t ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rcases hx with ⟨w, hwβ‚€, hw₁, hx⟩
case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s hx : βˆƒ w, (βˆ€ y ∈ t, 0 ≀ w y) ∧ βˆ‘ y ∈ t, w y = 1 ∧ t.centerMass w id = x ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
case h.mp.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s hx : βˆƒ w, (βˆ€ y ∈ t, 0 ≀ w y) ∧ βˆ‘ y ∈ t, w y = 1 ∧ t.centerMass w id = x ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rcases Finset.exists_of_ssubset ts with ⟨y, hys, hyt⟩
case h.mp.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
case h.mp.intro.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
let w' z := if z ∈ t then w z else 0
case h.mp.intro.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
case h.mp.intro.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
have hw'₁ : s.sum w' = 1 := by rwa [← Finset.sum_subset ts.1, Finset.sum_extend_by_zero] simp only [ite_eq_right_iff] tauto
case h.mp.intro.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
case h.mp.intro.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
refine' ⟨w', _, hw'₁, ⟨_, β€Ήy ∈ sβ€Ί, _⟩, _⟩
case h.mp.intro.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x
case h.mp.intro.intro.intro.intro.intro.refine'_1 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ€ y ∈ s, 0 ≀ w' y case h.mp.intro.intro.intro.intro.intro.refine'_2 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ w' y = 0 case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ s.centerMass w' id = x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆƒ w, (βˆ€ y ∈ s, 0 ≀ w y) ∧ βˆ‘ y ∈ s, w y = 1 ∧ (βˆƒ y ∈ s, w y = 0) ∧ s.centerMass w id = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rw [← Finset.centerMass_subset id ts.1]
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ s.centerMass w' id = x
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ t.centerMass w' id = x case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ€ i ∈ s, i βˆ‰ t β†’ w' i = 0
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ s.centerMass w' id = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
exact fun i _ hi => if_neg hi
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ€ i ∈ s, i βˆ‰ t β†’ w' i = 0
no goals
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ€ i ∈ s, i βˆ‰ t β†’ w' i = 0 TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rwa [← Finset.sum_subset ts.1, Finset.sum_extend_by_zero]
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 ⊒ s.sum w' = 1
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 ⊒ βˆ€ x ∈ s, x βˆ‰ t β†’ (if x ∈ t then w x else 0) = 0
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 ⊒ s.sum w' = 1 TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
simp only [ite_eq_right_iff]
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 ⊒ βˆ€ x ∈ s, x βˆ‰ t β†’ (if x ∈ t then w x else 0) = 0
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 ⊒ βˆ€ x ∈ s, x βˆ‰ t β†’ x ∈ t β†’ w x = 0
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 ⊒ βˆ€ x ∈ s, x βˆ‰ t β†’ (if x ∈ t then w x else 0) = 0 TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
tauto
π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 ⊒ βˆ€ x ∈ s, x βˆ‰ t β†’ x ∈ t β†’ w x = 0
no goals
Please generate a tactic in lean4 to solve the state. STATE: π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 ⊒ βˆ€ x ∈ s, x βˆ‰ t β†’ x ∈ t β†’ w x = 0 TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rintro y -
case h.mp.intro.intro.intro.intro.intro.refine'_1 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ€ y ∈ s, 0 ≀ w' y
case h.mp.intro.intro.intro.intro.intro.refine'_1 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E ⊒ 0 ≀ w' y
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_1 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ€ y ∈ s, 0 ≀ w' y TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
change 0 ≀ ite (y ∈ t) (w y) 0
case h.mp.intro.intro.intro.intro.intro.refine'_1 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E ⊒ 0 ≀ w' y
case h.mp.intro.intro.intro.intro.intro.refine'_1 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E ⊒ 0 ≀ if y ∈ t then w y else 0
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_1 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E ⊒ 0 ≀ w' y TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
split_ifs
case h.mp.intro.intro.intro.intro.intro.refine'_1 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E ⊒ 0 ≀ if y ∈ t then w y else 0
case pos π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E h✝ : y ∈ t ⊒ 0 ≀ w y case neg π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E h✝ : y βˆ‰ t ⊒ 0 ≀ 0
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_1 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E ⊒ 0 ≀ if y ∈ t then w y else 0 TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
apply hwβ‚€ y β€Ή_β€Ί
case pos π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E h✝ : y ∈ t ⊒ 0 ≀ w y
no goals
Please generate a tactic in lean4 to solve the state. STATE: case pos π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E h✝ : y ∈ t ⊒ 0 ≀ w y TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rfl
case neg π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E h✝ : y βˆ‰ t ⊒ 0 ≀ 0
no goals
Please generate a tactic in lean4 to solve the state. STATE: case neg π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y✝ : E hys : y✝ ∈ s hyt : y✝ βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 y : E h✝ : y βˆ‰ t ⊒ 0 ≀ 0 TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
apply if_neg β€Ήy βˆ‰ tβ€Ί
case h.mp.intro.intro.intro.intro.intro.refine'_2 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ w' y = 0
no goals
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_2 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ w' y = 0 TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rw [Finset.centerMass_eq_of_sum_1]
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ t.centerMass w' id = x
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i β€’ id i = x case h.mp.intro.intro.intro.intro.intro.refine'_3.hw π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i = 1
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ t.centerMass w' id = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rwa [Finset.sum_extend_by_zero]
case h.mp.intro.intro.intro.intro.intro.refine'_3.hw π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i = 1
no goals
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_3.hw π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i = 1 TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rw [Finset.centerMass_eq_of_sum_1 _ _ hw₁] at hx
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i β€’ id i = x
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : βˆ‘ i ∈ t, w i β€’ id i = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i β€’ id i = x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : t.centerMass w id = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i β€’ id i = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rw [← hx]
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : βˆ‘ i ∈ t, w i β€’ id i = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i β€’ id i = x
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : βˆ‘ i ∈ t, w i β€’ id i = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i β€’ id i = βˆ‘ i ∈ t, w i β€’ id i
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : βˆ‘ i ∈ t, w i β€’ id i = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i β€’ id i = x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
apply Finset.sum_congr rfl
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : βˆ‘ i ∈ t, w i β€’ id i = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i β€’ id i = βˆ‘ i ∈ t, w i β€’ id i
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : βˆ‘ i ∈ t, w i β€’ id i = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ€ x ∈ t, w' x β€’ id x = w x β€’ id x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : βˆ‘ i ∈ t, w i β€’ id i = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ‘ i ∈ t, w' i β€’ id i = βˆ‘ i ∈ t, w i β€’ id i TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
intro x hx
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : βˆ‘ i ∈ t, w i β€’ id i = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ€ x ∈ t, w' x β€’ id x = w x β€’ id x
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝¹ x✝ : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx✝ : βˆ‘ i ∈ t, w i β€’ id i = x✝ y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 x : E hx : x ∈ t ⊒ w' x β€’ id x = w x β€’ id x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝ x : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx : βˆ‘ i ∈ t, w i β€’ id i = x y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 ⊒ βˆ€ x ∈ t, w' x β€’ id x = w x β€’ id x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
change ite _ _ _ β€’ _ = _
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝¹ x✝ : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx✝ : βˆ‘ i ∈ t, w i β€’ id i = x✝ y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 x : E hx : x ∈ t ⊒ w' x β€’ id x = w x β€’ id x
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝¹ x✝ : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx✝ : βˆ‘ i ∈ t, w i β€’ id i = x✝ y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 x : E hx : x ∈ t ⊒ (if x ∈ t then w x else 0) β€’ id x = w x β€’ id x
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝¹ x✝ : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx✝ : βˆ‘ i ∈ t, w i β€’ id i = x✝ y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 x : E hx : x ∈ t ⊒ w' x β€’ id x = w x β€’ id x TACTIC:
https://github.com/YaelDillies/LeanCamCombi.git
034199694e3b91536d03bc4a8b0cdbd659cdf50f
LeanCamCombi/SimplicialComplex/Simplex.lean
combiFrontier_eq
[90, 1]
[135, 14]
rw [if_pos hx]
case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝¹ x✝ : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx✝ : βˆ‘ i ∈ t, w i β€’ id i = x✝ y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 x : E hx : x ∈ t ⊒ (if x ∈ t then w x else 0) β€’ id x = w x β€’ id x
no goals
Please generate a tactic in lean4 to solve the state. STATE: case h.mp.intro.intro.intro.intro.intro.refine'_3 π•œ : Type u_1 E : Type u_2 ΞΉ : Type u_3 inst✝² : LinearOrderedField π•œ inst✝¹ : AddCommGroup E inst✝ : Module π•œ E s t✝ : Finset E x✝¹ x✝ : E t : Finset E ts : t βŠ‚ s w : E β†’ π•œ hwβ‚€ : βˆ€ y ∈ t, 0 ≀ w y hw₁ : βˆ‘ y ∈ t, w y = 1 hx✝ : βˆ‘ i ∈ t, w i β€’ id i = x✝ y : E hys : y ∈ s hyt : y βˆ‰ t w' : E β†’ π•œ := fun z => if z ∈ t then w z else 0 hw'₁ : s.sum w' = 1 x : E hx : x ∈ t ⊒ (if x ∈ t then w x else 0) β€’ id x = w x β€’ id x TACTIC: