Metamath Proof Explorer


Theorem ppisval2

Description: The set of primes less than A expressed using a finite set of integers. (Contributed by Mario Carneiro, 22-Sep-2014)

Ref Expression
Assertion ppisval2 ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M → 0 A ∩ ℙ = M … A ∩ ℙ

Proof

Step Hyp Ref Expression
1 ppisval ⊢ A ∈ ℝ → 0 A ∩ ℙ = 2 … A ∩ ℙ
2 1 adantr ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M → 0 A ∩ ℙ = 2 … A ∩ ℙ
3 fzss1 ⊢ 2 ∈ ℤ ≥ M → 2 … A ⊆ M … A
4 3 adantl ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M → 2 … A ⊆ M … A
5 4 ssrind ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M → 2 … A ∩ ℙ ⊆ M … A ∩ ℙ
6 elin ⊢ x ∈ M … A ∩ ℙ ↔ x ∈ M … A ∧ x ∈ ℙ
7 6 bilani ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M ∧ x ∈ M … A ∩ ℙ → x ∈ M … A ∧ x ∈ ℙ
8 7 simprd ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M ∧ x ∈ M … A ∩ ℙ → x ∈ ℙ
9 prmuz2 ⊢ x ∈ ℙ → x ∈ ℤ ≥ 2
10 8 9 syl ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M ∧ x ∈ M … A ∩ ℙ → x ∈ ℤ ≥ 2
11 7 simpld ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M ∧ x ∈ M … A ∩ ℙ → x ∈ M … A
12 elfzuz3 ⊢ x ∈ M … A → A ∈ ℤ ≥ x
13 11 12 syl ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M ∧ x ∈ M … A ∩ ℙ → A ∈ ℤ ≥ x
14 elfzuzb ⊢ x ∈ 2 … A ↔ x ∈ ℤ ≥ 2 ∧ A ∈ ℤ ≥ x
15 10 13 14 sylanbrc ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M ∧ x ∈ M … A ∩ ℙ → x ∈ 2 … A
16 15 8 elind ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M ∧ x ∈ M … A ∩ ℙ → x ∈ 2 … A ∩ ℙ
17 5 16 eqelssd ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M → 2 … A ∩ ℙ = M … A ∩ ℙ
18 2 17 eqtrd ⊢ A ∈ ℝ ∧ 2 ∈ ℤ ≥ M → 0 A ∩ ℙ = M … A ∩ ℙ